Estimating the error of the classic Runge-Kutta formula (Q1805273): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lawrence F. Shampine / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: J. B. Butler jun. / rank
Normal rank
 
Property / author
 
Property / author: Lawrence F. Shampine / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: J. B. Butler jun. / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nag / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(94)90117-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094340131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Runge-Kutta Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automatic integration of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ODE solvers and the method of lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Error Estimates for ODE<scp>s</scp> Based on Extrapolation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourth-order Runge-Kutta integration with stepsize control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-step truncation error estimates for Runge-Kutta methods of order 4 or less / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Error Estimators for Runge-Kutta Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Aspects of Interpolation in Runge-Kutta Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Value Routines in the NAG Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Recurrence for Computing Runge–Kutta Truncation Error Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Theoretical Approach to Runge–Kutta Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of embedded Runge-Kutta formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039901 / rank
 
Normal rank

Latest revision as of 13:18, 23 May 2024

scientific article
Language Label Description Also known as
English
Estimating the error of the classic Runge-Kutta formula
scientific article

    Statements

    Estimating the error of the classic Runge-Kutta formula (English)
    0 references
    0 references
    0 references
    18 February 1996
    0 references
    An estimator is introduced for the stepwise error in the popular four- point Runge-Kutta algorithm for approximating the solution to an ordinary differential equation and the estimator is compared theoretically with the estimator obtained by interval doubling and an estimator given by \textit{J. A. Zonneveld} [Automatic numerical integration (1964; Zbl 0139.319)]. In addition a general method is presented to judge effectiveness and cost of an error estimator. The estimator based on doubling requires 11 function evaluations, Zonneveld's requires 8, and the new estimate 7 evaluations. The new estimator may be regarded as no cost in that the 7 function evaluations are exactly those needed to implement the doubling algorithm. If the doubling algorithm is written (i) \(y_{n + 1} = y_n + (h/12)\), \((f_0 + 2f_1 + 2f_2 + f_3 + f_4 + 2f_5 + 2f_6 + f_7)\) then the estimate, \(\text{est}_n \approx y_{n + 1} - y(x_n + h)\) is given by (ii) \(\text{est}_n = (h/72) (-f_1 + 2f_2 - f_3 - 2f_4 + 3f_5 - f_7)\).
    0 references
    four-point Runge-Kutta algorithm
    0 references
    interval doubling
    0 references
    error estimator
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references