A Fast Block Krylov Implicit Runge–Kutta Method for Solving Large-Scale Ordinary Differential Equations
From MaRDI portal
Publication:5244701
DOI10.1007/978-1-4614-5131-0_20zbMath1311.65096OpenAlexW2215382858MaRDI QIDQ5244701
Abderrahman Bouhamidi, Khalide Jbilou
Publication date: 30 March 2015
Published in: Optimization, Simulation, and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5131-0_20
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) Numerical methods for stiff equations (65L04)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioned Krylov subspace iteration in implicit Runge-Kutta methods
- Mono-implicit Runge-Kutta schemes for the parallel solution of initial value ODEs
- Block predictor-corrector schemes for the parallel solution of ODEs
- Global FOM and GMRES algorithms for matrix equations
- Sylvester Tikhonov-regularization methods in image restoration
- Inexact Simplified Newton Iterations for Implicit Runge-Kutta Methods
- Solving Ordinary Differential Equations I
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Characterization of All Solutions to the Four Block General Distance Problem
- A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
- Using Krylov Methods in the Solution of Large-Scale Differential-Algebraic Systems
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Block Krylov subspace methods for solving large Sylvester equations
