Partitioned Krylov subspace iteration in implicit Runge-Kutta methods

DOI10.1016/J.LAA.2009.03.015zbMATH Open1166.65038OpenAlexW2121623542MaRDI QIDQ1025867FDOQ1025867

Authors Kees Dekker

Publication date 23 June 2009

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2009.03.015

zbMATH Keywords

Krylov subspacesnumerical examplesgeneralized minimal residual methodparallel computationmethod of linesimplicit Runge-Kutta methodsstiff initial value problems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Nonlinear ordinary differential equations and systems (34A34) Nonlinear parabolic equations (35K55) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Recommendations

• Automatic partitioning in linearly-implicit Runge-Kutta methods
• On the Parallel Implementation of Implicit Runge–Kutta Methods
• W-Methods with Automatic Partitioning by Krylov Techniques for Large Stiff Systems
• Numerical results for a parallel linearly-implicit Runge-Kutta method
• Parallel linear system solvers for Runge-Kutta methods

Cites work

• scientific article; zbMATH DE number 3911612 (Why is no real title available?)
• scientific article; zbMATH DE number 940566 (Why is no real title available?)
• scientific article; zbMATH DE number 3999169 (Why is no real title available?)
• Analysis of parallel diagonally implicit iteration of Runge-Kutta methods
• Error bounds for the solution to the algebraic equations in Runge-Kutta methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Iterative and parallel methods for linear systems, with applications in circuit simulation.
• Krylov-subspace methods for the Sylvester equation
• On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
• On the numerical solution of \(AX-XB=C\)
• Stability Properties of Implicit Runge–Kutta Methods
• The Use of Iterative Linear-Equation Solvers in Codes for Large Systems of Stiff IVP<scp>s</scp> for ODE<scp>s</scp>
• Towards efficient implementation of singly-implicit methods

Cited in

(8)

• A fast block Krylov implicit Runge-Kutta method for solving large-scale ordinary differential equations
• Automatic partitioning in linearly-implicit Runge-Kutta methods
• Stein implicit Runge-Kutta methods with high stage order for large-scale ordinary differential equations
• Iterative Solution of Linear Equations in ODE Codes
• Generalized Kronecker product splitting iteration for the solution of implicit Runge-Kutta and boundary value methods.
• Jacobian-free high order local linearization methods for large systems of initial value problems
• A generalization of the method of lines for the numerical solution of coupled, forced vibration of beams
• Runge-Kutta methods: Some historical notes

Describes a project that uses

Uses Software

• RODAS

This page was built for publication: Partitioned Krylov subspace iteration in implicit Runge-Kutta methods

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