CS 6220
Last Updated
- Schedule of Classes - February 16, 2018 10:59AM EST
- Course Catalog - February 12, 2018 11:18AM EST
Classes
CS 6220
Course Description
Course information provided by the 2017-2018 Catalog.
Matrices and linear systems can be data-sparse in a wide variety of ways, and we can often leverage such underlying structure to perform matrix computations efficiently. This course will discuss several varieties of structured problems and associated algorithms. Example topics include randomized algorithms for numerical linear algebra, Krylov subspace methods, sparse recovery, and assorted matrix factorizations.
Prerequisites/Corequisites Prerequisite: CS 4220 or CS 6210.
When Offered Fall.
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Graded(Letter grades only)
-
Class Number & Section Details
-
Meeting Pattern
- TR Hollister Hall 320
Instructors
Damle, A
-
Additional Information
Instruction Mode: In Person