Scientific Computing

This module illustrates the use of classical Gram-Schmidt orthogonalization to compute the QR factorization of a matrix.

The user first selects a matrix size, then selects a matrix
** A** by choosing a preset example, a random matrix, or
typing in desired entries. The successive steps of classical
Gram-Schmidt 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. The current column is first
updated by subtracting off components in each preceding column, and
then the fully updated column is normalized. The resulting
orthonormalized columns, which form

**Reference:** Michael T. Heath, *Scientific Computing,
An Introductory Survey*, 2nd edition, McGraw-Hill, New York,
2002. See Section 3.5.3, especially Algorithm 3.2.

**Developers:** Jessica Schoen, Jing Zou, and Michael Heath