CSCI 8314: Sparse Matrix Computations

3 Credits

Sparsity and sparse matrices. Data structures for sparse matrices. Direct methods for sparse linear systems. Reordering techniques to reduce fill-in such as minimal degree ordering and nested dissection ordering. Iterative methods. Preconditioning algorithms. Algorithms for sparse eigenvalue problems and sparse least-squares. prereq: 5304 or numerical linear algebra course or instr consent

View on University Catalog

All Instructors

A- Average (3.829)Most Common: A (59%)

This total also includes data from semesters with unknown instructors.

49 students
SWFDCBA
  • 4.46

    /5

    Recommend
  • 4.50

    /5

    Effort
  • 4.46

    /5

    Understanding
  • 4.36

    /5

    Interesting
  • 4.56

    /5

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2023 provided by the Office of Institutional Data and Research

      Privacy Policy