CM 375 Computational Linear Algebra
Computational Mathematics (2009-2010)

Basic concepts and implementation of numerical linear algebra techniques and their use in solving application problems. Special methods for solving linear systems having special features. Direct methods: symmetric, positive definite, band, general sparse structures, ordering methods. Iterative methods: Jacobi, Gauss-Seidel, SOR, conjugate gradient. Computing and using orthogonal factorizations of matrices. QR and SVD methods for solving least squares problems. Eigenvalue and singular value decompositions. Computation and uses of these decompositions in practice.
Prerequisites: AMATH 341/CM 271/CS 371 or CS 370; Not open to General Mathematics students.
Antirequisites: CM/CS 372, 472
Notes: Lab is not scheduled and students are expected to find time in open hours to complete their work. Offered: F
(Cross-listed with CS 475)

Sections For Fall 2009

Lectures
ProfessorTimeCapacitySecAssocLocationCode
Wan, Justin 11:30-12:50 M T W Th F 9/10 1 1 MC 4064 5466
Held With: CS 475

Sections For Spring 2009

CM 375 is not held in Spring 2009

Professors That Have Taught CM 375