10/16/2008

Exam 1 (See p:\data\math\hartlaub\linearalgebra\exam1.mtw)

Gram-Schmidt process and QR factorization (See p:\data\math\hartlaub\linearalgebra\gram.mw)

An algorithm for converting any basis into an orthonormal basis.

Representing the change of basis in matrix form leads to the QR-Factorization: M = QR, which is unique.

Orthogonal transformations and orthogonal matrices

A linear transformation T is called orthogonal if it preserves the length of vectors. The matrix used to obtain the orthogonal transformation is called an orthogonal matrix.

Transpose of a matrix

Interchange the rows and columns of a matrix.

Symmetric matrices

A square matrix A is symmetric if the transpose of A is equal to A.

A square matrix A is skew-symmetric if the transpose of A is equal to -A.

Properties of transpose and symmetric matrices.

Least Squares and Data Fitting

Group/Class Exercises

• Section 5.2 - 3, 11, 17, 25, 31, 35
• Section 5.3 - 1, 3, 5, 7, 11, 15, 19, 25, 33
• Section 5.4 - 1, 19, 21, 31, 36

Please read Chapter 5 for class on Thursday.