Scientific Computing

This module illustrates computing the QR factorization of a matrix using Householder's method. The initial matrix is reduced to upper triangular form by applying a sequence of Householder transformations to annihilate the subdiagonal entries in successive columns.

The user first selects a matrix size, then selects a matrix by
choosing a preset example, a random matrix, or typing in desired
entries. The successive steps of Householder QR factorization are then
carried out sequentially by repeatedly clicking on NEXT or on the
currently highlighted step. The current column is indicated by an
arrow. For each successive column, a Householder transformation is
determined that annihilates the subdiagonal entries of the given
column. The corresponding Householder vector ** v** is
displayed on the right, and the computed values of the scalars

**Reference:** Michael T. Heath, *Scientific Computing,
An Introductory Survey*, 2nd edition, McGraw-Hill, New York,
2002. See Section 3.5.1, especially Algorithm 3.1 and Example 3.8.

**Developers:** Jessica Schoen and Michael Heath