Estimates of the rate of convergence of Runge-Kutta type algorithms with random errors and with consideration of the calculation time

MaRDI QIDQ2739934zbMATHFDO

Authors V. V. Anisimov, G. V. Livins'ka

Publication date 16 September 2001

Published in Zhurnal Obchyslyuval'noïta Prykladnoï Matematyky (Search for Journal in Brave)

zbMATH Keywords

convergenceCauchy problemrandom errorsRunge-Kutta type numerical algorithms

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Recommendations

• Error analysis of a randomized numerical method
• Estimates for the Rate of Convergence in Ordinary Differential Equations under the Action of Random Processes with Fast Time
• Randomized Runge-Kutta method -- stability and convergence under inexact information
• scientific article; zbMATH DE number 3986556
• scientific article; zbMATH DE number 3905769

Cited in

(1)

• Error analysis of randomized Runge-Kutta methods for differential equations with time-irregular coefficients

This page was built for publication: Estimates of the rate of convergence of Runge-Kutta type algorithms with random errors and with consideration of the calculation time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739934)