Search Results for ""

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

A method of determining coefficients alpha_l in an expansion y(x)=y_0(x)+sum_(l=1)^qalpha_ly_l(x) so as to nullify the values of an ordinary differential equation L[y(x)]=0 ...

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

A method of determining coefficients alpha_k in a power series solution y(x)=y_0(x)+sum_(k=1)^nalpha_ky_k(x) of the ordinary differential equation L^~[y(x)]=0 so that ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

The method of exhaustion was an integral-like limiting process used by Archimedes to compute the area and volume of two-dimensional lamina and three-dimensional solids.

A method for predicting the onset of widespread chaos. It is based on the hypothesis that the dissolution of an invariant torus can be associated with the sudden change from ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...