Content deleted Content added
minor grammar fix |
RowanElder (talk | contribs) Copyedit of lead section, then expanded the lead section to include a bit more on what is in the article, particularly the Aitken method derivation and the Banach space generalization. |
||
Line 1:
{{short description|Newton-like root-finding algorithm that does not use derivatives}}
In [[numerical analysis]], '''Steffensen's method''' is an [[iterative method]] for numerical [[root-finding method|root-finding]] named after [[Johan Frederik Steffensen]]
Steffenson's method can be derived as an adaptation of [[Aitken's delta-squared process]] applied to [[fixed-point iteration]]. Viewed in this way, Steffenson's method naturally generalizes to efficient fixed-point calculation in general [[Banach space|Banach spaces]], whenever fixed points are guaranteed to exist and fixed point iteration is guaranteed to converge, although possibly slowly, by the [[Banach fixed-point theorem]].
==Simple description==
| |||