Computational Methods for Large Sparse Systems

CS 733

Credits: 

3

Sparse matrices in engineering and science. Sparsity preservation. Numerical error control. Transversal algorithms, Tarjan’s algorithm, Tinney’s algorithms, minimum degree, banding, nested dissection, frontal methods. Linear and nonlinear equation solving. Compensation. Sparse vector methods. Iterative methods. ODE and PDE applications. (Infrequently offered.) Prereq: CS 367 and (ECE 334 or (CS 412 and Math 340)); or consent of instructor.

Crosslisted Departments: 

There is currently no content classified with this term.

Subscribe to RSS - Computational Methods for Large Sparse Systems