The text is designed to provide the mathematical knowledge necessary for approximating eigenvalues and eigenvectors, particularly in the context of physical vibrations. It is structured into 15 chapters that progress from foundational theory to advanced computational techniques: Google Books Small to Medium Matrices (Chapters 1–9):
1. Why Parlett’s "The Symmetric Eigenvalue Problem" is Essential
The matrix can always be diagonalized by an orthogonal matrix, meaning its eigenvectors form a perfectly perpendicular coordinate system.
Once a matrix is in tridiagonal form, the QR algorithm is used to iteratively drive the off-diagonal elements to zero, revealing the eigenvalues on the diagonal. Parlett’s text provides a masterclass on (such as the Rayleigh quotient shift and the Wilkinson shift). Shifting accelerates the convergence of the QR algorithm from linear to cubic rates, drastically reducing computation time. Key Algorithms Detailed in the Text Best Used For Primary Advantage Power Method Finding the single largest eigenvalue. Extremely simple to implement. Inverse Iteration Finding eigenvectors when eigenvalues are known. Fast convergence with a good shift. QL / QR Algorithm Finding all eigenvalues of a dense matrix. Highly stable; cubic convergence with shifts. Lanczos Iteration Large, sparse symmetric matrices.
Explains how to reduce a dense symmetric matrix to a tridiagonal form, making the subsequent eigenvalue computation efficient. 2. Structure of the Book: A Detailed Overview parlett the symmetric eigenvalue problem pdf
Eigenvectors corresponding to distinct eigenvalues are orthogonal. The matrix can always be diagonalized.
$$Av = \lambda v$$
The Symmetric Eigenvalue Problem by Beresford N. Parlett: An In-Depth Guide and Resource Analysis
It is important to be aware that some websites host unauthorized copies of the PDF. For example, the document hosting platform vdoc.pub has a copy of the PDF uploaded by a user, though the copyright status of such uploads is often ambiguous at best. Additionally, online library catalogs like that of the American University of Beirut list the PDF as available but only to authenticated users. The text is designed to provide the mathematical
results in an equally small, bounded change in its eigenvalues. 2. Tridiagonalization: The Gateway to Efficiency
If you are looking to apply these concepts to a specific project, let me know: Are you working with or large, sparse matrices?
It is a legitimate question: why read a book on eigenvalue computation from 1980 when the field has evolved so much? The answer is that Parlett’s work is but a treatise on principles .
ρ(x)=xTAxxTxrho open paren x close paren equals the fraction with numerator x to the cap T-th power cap A x and denominator x to the cap T-th power x end-fraction Once a matrix is in tridiagonal form, the
An iterative method tailored for sparse, large-scale matrices to extract extremal eigenvalues. 3. The QR Algorithm and Its Shifting Strategies
: Parlett provides deep insights into these iterative methods, which are the standard for computing all eigenvalues of a dense matrix.
Computing eigenvalues directly from a dense matrix is computationally expensive (
Before calculating eigenvalues for a large, dense symmetric matrix, the standard approach is to reduce it to a tridiagonal matrix (T) that shares the same eigenvalues. Parlett covers Householder reduction and Givens rotations in detail, showing how to maintain efficiency (O(n³) operations). 4. The QR Algorithm and Its Variants