|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. The Schedule Type links will be available only when the schedule of classes is available for the selected term.|
|CS 51500 - Numerical Linear Algebra|
Credit Hours: 3.00. Direct and iterative solvers of dense and sparse linear systems of equations, numerical schemes for handling symmetric algebraic eigenvalue problems, and the singular-value decomposition and its applications in linear least squares problems. Typically offered Spring.
3.000 Credit hours
Levels: Graduate, Professional, Undergraduate
Schedule Types: Distance Learning, Lecture
Offered By: College of Science
Department: Computer Science
May be offered at any of the following campuses:
West Lafayette Continuing Ed
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.