词条 | Dormand–Prince method | ||||||||||||||||||||||||||||||||||||||||||||||
释义 |
In numerical analysis, the Dormand–Prince (RKDP) method or DOPRI method, is an explicit method for solving ordinary differential equations {{harv|Dormand|Prince|1980}}. The method is a member of the Runge–Kutta family of ODE solvers. More specifically, it uses six function evaluations to calculate fourth- and fifth-order accurate solutions. The difference between these solutions is then taken to be the error of the (fourth-order) solution. This error estimate is very convenient for adaptive stepsize integration algorithms. Other similar integration methods are Fehlberg (RKF) and Cash–Karp (RKCK). The Dormand–Prince method has seven stages, but it uses only six function evaluations per step because it has the FSAL (First Same As Last) property: the last stage is evaluated at the same point as the first stage of the next step. Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution. This is the main difference with the Fehlberg method, which was constructed so that the fourth-order solution has a small error. For this reason, the Dormand–Prince method is more suitable when the higher-order solution is used to continue the integration, a practice known as local extrapolation ({{harvnb|Shampine|1986}}; {{harvnb|Hairer|Nørsett|Wanner|2008|pages=178–179}}). Dormand–Prince is currently the default method in the The Butcher tableau is:
The first row of b coefficients gives the fifth-order accurate solution, and the second row gives an alternative solution which, when subtracted from the first solution, yields the error estimate. Notes1. ^See http://www.unige.ch/~hairer/prog/nonstiff/dopri5.f References
2 : Numerical differential equations|Runge–Kutta methods |
||||||||||||||||||||||||||||||||||||||||||||||
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。