Partitioned Krylov subspace iteration in implicit Runge-Kutta methods
DOI10.1016/j.laa.2009.03.015zbMath1166.65038OpenAlexW2121623542MaRDI QIDQ1025867
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
numerical examplesparallel computationmethod of linesimplicit Runge-Kutta methodsgeneralized minimal residual methodKrylov subspacesstiff initial value problems
Nonlinear parabolic equations (35K55) Nonlinear ordinary differential equations and systems (34A34) Iterative numerical methods for linear systems (65F10) 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) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
Related Items (5)
Uses Software
Cites Work
- Analysis of parallel diagonally implicit iteration of Runge-Kutta methods
- Error bounds for the solution to the algebraic equations in Runge-Kutta methods
- Krylov-subspace methods for the Sylvester equation
- On the numerical solution of \(AX-XB=C\)
- Stability Properties of Implicit Runge–Kutta Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- 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
- On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Partitioned Krylov subspace iteration in implicit Runge-Kutta methods