CS 6220: Sparse Matrix Computations

Cross-Listing: Not cross-listed.

Methods for large sparse matrix problems. Krylov subspace techniques are featured, e.g., conjugate gradients, Lanczos, Arnoldi. Applications from differential equations and optimization methods based on random sampling are also covered. Assignments in Matlab.

Offered: Spring only

Prerequisites: CS 6210.

Grade options: Letter or S/U

Credit hours: 4

Recent offerings:

• http://www.cs.cornell.edu/courses/cs6220/2008fa
• http://www.cs.cornell.edu/courses/cs622/2005sp
  • Tom Coleman
• http://www.cs.cornell.edu/courses/cs622/2003sp
  • Tom Coleman