Search Results for ""
11 - 20 of 1788 for Finite_difference_methodSearch Results
View search results from all Wolfram sites (32028 matches)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.
Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...
A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...
A variation of the method of false position for finding roots which fits the function in question with an exponential.
...