CS 6220

CS 6220

Course information provided by the 2019-2020 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.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 17370 CS 6220   LEC 001

  • Instruction Mode: Hybrid - Online & In Person

    Limited to grad students only. All others should add themselves to the waitlist. Please go to http://www.cs.cornell.edu/courseinfo/enrollment for updates.