Final Exam: Dec. 12, Tuesday, 11:30am-2:20pm, Cherry Emerson 322, will be comprehensive.
The format of the exam is the same as before and it will be OPEN BOOKS/NOTES. No electronic devices allowed.

From Golub and Van Loan book
**** (30 % from the following)****
2.5 Orthogonality and the SVD
5.1 Householder and Givens Matrices (up to 5.1.11)
5.2 The QR Factorization
5.3 The full rank LS problem (up to 5.3.5)
5.3.8 Normal Equations Versus QR
5.4 Other Othogonal Factorizations
5.5 The Rank Deficient LS problem

**** (70 % from the following)****
7.1 Properties and Decompositions
7.3 Power Iterations (up to 7.3.3)
7.4 The Hessenberg and Real Schur Forms (up to 7.4.3)
7.5 The Practical QR Algorihtm
8.4 Jacobi Methods (up to 8.4.4)
12.3 Total Least Squares

From D. Luenberger book
Ch. 1. Introduction
Ch. 2. Basic Properties of Linear Programs
3.1 Pivots
3.2 Adjacent Extreme Points
3.3 Determining a Minimum Feasible Solution
3.4 Computational Procedure -Simplex Method
3.5 Artificial Variables
3.7 Matrix Form of the Simplex Method
4.1 Dual Linear Programs
4.2 Duality Theorem
4.3 Relations to the Simplex Procedure