The unshifted QR algorithm computes the eigenvalues of . For a real symmetric matrix it drives toward a diagonal or block-diagonal matrix; the accumulated orthogonal factors simultaneously approximate its eigenvectors.
The initial bottom-right entry is zero, so the chosen QR shift is . One valid QR factorization is , , using explicitly that . The update is
It repeats forever and never approaches a diagonal matrix. With the standard positive-diagonal convention for , this factorization is unique, so the Rayleigh-shift iteration is stationary and fails to diagonalize .
The failure is independent of harmless sign conventions. The columns of are already orthonormal, so another QR factorization can only replace by and by , where is diagonal with entries . Then still has zero diagonal and off-diagonal magnitudes one. Subsequent bottom-right shifts remain zero and the off-diagonal magnitude never decreases. The eigenvalues are , with equal absolute values, explaining the lack of separation in the unshifted QR algorithm.
QR algorithm 2026-10-14
The QR algorithm computes eigenvalues through repeated QR decompositions and similarity updates. Shifted and unshifted forms have different convergence rates; the unshifted QR algorithm uses a zero shift at every step.
Unshifted QR algorithm Created 2026-09-24 Updated 2026-11-05
The unshifted QR algorithm starts at , factors , and forms
for real data with orthogonal . Each step is an orthogonal similarity, so it preserves eigenvalues. It is the zero-shift case of the QR algorithm; complex data use a unitary factor and conjugate transpose.
Convergence needs hypotheses. For a real symmetric matrix with suitably separated eigenvalue moduli and nondegenerate starting projections, the simultaneous iteration interpretation of the QR algorithm explains convergence toward diagonal form. Equal moduli can prevent that behavior: for , the valid factorization , leaves every iterate equal to . Its eigenvalues remain coupled.
For nonsymmetric matrices, the useful target is generally a triangular form or a real Schur form, rather than a diagonal matrix. Shifts and block deflation in the QR algorithm improve practical convergence. The similarity identity by itself is not a convergence theorem.