- secant method
- Смотри метод секущих.
Энциклопедический словарь по металлургии. — М.: Интермет Инжиниринг. Главный редактор Н.П. Лякишев. 2000.
secant method
Смотреть что такое "secant method" в других словарях:
Secant method — In numerical analysis, the secant method is a root finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f .The methodThe secant method is defined by the recurrence relation:x {n+1} = x n… … Wikipedia
Secant — is a term in mathematics. It comes from the Latin secare (to cut). It can refer to: * a secant line, in geometry * the trigonometric function called secant * the secant method, a root finding algorithm in numerical analysismathdab … Wikipedia
Brent's method — In numerical analysis, Brent s method is a complicated but popular root finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. It has the reliability of bisection but it can be as quick as some of … Wikipedia
False position method — The false position method or regula falsi method is a term for problem solving methods in algebra and calculus. In simple terms, these methods begin by attempting to evaluate a problem using test ( false ) values for the variables, and then… … Wikipedia
Broyden's method — In mathematics, Broyden s method is a quasi Newton method for the numerical solution of nonlinear equations in more than one variable. It was originally described by C. G. Broyden in 1965. [cite journal last = Broyden first = C. G. title = A… … Wikipedia
Quasi-Newton method — In optimization, quasi Newton methods (also known as variable metric methods) are well known algorithms for finding local maxima and minima of functions. Quasi Newton methods are based on Newton s method to find the stationary point of a function … Wikipedia
Müller's method — is a root finding algorithm, a numerical method for solving equations of the form f(x) = 0. It is first presented by D. E. Müller in 1956. Müller s method is based on the secant method, which constructs at every iteration a line through two… … Wikipedia
Steffensen's method — In numerical analysis, Steffensen s method is a root finding method. It is similar to Newton s method and it also achieves quadratic convergence, but it does not use derivatives. The method is named after Johan Frederik Steffensen.imple… … Wikipedia
BFGS method — In mathematics, the Broyden Fletcher Goldfarb Shanno (BFGS) method is a method to solve an unconstrained nonlinear optimization problem. The BFGS method is derived from the Newton s method in optimization, a class of hill climbing optimization… … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
