An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type

DOI10.1016/j.cam.2011.07.015zbMath1228.65112OpenAlexW2073767216MaRDI QIDQ645734

Natalia Kalinnik, Thomas Rauber, Matthias Korch

Publication date: 10 November 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.07.015

zbMATH Keywords

algorithmnumerical examplesordinary differential equationsinitial value problemsRunge-Kutta methodslocalityauto-tuningpredictor-corrector iterationtile size selection

Mathematics Subject Classification ID

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) Packaged methods for numerical algorithms (65Y15)

Uses Software

• ATLAS
• SPIRAL
• RODAS
• FFTW
• PHiPAC
• PAPI
• DynTile

Cites Work

• Parameter optimization for explicit parallel peer two-step methods
• Parallel iteration of high-order Runge-Kutta methods with stepsize control
• Optimized extrapolation methods for parallel solution of IVPs on different computer architectures
• A branch and bound algorithm for the matrix bandwidth minimization
• Loop transformations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type