Secant Method

A Root-finding algorithm which assumes a function to be approximately linear in the region of interest. Eachimprovement is taken as the point where the approximating line crosses the axis. The secant method retains only themost recent estimate, so the root does not necessarily remain bracketed. When the Algorithm does converge, itsorder of convergence is

(1)

(2)

(3)

(4)

(5)

References

Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Secant Method, False Position Method, and Ridders' Method.'' §9.2 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 347-352, 1992.

• Dirty Beam
• Dirty Map
• Disc
• Disconnected Form
• Disconnectivity
• Discontinuity
• Discontinuous
• Discordant Permutation
• Discrepancy Theorem
• Discrete Distribution
• Discrete Fourier Transform
• Discrete Mathematics
• Discrete Set
• Discrete Uniform Distribution
• Discriminant
• Discriminant (Binary Quadratic Form)
• Discriminant (Elliptic Curve)
• Discriminant (Metric)
• Discriminant (Module)
• Discriminant (Polynomial)
• Discriminant (Quadratic Curve)
• Discriminant (Quadratic Form)
• Discriminant (Second Derivative Test)
• Disdyakis Dodecahedron
• Disdyakis Triacontahedron