Numerical results for a parallel linearly-implicit Runge-Kutta method

DOI10.1007/BF02684476MaRDI QIDQ1377293zbMATH OpenOpenAlexFDO

Authors Jürgen Bruder

Publication date 4 February 1998

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02684476

zbMATH Keywords

comparison of methodslinearly-implicit Runge-Kutta methodsnumerical examplesparallel computationRadau 5

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)

Review text

This paper considers the stage parallelisation of linearly-implicit Runge-Kutta methods based on restricted Padé approximants with a single (multiple) real pole. Methods of order five are constructed and a parallel implementation on three processors of a distributed memory Parsytec machine is compared with a simple parallelisation of Radau 5 and a diagonally implicit iteration scheme based on Radau 5. Numerical results suggest that for moderately sized problems with a slowly varying Jacobian and at moderate tolerance the linearly implicit implementation compares favourably with the other two approaches.

Recommendations

• On the Parallel Implementation of Implicit Runge–Kutta Methods
• Parallel Runge-Kutta methods with real eigenvalues
• Parallel linear system solvers for Runge-Kutta methods
• Highly stable parallel Runge-Kutta methods

Cites work

• A reliable Rosenbrock integrator for stiff differential equations
• Analysis of parallel diagonally implicit iteration of Runge-Kutta methods
• Behandlung steifer Anfangswertprobleme gewöhnlicher Differentialgleichungen mit adaptiven Runge-Kutta-Methoden
• scientific article; zbMATH DE number 50395 (Why is no real title available?)
• Linearly-implicit Runge-Kutta methods based on implicit Runge-Kutta methods
• Nichtlineare Stabilität adaptiver Runge-Kutta Methoden
• On implicity Runge-Kutta methods with a stability function having distinct real poles
• Parallel methods for initial value problems
• Partitioned adaptive Runge-Kutta methods for the solution of nonstiff and stiff systems
• The Numerical Solution of Separably Stiff Systems by Precise Partitioning

Cited in

(8)

• Partitioned Krylov subspace iteration in implicit Runge-Kutta methods
• Mono-implicit Runge-Kutta schemes for the parallel solution of initial value ODEs
• On the use of parallel processors for implicit Runge-Kutta methods
• Parallel linear system solvers for Runge-Kutta methods
• Linearly implicit Runge-Kutta methods and approximate matrix factorization.
• On the Parallel Implementation of Implicit Runge–Kutta Methods
• Stage-parallel fully implicit Runge-Kutta implementations with optimal multilevel preconditioners at the scaling limit
• Parallel Runge-Kutta methods with real eigenvalues

Describes a project that uses

Uses Software

• RODAS

This page was built for publication: Numerical results for a parallel linearly-implicit Runge-Kutta method

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