Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Secant method
open-in-new
<p>In <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>, the secant method is a <a href="/facts/Root-finding_algorithm/IxTDkhBq">root-finding algorithm</a> that uses a succession of <a href="/facts/Root_of_a_function/mlK3dhoT">roots</a> of <a href="/facts/Secant_line/gJnaF5g3">secant lines</a> to better approximate a root of a <a href="/facts/Function_(mathematics)/CdReEKCh">function</a> <i>f</i>. The secant method can be thought of as a <a href="/facts/Finite-difference/aY1txFhj">finite-difference</a> approximation of <a href="/facts/Newton%27s_method/VlRhI2FL">Newton's method</a>, so it is considered a <a href="/facts/Quasi-Newton_method/1YX1vMRa">quasi-Newton method</a>. Historically, it is as an evolution of the <a href="/facts/Regula_falsi/bMuhM6pl">method of false position</a>, which predates Newton's method by over 3000 years. </p>