CS 6220

CS 6220

Course information provided by the 2026-2027 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 CS 4220, CS 6210 or permission of instructor.

Last 4 Terms Offered 2021SP, 2020SP, 2017FA, 2011FA

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 17491 CS 6220   LEC 001

    • TR
    • Aug 24 - Dec 7, 2026
    • Damle, A

  • Instruction Mode: In Person

    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/