Thread: Numerical Methods that we use for Computing

Most of you will be familiar with the simple numerical methods that we use for computing, like the Euler and Range-kutta method. These are relatively simple yet powerful methods. For advanced-level problems we may need more functions as well, Let's take the beta function that is given mathematically as:



But you are safe when you are in Octave as you have the betaine (x, a, b) function . So is the case with gamma and incomplete gamma functions. Hence, you can easily write algorithms (in Octave-like language) just by remembering things like [gamma (a, x), gammaln (a, x), etc. You can make use of these types of tools while trying to meddle with tasks like finding the Hessenberg decomposition of the Cholesky factor.