This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Fall 2011 Numerical Linear Algebra MAD 5932-01 Details • Time and Place : MWF 9:05 AM – 9:55 AM , 201 Love Building • Instructor: K. A. Gallivan (5-0306, 318 Love Building, [email protected]) • Office Hours: 8:00 AM - 9:00 AM and 11:00 AM – 1:00 PM, MWF and meetings by appoint- ment • Prerequisites: programming ability, three semesters of Calculus. It is assumed that students have knowledge of basic numerical linear algebra methods such as LU factorization and basic splitting methods for solving linear systems and the use of Householder reflectors to solve full- rank linear least squares problems. This is approximately the material covered in Foundations of Computational Mathematics 1. • Text: G. Golub and C. Van Loan, Matrix Computations, Johns Hopkins Press, Third Edition. Available at FSU Bookstore. • The following reference texts are recommended: 1. Yousef Saad, Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia, 2003, Second Edition. 2. A. Bj¨ orck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996. 3. G. W. Stewart, Matrix Algorithms Vol. 1 Basic Decompositions, SIAM, Philadelphia, 1998 4. G. W. Stewart, Matrix Algorithms Vol. 2 Eigenvalue Problems, SIAM, Philadelphia, 2000 5. G. W. Stewart, Introduction to Matrix Computations, Academic Press, 1973 6. James W. Demmel, Applied Numerical Linear Algebra, SIAM, 1997 • Grades: Programs 25%, Midterm Exam 35 % and a comprehensive final 40 %.Grades: Programs 25%, Midterm Exam 35 % and a comprehensive final 40 %....
View Full Document
This note was uploaded on 11/10/2011 for the course MAD 5932 taught by Professor Gallivan during the Fall '06 term at FSU.
- Fall '06