Content deleted Content added
Line 18:
Similar to [[Newton's method]] and most other quadratically convergent methods, the crucial weakness with the method is the choice of the starting value <math>x_0</math> . If the value of <math>x_0</math> is not "close enough" to the actual solution, the method will fail and the sequence of values <math>x_0, x_1, x_2, x_3,\dots</math> will either flip flop between two extremes, or diverge to infinity (possibly both!).
The version of [[Steffensen's Method]] implemented in the [[MATLAB]] code shown below can be found using the [[Aitken's delta-squared process]] for accelerating convergence of a sequence, yielding the formula
:<math>P = P_n - \frac{(P_{n+2}P_n-P_{n+1})^2}{P_{n+2}-2P_{n+1}+P_n}</math> ==Implementation in Matlab==
| |||