GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- 1 March 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 15 (2) , 359-368
- https://doi.org/10.1137/0915025
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient methodNumerical Linear Algebra with Applications, 1994
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear SystemsSIAM Journal on Scientific Computing, 1994
- Max-Min Properties of Matrix Factor NormsSIAM Journal on Scientific Computing, 1994
- How Fast are Nonsymmetric Matrix Iterations?SIAM Journal on Matrix Analysis and Applications, 1992
- Iterative solution of linear systemsActa Numerica, 1992
- On the use of stability regions in the numerical analysis of initial value problemsMathematics of Computation, 1991
- Variational Iterative Methods for Nonsymmetric Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1983
- Comparison of splittings used with the conjugate gradient algorithmNumerische Mathematik, 1979
- Solution of systems of linear equations by minimized iterationsJournal of Research of the National Bureau of Standards, 1952
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951