Parallel iterative linear solvers for multistep Runge-Kutta methods

DOI10.1016/S0377-0427(97)00135-0zbMath0890.65079MaRDI QIDQ1372722

Jacques J. B. de Swart, Eleonora Messina, W. A. van der Veen

Publication date: 14 December 1997

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

zbMATH Keywords

parallel computation; Newton iteration; stiff equations; implicit multistep Runge-Kutta methods

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

34A34: Nonlinear ordinary differential equations and systems

65Y05: Parallel numerical computation

65L05: Numerical methods for initial value problems involving ordinary differential equations

65L06: Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations

65F05: Direct numerical methods for linear systems and matrix inversion

34E13: Multiple scale methods for ordinary differential equations

Related Items

Parallel Adams methods, The solution of implicit differential equations on parallel computers

Uses Software

• Maple
• VODE
• DASSL
• RODAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix valued versions of a result of von Neumann with an application to time discretization
• Parallel linear system solvers for Runge-Kutta methods
• Parallel linear system solvers for Runge-Kutta-Nyström methods
• Experiences with sparse matrix solvers in parallel ODE software
• Triangularly Implicit Iteration Methods for ODE-IVP Solvers
• Solving Ordinary Differential Equations I
• Superconvergence for Multistep Collocation
• On the implementation of implicit Runge-Kutta methods