Content deleted Content added
m . Tag: Reverted |
Iiii I I I (talk | contribs) Reverted 1 edit by QuanHitter10000 (talk) to last revision by 83.94.235.32 |
||
Line 1:
'''Sidi's generalized secant method''' is a [[root-finding algorithm]], that is, a [[numerical method]] for solving [[equations]] of the form <math>f(x)=0</math> . The method was published
by [[Avram Sidi]].<ref> Sidi, Avram, "Generalization Of The Secant Method For Nonlinear Equations", Applied Mathematics E-notes '''8''' (2008), 115–123, http://www.math.nthu.edu.tw/~amen/2008/070227-1.pdf
</ref>
The method is a generalization of the [[secant method]]. Like the secant method, it is an [[iterative method]] which requires one evaluation of <math>f</math> in each iteration and no [[derivative]]s of <math>f</math>. The method can converge much faster though, with an [[Rate of convergence|order]] which approaches 2 provided that <math>f</math> satisfies the regularity conditions described below.
== Algorithm ==
|