Search Results for ""

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

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 root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

An extension of the secant method of root finding to higher dimensions.

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

A method for predicting the onset of widespread chaos.

A method for constructing magic squares of singly even order n>=6.

A method for constructing magic squares of odd order.

A method for constructing magic squares of odd order, also called de la Loubere's method.