Explicit pseudo two-step runge-kutta methods for parallel computers∗
DOI10.1080/00207169908804881zbMath0945.65081OpenAlexW2091032504MaRDI QIDQ4935391
Publication date: 5 October 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804881
stabilitynumerical experimentsparallel computationcollocationorder conditionscomparisonsexplicit pseudo two-step Runge-Kutta methods
Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) 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)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient block predictor-corrector methods with a small number of corrections
- Parallel block predictor-corrector methods of Runge-Kutta type
- Parallel iteration of symmetric Runge-Kutta methods for nonstiff initial-value problems
- Explicit parallel two-step Runge-Kutta-Nyström methods
- Parallel iteration of high-order Runge-Kutta methods with stepsize control
- Collocation-based two-step Runge-Kutta methods
- A class of explicit parallel two-step Runge-Kutta methods
- Two-Step Runge–Kutta Methods
- High-order Explicit Runge-Kutta Formulae, Their Uses, and Limitations
- The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form
- Comparing Numerical Methods for Ordinary Differential Equations
This page was built for publication: Explicit pseudo two-step runge-kutta methods for parallel computers∗