 | Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |
| CS 51500 - Numerical Linear Algebra |
|---|
|
Associated Term:
Fall 2017
Learning Outcomes: 1. Become knowledgeable about major kernels and algorithms underlying matrix computations for dense and sparse matrices including linear systems of equation, symmetric eigenvalue problems, and the singular-value decomposition. 2. Be able to implement basic versions of these kernels and algorithms. 3. Learn about the difference between direct and iterative methods for linear systems. 4. Gain expertise in the design of iterative methods and preconditioning techniques for large-scale sparse linear systems. 5. Be able to implement eigenvalue and singular-value problem solvers. Required Materials: Technical Requirements: |
| Return to Previous | New Search |
 |