Bounds of Eigenvalues of Preconditioned Matrices
Author:
- O. AxelssonOAO. Axelsson
- 1 July 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (3) , 847-862
Abstract
Some methods to bound individual eigenvalues of a generalized eigenvalue problem $\lambda Cx = Ax$ are presented, both for general positive semidefinite matrices and for the special case where C is an incomplete factorization of A. This provides accurate estimates of the rate of convergence of preconditioned conjugate gradient methods to solve linear systems with A. In particular, methods are presented to actually numerically compute bounds of the extreme eigenvalues. The estimates enable us to compare modified and unmodified incomplete factorization methods.
Keywords
This publication has 16 references indexed in Scilit:
- ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORSInternational Journal of High Speed Computing, 1989
- Lower eigenvalue bounds for pencils of matricesLinear Algebra and its Applications, 1987
- On the rate of convergence of the preconditioned conjugate gradient methodNumerische Mathematik, 1986
- On the eigenvalue distribution of a class of preconditioning methodsNumerische Mathematik, 1986
- On Axelsson's perturbationsLinear Algebra and its Applications, 1985
- A survey of preconditioned iterative methods for linear systems of algebraic equationsBIT Numerical Mathematics, 1985
- A class of iterative methods for finite element equationsComputer Methods in Applied Mechanics and Engineering, 1976
- A generalized SSOR methodBIT Numerical Mathematics, 1972
- A Factorization Procedure for the Solution of Elliptic Difference EquationsSIAM Journal on Numerical Analysis, 1968
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference EquationsSIAM Journal on Numerical Analysis, 1968