Predictor–corrector method: Difference between revisions

Revision as of 20:47, 28 September 2017

Latest revision as of 17:19, 28 November 2024

(2 intermediate revisions by 2 users not shown)

Line 1:

{{Short description|Algorithms in numerical analysis}}

In [[numerical analysis]], '''predictor–corrector methods''' belong to a class of [[algorithm]]s designed to integrate ordinary differential equations{{snd}}to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps:

Line 52 ⟶ 53:

\end{align} </math>

The PECEC mode has one fewer function evaluation. than PECECE mode.

More generally, if the corrector is run ''k'' times, the method is in P(EC)^''k''

or P(EC)^''k''E mode. If the corrector method is iterated until it converges, this could be called PE(CE)^∞.<ref>{{harvnb|Butcher|2003|p=104}}</ref>

Line 73 ⟶ 76:

* {{MathWorld |title=Predictor-Corrector Methods |urlname=Predictor-CorrectorMethods}}

* [https://web.archive.org/web/20080617035745/http://www.fisica.uniud.it/~ercolessi/md/md/node22.html Predictor–corrector methods] for differential equations

{{Numerical integrators}}

{{DEFAULTSORT:Predictor-corrector method}}