method+of+computation
41Householder's method — In numerical analysis, the class of Householder s methods are root finding algorithms used for functions of one real variable with continuous derivatives up to some order d+1 , where d will be the order of the Householder s method.The algorithm… …
42Conjugate residual method — The conjugate residual method is an iterative numeric method used for solving systems of linear equations. It s a Krylov subspace method very similar to the much more popular conjugate gradient method, with similar construction and convergence… …
43Halley's method — In numerical analysis, Halley s method is a root finding algorithm used for functions of one real variable with a continuous second derivative, i.e. C2 functions. It is named after its inventor Edmond Halley who also discovered Halley s Comet.The …
44Chebyshev pseudospectral method — The Chebyshev pseudospectral method for optimal control problems is based on Chebyshev polynomials of the first kind. Unlike the Legendre pseudospectral method, the Chebyshev pseudospectral (PS) method does not immediately offer high accuracy… …
45Level set method — The level set method (sometimes abbreviated as LSM) is a numerical technique for tracking interfaces and shapes. The advantage of the level set method is that one can perform numerical computations involving curves and surfaces on a fixed… …
46Probabilistic method — This article is not about probabilistic algorithms, which give the right answer with high probability but not with certainty, nor about Monte Carlo methods, which are simulations relying on pseudo randomness. The probabilistic method is a… …
47Dormand–Prince method — In numerical analysis, the Dormand–Prince method, or DOPRI method, is a method for solving ordinary differential equations (Dormand Prince 1980). The method is a member of the Runge–Kutta family of ODE solvers. More specifically, it uses six… …
48Monte Carlo method for photon transport — Modeling photon propagation with Monte Carlo methods is a flexible yet rigorous approach to simulate photon transport. In the method, local rules of photon transport are expressed as probability distributions which describe the step size of… …
49Prony's method — Prony analysis (Prony s method) was developed by Gaspard Riche de Prony in 1795. However, practical use of the method awaited the digital computer [1] . Similar to the Fourier transform, Prony s method extracts valuable information from a… …
50Aberth method — The Aberth method, sometimes named Aberth Ehrlich method is a root finding algorithm for simultaneous approximation of all the roots of a univariate polynomial. The fundamental theorem of algebra states that for each polynomial with complex… …
