No label defined (Q4937784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1403886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1403886 |
Statements
27 March 2000
0 references
multistep Runge-Kutta
0 references
third-order method
0 references
fourth-order method
0 references
fifth-order method
0 references
higher order derivatives
0 references
Runge-Kutta methods
0 references
0 references
0.9323363
0 references
0.9190426
0 references
0.90749407
0 references
0.9040034
0 references
0.9023302
0 references
0.89802194
0 references
0.89485973
0 references
Given \(y'=f(y)\), standard Runge-Kutta methods perform multiple evaluations of \(f(y)\) in each integration sub-interval as required for a given accuracy. Evaluations of \(y''=f_{y}f\) or higher derivatives are not considered due to the assumption that the calculations involved in these functions exceed those of \(f\). However, \(y''\) can be approximated to sufficient accuracy from past and current evaluations of \(f\) to achieve a higher order of accuracy than is available through current functional evaluations alone. In July of 1998 at the Auckland Numerical Ordinary Differential Equations Workshop, we introduced a new class of Runge-Kutta methods based on this observation. We presented a third-order method which requires only two evaluations of \(f\) and a fourth-order method which requires three. This paper reviews these two methods and gives the general solution to the equations generated by the fifth-order methods of this new class. Interestingly, these fifth-order methods require only four functional evaluations per step whereas standard Runge-Kutta methods require six.
0 references