Secant method
Root-finding 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 secant method can be thought of as a finite-difference approximation of Newton's method, so it is considered a quasi-Newton method.
Nº Q14915286 ★★
Uncommon · History
Secant method
Root-finding 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 secant method can be thought of as a finite-difference approximation of Newton's method, so it is considered a quasi-Newton method.
From Wikipedia
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 secant method can be thought of as a finite-difference approximation of Newton's method, so it is considered a quasi-Newton method. Historically, it is as an evolution of the method of false position, which predates Newton's method by over 3000 years.
Text: Wikipédia, CC BY-SA 4.0. · Image: Original: Ralf Pfeifer at German Wikipedia Derivative work:... (CC BY-SA 3.0) ·
Related cards
-
Newton's method in optimization
Method for finding stationary points of a function
Nº Q17086396 ★
Not listed
-
Separation of variables
Method
Nº Q913323 ★★
Not listed
-
Laplace's method
Technique used to approximate integrals
Nº Q2058297 ★
Not listed
-
Newton's method
Algorithm for finding a zero of a function
Nº Q374195 ★★★
Not listed
-
Aitken's delta-squared process
Numerical analysis series acceleration method
Nº Q492177 ★
Not listed
-
S
Second derivative test
Nº Q3520081 ★
Not listed