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
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
Krylov subspacesnumerical examplesgeneralized minimal residual methodparallel computationmethod of linesimplicit Runge-Kutta methodsstiff initial value problems
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)
Cites Work
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the numerical solution of \(AX-XB=C\)
- Krylov-subspace methods for the Sylvester equation
- On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
- 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>
- Error bounds for the solution to the algebraic equations in Runge-Kutta methods
- Towards efficient implementation of singly-implicit methods
- Analysis of parallel diagonally implicit iteration of Runge-Kutta methods
- Iterative and parallel methods for linear systems, with applications in circuit simulation.
Cited In (7)
- Iterative Solution of Linear Equations in ODE Codes
- Automatic partitioning in linearly-implicit Runge-Kutta methods
- Runge-Kutta methods: Some historical notes
- Stein implicit Runge-Kutta methods with high stage order for large-scale ordinary differential equations
- A generalization of the method of lines for the numerical solution of coupled, forced vibration of beams
- A Fast Block Krylov Implicit Runge–Kutta Method for Solving Large-Scale Ordinary Differential Equations
- Jacobian-free high order local linearization methods for large systems of initial value problems
Uses Software
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)
