Iterative methods for solvingAx=b, GMRES/FOM versus QMR/BiCG
- 1 December 1996
- journal article
- research article
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 6 (1) , 1-24
- https://doi.org/10.1007/bf02127693
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problemsBIT Numerical Mathematics, 1996
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear SystemsSIAM Journal on Matrix Analysis and Applications, 1996
- Lectures on Finite Precision ComputationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1996
- An Implementation of the QMR Method Based on Coupled Two-Term RecurrencesSIAM Journal on Scientific Computing, 1994
- Templates for the Solution of Linear Systems: Building Blocks for Iterative MethodsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- A breakdown-free Lanczos type algorithm for solving linear systemsNumerische Mathematik, 1992
- A Theoretical Comparison of the Arnoldi and GMRES AlgorithmsSIAM Journal on Scientific and Statistical Computing, 1991
- Approximation theory and numerical linear algebraPublished by Springer Nature ,1990
- A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric MatricesNorth-Holland Mathematics Studies, 1986