The symmetric eigenvalue problem is a fundamental problem in linear algebra and numerical analysis. The book you're referring to is likely "The Symmetric Eigenvalue Problem" by Beresford N. Parlett.
Av = λv
A very specific request!
One of the most popular algorithms for solving the symmetric eigenvalue problem is the QR algorithm, which was first proposed by John G.F. Francis and Vera N. Kublanovskaya in the early 1960s. The QR algorithm is an iterative method that uses the QR decomposition of a matrix to compute the eigenvalues and eigenvectors.
Here's a write-up based on the book:
References:
The basic idea of the QR algorithm is to decompose the matrix A into the product of an orthogonal matrix Q and an upper triangular matrix R, and then to multiply the factors in reverse order to obtain a new matrix A' = RQ. The process is repeated until convergence. parlett the symmetric eigenvalue problem pdf
Parlett, B. N. (1998). The symmetric eigenvalue problem. SIAM.
盖楼回复X
(您的评论需要经过审核才能显示)