Starting with , suppose columns have already been reduced to tridiagonal form. Let be the part of column in rows . A Householder reflection on these coordinates can map to . Extend it by the identity on the first coordinates and call the resulting orthogonal matrix .
The update
zeros every entry below row in column . Because it is an orthogonal similarity, it preserves eigenvalues; because the same transformation is applied on both sides, it preserves symmetry and zeros the corresponding row entries without disturbing earlier columns. After such steps,
is symmetric and tridiagonal and has the same eigenvalues as . Every reflector is obtained from finitely many matrix entries using finitely many arithmetic operations and a square root, so this is a finite construction.
The spectral expansion gives
For , the coefficient tends to zero because . Thus every possible limit belongs to
The identical argument with the coefficients proves
The statement is conditional because, when , the component along generally alternates rather than converges.
Let and
Because is the QR factorization of , is the span of the first two columns of .
The first row of the tridiagonal eigenvalue equation is
In the generic case , the two dominant coefficient vectors are independent, since
Here , since otherwise the displayed eigenvalue equation and the nonzero would force all eigenvalues to equal . The strict spectral gap below the dominant pair now implies
This is two-dimensional subspace iteration. If the dominant eigenvalue is repeated, acts as a scalar on ; the same QR argument either captures all of or separates its missing direction from the strictly smaller eigenspaces, and the conclusion below is unchanged.
Since and ,
The space is invariant under , so
Shifting the index does not affect the limit, and therefore
Thus the unshifted QR algorithm asymptotically deflates a block associated with the equal-modulus dominant pair.

Articles by others on the same topic (0)

There are currently no matching articles.