A QR factorization is , where and is upper triangular. If is orthogonal, so is . Its inverse is upper triangular, but is lower triangular, forcing to be diagonal. Orthogonality then givesWith the customary positive diagonal convention, .
Only the first and third coordinates occur in the first two columns. Normalize the first column to get . Removing its component from the second column leaves , of length seven, so . The remaining orthonormal columns can be and . Taking their dot products with the columns of givesThe columns of are orthonormal, and direct multiplication gives the source matrix. Exploiting its two-coordinate first block avoids unnecessary four-dimensional elimination.
Starting with , choose real shifts , factor , and setEach step is an orthogonal similarity, so the eigenvalues are preserved and all iterates are similar. If , transposing proves symmetry of , completing the induction.
The given matrix is the Householder reflectionIt has eigenvalue along and on its orthogonal complement, hence . In the positive-diagonal QR convention its unshifted factorization is , , so the next iterate is again . Thus unshifted QR is stationary, despite the matrix generally having nonzero off-diagonal entries. If arbitrary diagonal signs are allowed in , a step can instead replace by for a diagonal sign matrix ; every off-diagonal magnitude remains unchanged. Such sign changes still make no progress towards diagonalization.
Articles by others on the same topic
There are currently no matching articles.