CS 6220

CS 6220

Course information provided by the Courses of Study 2017-2018.

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.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4220 or CS 6210.

View Enrollment Information

  •   Regular Academic Session. 

  • 4 Credits Graded

  • 16249 CS 6220   LEC 001