词条 | Predictor–corrector method |
释义 |
In numerical analysis, predictor–corrector methods belong to a class of algorithms 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:
Predictor–corrector methods for solving ODEsWhen considering the numerical solution of ordinary differential equations (ODEs), a predictor–corrector method typically uses an explicit method for the predictor step and an implicit method for the corrector step. Example: Euler method with the trapezoidal ruleA simple predictor–corrector method (known as Heun's method) can be constructed from the Euler method (an explicit method) and the trapezoidal rule (an implicit method). Consider the differential equation and denote the step size by . First, the predictor step: starting from the current value , calculate an initial guess value via the Euler method, Next, the corrector step: improve the initial guess using trapezoidal rule, That value is used as the next step. PEC mode and PECE modeThere 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: It is also possible to evaluate the function f only once per step by using the method in Predict–Evaluate–Correct (PEC) mode: 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: The PECEC mode has one fewer function evaluation. More generally, if the corrector is run k times, the method is in P(EC)k or P(EC)kE mode. If the corrector method is iterated until it converges, this could be called PE(CE)∞.[1] See also
Notes1. ^{{harvnb|Butcher|2003|p=104}} References
External links
2 : Algorithms|Numerical analysis |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。