Steffensen's method: Difference between revisions

Revision as of 02:31, 18 June 2025

Revision as of 02:39, 18 June 2025

Line 140:

Steffensen's method can also be used to find an input <math>\ x = x_\star\ </math> for a different kind of function <math>\ F\ </math> that produces output the same as its input: <math>\ x_\star = F(x_\star)\ </math> for the special value <math>\ x_\star ~.</math> Solutions like <math>\ x_\star\ </math> are called ''[[fixed point (mathematics)|fixed point]]s''. Many of these functions can be used to find their own solutions by repeatedly recycling the result back as input, but the rate of convergence can be slow, or the function can fail to converge at all, depending on the individual function. Steffensen's method accelerates this convergence, to make it [[quadratic convergence|quadratic]].

AllMomentarily ignoring the issues of a more general [[Banach space]] vs. basic [[real numbers]] being momentarily ignored for the sake of an example: toTo re-orient the reader to the simple earlier explanationsection, a simple [[toy model]] of the fixed-point function, <math>\ \tilde F\ ,</math> can be invented using someany root function <math>\ f\ ,</math> simplycan be made bywith <math>\ \tilde F(x) = x + \varepsilon\ f(x) ~.</math> Here <math>\ \varepsilon\ </math> is a constant smallwith enoughthe inappropriate magnitudesign andthat theis appropriatesmall signenough in magnitude to make <math>\ \tilde F\ </math> stable under iteration, but large enough for the [[non-linearity]] of the function <math>\ f\ </math> to be appreciable.

This method for finding fixed points of a real-valued function has been generalized for functions <math>\ F : X \to X\ </math> that map a [[Banach space]] <math>\ X\ </math> onto itself or even more generally <math>\ F : X \to Y\ </math> that map from one [[Banach space]] <math>X </math> into another [[Banach space]] <math>\ Y ~.</math> The generalized method assumes that a [[Indexed family|family]] of [[Bounded set|bounded]] [[linear operators]] <math>\ \bigl\{\ G(u,v): u, v \in X\ \bigr\}\ </math> associated with <math>\ u\ </math> and <math>\ v\ </math> can be devised that (locally) satisfies the condition<ref name=Johnson-Scholz-1968/>

{{NumBlk|:|<math> F\left( u \right) - F\left( v \right) = G\left( u, v \right)\ \bigl(\ u - v\ \bigr) \quad</math>|{{EquationRef|1}}}}