Eigenvalue problems are omnipresent in physics. Important examples are the time independent Schrödinger equation in a finite orthogonal basis or the harmonic motion of a molecule around its equilibrium structure. Most important are ordinary eigenvalue problems, which involve the solution of a homogeneous system of linear equations with a Hermitian (or symmetric, if real) matrix. Matrices of small dimension can be diagonalized directly by determining the roots of the characteristic polynomial and solving a homogeneous system of linear equations. The Jacobi method uses successive rotations to diagonalize a matrix with a unitary transformation. A very popular method for not too large symmetric matrices reduces the matrix to tridiagonal form which can be diagonalized efficiently with the QL algorithm. Some special tridiagonal matrices can be diagonalized analytically. Krylov-space algorithms are the choice for matrices of very large dimension. We discuss especially the methods by Arnoldi and Lanczos.
CITATION STYLE
Scherer, P. O. J. (2017). Eigenvalue Problems (pp. 213–234). https://doi.org/10.1007/978-3-319-61088-7_10
Mendeley helps you to discover research relevant for your work.