Apply the preceding Householder reflection to the columns ofThe first column becomes and the second becomes :Thus an orthogonal matrix multiplying an upper triangular matrix reconstructs . The zero below the diagonal came from a geometric operation that preserves Euclidean norms and inner products.
Our positive-diagonal convention for QR decomposition is obtained by a sign adjustment. With , putThen and . The intermediate sign chooses an orientation for a basis vector; the adjustment makes the diagonal positive.
For a larger matrix, the next Householder reflection acts only on the lower rows of the remaining columns, retaining the zeros already created. Store its defining vector and apply instead of forming a dense reflection matrix. This links a simple mirror operation to efficient QR decomposition, including least-squares solutions.
Articles by others on the same topic
There are currently no matching articles.
