What is the worst case complexity of the symmetric tridiagonal QR eigenvalue algorithm?
Posted by Geoffrey Irving, at scicomp.stackexchange.com,
Ignoring eigenvectors, the shifted QR algorithm for computing eigenvalues in the symmetric tridiagional case costs $O(n)$ per…