Content deleted Content added
mNo edit summary |
|||
Line 24:
The asymptotic behaviour is very good: generally, the iterates ''x''<sub>''n''</sub> converge fast to the root once they get close. However, performance is often quite poor if you do not start very close to the actual root. For instance, if by any chance two of the function values ''f''<sub>''n''−2</sub>, ''f''<sub>''n''−1</sub> and ''f''<sub>''n''</sub> coincide, the algorithm fails completely. Thus, inverse quadratic interpolation is seldom used as a stand-alone algorithm.
The order of this convergence is approximately 1.8, it can be proved by the Secant Method analysis.
==Comparison with other root-finding methods==
| |||