Content deleted Content added
Jasper Deng (talk | contribs) →Behaviour: remove second person |
|||
Line 25:
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 the initial values are not 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.
==Comparison with other root-finding methods==
| |||