Search Results for ""
1 - 10 of 576 for Muller's methodSearch Results
Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...
A particular way of doing something, sometimes also called an algorithm or procedure. (According to Petkovšek et al. (1996), "a method is a trick that has worked at least ...
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 ...
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 ...
...
View search results from all Wolfram sites (17374 matches)