Complexity of QR-algorithm on a symmetric tridiagonal matrix

621 Views Asked by At

Why does the QR algorithm (for calculating eigenvalues) only require O(m) calculations per step when performed on a symmetric tridiagonal matrix?