Estimating the largest eigenvalue of a positive definite matrix
Dianne P. O’Leary, G. W. Stewart, James S. Vandergraft
Abstract
Open-access reader
Dianne P. O’Leary, G. W. Stewart, James S. Vandergraft
Abstract
Open-access reader
The power method for computing the dominant eigenvector of a positive definite matrix will converge slowly when the dominant eigenvalue is poorly separated from the next largest eigenvalue. In this note it is shown that in spite of this slow convergence, the Rayleigh quotient will often give a good approximation to the dominant eigenvalue after a very few iterations-even when the order of the matrix is large.
OpenAlex reports 33 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The power method for computing the dominant eigenvector of a positive definite matrix will converge slowly when the dominant eigenvalue is poorly separated from the next largest eigenvalue. In this note it is shown that in spite of this slow convergence, the Rayleigh quotient will often give a good approximation to the dominant eigenvalue after a very few iterations-even when the order of the matrix is large.
Key concepts: Rayleigh quotient iteration, Mathematics, Rayleigh quotient, Eigenvalues and eigenvectors, Inverse iteration, Power iteration, Positive-definite matrix, Convergence (economics)