— Numerical Methods: Large-Scale Matrix Computations
This version has ended; see updated course, below. Course Description: Numerical methods for large-scale matrix computations, including direct and iterative methods for the solution of linear systems, the computation of eigenvalues and singular values, the solution of least-squares problems, matrix compression, methods for the solution of linear programs.
Prerequisites & course information
This version has ended; see updated course, below. Course Description: Numerical methods for large-scale matrix computations, including direct and iterative methods for the solution of linear systems, the computation of eigenvalues and singular values, the solution of least-squares problems, matrix compression, methods for the solution of linear programs. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Grade Mode: Letter. MAT 226B — Numerical Methods: Large-Scale Matrix Computations (4 units) Course Description: Numerical methods for large-scale matrix computations, including direct and iterative methods for the solution of linear systems, the computation of eigenvalues and singular values, the solution of least-squares problems, matrix compression, methods for the solution of linear programs. Prerequisite(s): MAT 167 ; or equivalent or consent of instructor; familiarity with some programming language. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Enrollment Restriction(s): Open to graduate students; open to undergraduate students with consent of instructor. Grade Mode: Letter. This course version is effective from, and including: Winter Quarter 2027. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Grade Mode: Letter. MAT 226B — Numerical Methods: Large-Scale Matrix Computations (4 units) Course Description: Numerical methods for large-scale matrix computations, including direct and iterative methods for the solution of linear systems, the computation of eigenvalues and singular values, the solution of least-squares problems, matrix compression, methods for the solution of linear programs. Prerequisite(s): MAT 167 ; or equivalent or consent of instructor; familiarity with some programming language. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Enrollment Restriction(s): Open to graduate students; open to undergraduate students with consent of instructor. Grade Mode: Letter. This course version is effective from, and including: Winter Quarter 2027.
Sources
- Course catalogue ↗2026-2027