|
|
| Line 1: |
Line 1: |
| In [[mathematics]], particularly [[numerical analysis]], a '''predictor–corrector method''' is an [[algorithm]] that proceeds in two steps. First, the prediction step calculates a rough approximation of the desired quantity. Second, the corrector step refines the initial approximation using another means.
| | Blake is actually what her other half enjoys to contact her yet folks always misspell it. I made use of to be unemployed now I am actually a supervisor and also I'm performing respectable monetarily. What me and my household affection is to act and I would certainly never give it up. Years ago he transferred to Massachusetts however his other half prefers them to transfer. Have a look at her web site right here: [http://billiebites.blogspot.com.br/2011/01/party-food-happy-2nd-birthday-henry.html car transport] |
| __TOC__
| |
| | |
| == Predictor–corrector methods for solving ODEs ==
| |
| | |
| When considering the [[numerical methods for ordinary differential equations|numerical solution of ordinary differential equations (ODEs)]], a predictor–corrector method typically uses an [[explicit and implicit methods|explicit method]] for the predictor step and an implicit method for the corrector step.
| |
| | |
| === Example: Euler method with the trapezoidal rule ===
| |
| | |
| A simple predictor–corrector method (known as [[Heun's method]]) can be constructed from the [[Euler method]] (an explicit method) and the [[trapezoidal rule (differential equations)|trapezoidal rule]] (an implicit method).
| |
| | |
| Consider the differential equation
| |
| | |
| : <math> y' = f(t,y), \quad y(t_0) = y_0, </math>
| |
| | |
| and denote the step size by <math>h</math>. | |
| | |
| First, the predictor step: starting from the current value <math>y_i</math>, calculate an initial guess value <math>\tilde{y}_{i+1}</math> via the Euler method,
| |
| | |
| : <math>\tilde{y}_{i+1} = y_i + h f(t_i,y_i). </math>
| |
| | |
| Next, the corrector step: improve the initial guess using trapezoidal rule,
| |
| | |
| : <math> y_{i+1} = y_i + \tfrac12 h \bigl( f(t_i, y_i) + f(t_{i+1},\tilde{y}_{i+1}) \bigr). </math>
| |
| | |
| That value is used as the next step.
| |
| | |
| === PEC mode and PECE mode ===
| |
| | |
| There are different variants of a predictor–corrector method, depending on how often the corrector method is applied. The Predict–Evaluate–Correct–Evaluate (PECE) mode refers to the variant in the above example:
| |
| | |
| : <math> \begin{align} | |
| \tilde{y}_{i+1} &= y_i + h f(t_i,y_i), \\
| |
| y_{i+1} &= y_i + \tfrac12 h \bigl( f(t_i, y_i) + f(t_{i+1},\tilde{y}_{i+1}) \bigr).
| |
| \end{align} </math>
| |
| | |
| It is also possible to evaluate the function ''f'' only once per step by using the method in Predict–Evaluate–Correct (PEC) mode:
| |
| | |
| : <math> \begin{align}
| |
| \tilde{y}_{i+1} &= y_i + h f(t_i,\tilde{y}_i), \\
| |
| y_{i+1} &= y_i + \tfrac12 h \bigl( f(t_i, \tilde{y}_i) + f(t_{i+1},\tilde{y}_{i+1}) \bigr).
| |
| \end{align} </math>
| |
| | |
| Additionally, the corrector step can be repeated in the hope that this achieves an even better approximation to the true solution. If the corrector method is run twice, this yields the PECECE mode:
| |
| | |
| : <math> \begin{align}
| |
| \tilde{y}_{i+1} &= y_i + h f(t_i,y_i), \\
| |
| \hat{y}_{i+1} &= y_i + \tfrac12 h \bigl( f(t_i, y_i) + f(t_{i+1},\tilde{y}_{i+1}) \bigr). \\
| |
| y_{i+1} &= y_i + \tfrac12 h \bigl( f(t_i, y_i) + f(t_{i+1},\hat{y}_{i+1}) \bigr).
| |
| \end{align} </math>
| |
| | |
| The PECEC mode has one fewer function evaluation. More generally, if the corrector is run ''k'' times, the method is in P(EC)<sup>''k''</sup>
| |
| or P(EC)<sup>''k''</sup>E mode. If the corrector method is iterated until it converges, this could be called PE(CE)<sup>∞</sup>.<ref>{{harvnb|Butcher|2003|p=104}}</ref>
| |
| | |
| == See also ==
| |
| | |
| * [[Backward differentiation formula]]
| |
| * [[Beeman's algorithm]]
| |
| * [[Heun's method]]
| |
| * [[Mehrotra predictor–corrector method]]
| |
| * [[Numerical continuation]]
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| * {{Citation | last1=Butcher | first1=John C. | author1-link=John C. Butcher | title=Numerical Methods for Ordinary Differential Equations | publisher=[[John Wiley & Sons]] | location=New York | isbn=978-0-471-96758-3 | year=2003}}.
| |
| *{{Cite book | last1=Press | first1=WH | last2=Teukolsky | first2=SA | last3=Vetterling | first3=WT | last4=Flannery | first4=BP | year=2007 | title=Numerical Recipes: The Art of Scientific Computing | edition=3rd | publisher=Cambridge University Press | publication-place=New York | isbn=978-0-521-88068-8 | chapter=Section 17.6. Multistep, Multivalue, and Predictor-Corrector Methods | chapter-url=http://apps.nrbook.com/empanel/index.html#pg=942}}
| |
| | |
| == External links ==
| |
| | |
| * {{MathWorld |title=Predictor-Corrector Methods |urlname=Predictor–Corrector Methods}}
| |
| * [http://www.fisica.uniud.it/~ercolessi/md/md/node22.html Predictor–corrector methods] for differential equations
| |
| | |
| {{DEFAULTSORT:Predictor-corrector method}}
| |
| [[Category:Algorithms]]
| |
| [[Category:Numerical analysis]]
| |
Blake is actually what her other half enjoys to contact her yet folks always misspell it. I made use of to be unemployed now I am actually a supervisor and also I'm performing respectable monetarily. What me and my household affection is to act and I would certainly never give it up. Years ago he transferred to Massachusetts however his other half prefers them to transfer. Have a look at her web site right here: car transport