Parallel one-step methods with minimal parallel stages

DOI10.1016/0168-9274(95)00071-2MaRDI QIDQ1901535zbMATH OpenOpenAlexFDO

Authors Martin Kiehl

Publication date 11 December 1995

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-9274(95)00071-2

zbMATH Keywords

diagonally implicit Runge-Kutta methodsembedded methodsexplicit one step methodextrapolationminimal stagesparallel computationRosenbrock-Wanner methodssemi-implicit Runge-Kutta methods

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Parallel numerical computation (65Y05)

Review text

Suppose that sufficiently many processors are available, so that embedded methods do not need to be considered. Then, for certain types of method, lower bounds for the number of (parallel) stages, \(s_p\), required to achieve a given order, \(p\), are derived. For the general explicit one step method it is shown that \(s_p \geq p\). Results of this type are obtained for implicit Runge-Kutta methods, (singly) diagonally implicit Runge-Kutta methods, semi-implicit Runge-Kutta methods and Rosenbrock-Wanner methods.

Recommendations

• One-Stage Parallel Methods for the Numerical Solution of Ordinary Differential Equations
• Parallel step-by-step methods
• Parallel two-step W-methods
• Publication:4935897
• A parallel multi-p method
• Stepwise refinement of parallel algorithms
• Parallel multistep methods for linear evolution problems
• Step-parallel algorithms for stiff initial value problems
• Parallel methods for initial value problems
• A parallel version of a multistep method to solve the initial value problem

Cites work

• A new numerical method for the integration of highly oscillatory second-order ordinary differential equations
• A semi-implicit mid-point rule for stiff systems of ordinary differential equations
• A special family of Runge-Kutta methods for solving stiff differential equations
• A-stable Runge-Kutta processes
• An improved starting step of the G-B-S-method for the solution of ordinary differential equations
• Generalized Runge-Kutta methods of order four with stepsize control for stiff ordinary differential equations
• High order a-stable methods for the numerical solution of systems of D.E.'s
• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 4041188 (Why is no real title available?)
• scientific article; zbMATH DE number 4119524 (Why is no real title available?)
• Integration Processes Based on Radau Quadrature Formulas
• Iterated Runge–Kutta Methods on Parallel Computers
• Limits of parallelism in explicit ODE methods
• On the Theory of Parallel Runge—Kutta Methods
• Optimized extrapolation methods for parallel solution of IVPs on different computer architectures
• Parallel iteration of high-order Runge-Kutta methods with stepsize control
• Parallel multiple shooting for the solution of initial value problems
• Parallel ODE-solvers with stepsize control
• Recent Progress in Extrapolation Methods for Ordinary Differential Equations
• The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form

Cited in

(4)

• ROW methods adapted to electric circuit simulation packages
• One-Stage Parallel Methods for the Numerical Solution of Ordinary Differential Equations
• Stability for ROW‐methods adapted to circuit simulation
• One-Step Improvement Ideas and Computational Aspects

This page was built for publication: Parallel one-step methods with minimal parallel stages

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