Discrete QMR and BCG in the numerical solution of linear systems of ODEs
DOI10.1016/S0377-0427(98)00036-3zbMath0946.65039MaRDI QIDQ1298534
Publication date: 10 October 2000
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
algorithmsconvergencenumerical examplesHilbert spaceGMRESKrylov subspace methodsquasi-minimal residual methodbiorthogonal Lanczos process
Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The use of Runge-Kutta formulae in waveform relaxation methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A Krylov projection method for systems of ODEs
- Convergence estimates for solution of integral equations with GMRES
- GMRES and the minimal polynomial
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Discrete krylov subspace methods for equations of the second kind
- Residual Smoothing Techniques for Iterative Methods
- The conjugate gradient method for solving fredholm integral equations of the second kind
- A Note on the Superlinear Convergence of GMRES
- A Multigrid Method of the Second Kind for Solving Linear Systems of Odes Discretized by Continuous Runge-Kutta Methods
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
This page was built for publication: Discrete QMR and BCG in the numerical solution of linear systems of ODEs