Superlinear convergence in minimum residual iterations
Author:
- 3 May 2005
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 12 (5-6) , 453-470
Abstract
The superlinear convergence of minimum residual‐type methods for solving systems of linear equations with diagonalizable non‐singular unsymmetric matrix is estimated using a special conditioning measure. For the construction of the latter, the distance from the spectrum of the matrix to the origin and the Frobenius distance between the matrix and the identity is used. Asymptotical exactness of the presented result is discussed theoretically and illustrated numerically. Copyright © 2005 John Wiley & Sons, Ltd.Keywords
This publication has 13 references indexed in Scilit:
- Parallel Preconditioning with Sparse Approximate InversesSIAM Journal on Scientific Computing, 1997
- A Note on the Superlinear Convergence of GMRESSIAM Journal on Numerical Analysis, 1997
- GMRES and the minimal polynomialBIT Numerical Mathematics, 1996
- Iterative Solution Methods1994
- New convergence results and preconditioning strategies for the conjugate gradient methodNumerical Linear Algebra with Applications, 1994
- The superlinear convergence behaviour of GMRESJournal of Computational and Applied Mathematics, 1993
- Implementation of the GMRES Method Using Householder TransformationsSIAM Journal on Scientific and Statistical Computing, 1988
- On the rate of convergence of the preconditioned conjugate gradient methodNumerische Mathematik, 1986
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient MethodIMA Journal of Applied Mathematics, 1977