Eigenvalue algorithm

Summary

An eigenvalue algorithm is a numerical procedure that computes eigenvalues, and often eigenvectors, of a square matrix. By the Abel–Ruffini theorem, the eigenvalues of a general matrix of size at least $5$ cannot be written with radicals. So such algorithms are iterative and produce approximations. They are central in numerical linear algebra, with uses from vibration analysis to search engines and quantum chemistry.