Parlett, B. N. (1998). The symmetric eigenvalue problem. SIAM.
Av = λv
Given a symmetric matrix A ∈ ℝⁿˣⁿ, the symmetric eigenvalue problem is to find a scalar λ (the eigenvalue) and a nonzero vector v (the eigenvector) such that: parlett the symmetric eigenvalue problem pdf
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. Parlett, B
Here's a write-up based on the book:
Session expired
Please log in again. The login page will open in a new tab. After logging in you can close it and return to this page.