A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- 1 January 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 12 (1) , 58-78
- https://doi.org/10.1137/0912003
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Reduced storage matrix methods in stiff ODE systemsApplied Mathematics and Computation, 1989
- A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection MethodsSIAM Journal on Numerical Analysis, 1987
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Matrix-Free Methods for Stiff Systems of ODE’sSIAM Journal on Numerical Analysis, 1986
- Conjugate gradient-like algorithms for solving nonsymmetric linear systemsMathematics of Computation, 1985
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1984
- Variational Iterative Methods for Nonsymmetric Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1983
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- Solution of Sparse Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1975