Efficient block predictor-corrector methods with a small number of corrections
DOI10.1016/0377-0427(93)90270-LzbMath0782.65088MaRDI QIDQ688031
Publication date: 28 February 1994
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical examplecollocation methoderror analysisparallelism\(B\)-seriesblock predictor-corrector methodsnonstiff ordinary differential equations
Nonlinear ordinary differential equations and systems (34A34) Parallel numerical computation (65Y05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Error bounds for numerical methods for ordinary differential equations (65L70)
Related Items
Cites Work
- High order embedded Runge-Kutta formulae
- The error behaviour of a general class of predictor-corrector methods
- On the Butcher group and general multi-value methods
- Iterated Runge–Kutta Methods on Parallel Computers
- Order Properties of Implicit Multivalue Methods for Ordinary Differential Equations
- Block Runge-Kutta Methods on Parallel Computers
- Waveform Iteration and the Shifted Picard Splitting
- The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form
- A Runge-Kutta for all Seasons
- Unnamed Item