Content deleted Content added
Jitse Niesen (talk | contribs) inverse quadratic interpolation is a root-finding algorithm |
Jitse Niesen (talk | contribs) m disamb inverse |
||
Line 1:
In [[numerical analysis]], '''inverse quadratic interpolation''' is a [[root-finding algorithm]], meaning that it is an algorithm for solving equations of the form ''f''(''x'') = 0. The idea is to use [[polynomial interpolation|quadratic interpolation]] to approximate the [[inverse function|inverse]] of ''f''. This algorithm is rarely used on its own, but it is important because it forms part of the popular [[Brent's method]].
==The method==
| |||