Write for the actual successive rotations , , and , each selected using the currently transformed matrix. The first eliminates position ; the second eliminates while leaving row two unchanged. After these, the first column is . The final rotation of rows two and three preserves both zeros in that column and eliminates . HenceA lower-triangular starting matrix does not force any further zeros above the diagonal. For example, the lower-triangular matrix with all entries on and below its diagonal equal to one gives, with the nonnegative pivot convention,which has all upper-triangular entries nonzero.
Inverting the product of rotations yields the QR factorizationThe order reverses when taking the transpose. If is orthogonal, then is both orthogonal and upper triangular. Its first column forces and orthogonality with the other columns forces . Applying the same argument to the remaining block makes diagonal with entries of modulus one.
Articles by others on the same topic
There are currently no matching articles.