CSE 351
Iterative Methods
Commonly used iterative methods for efficiently solving large, sparse linear systems. Review of basic numeric analysis, direct methods, iterative methods, Krylov subspace methods, preconditioning techniques, and multigrid methods. Analysis of theoretical properties, including convergence behavior and computational and memory demands. Evaluation of performance using numerical experimentation on various real-world applications using Matlab. Credit will not be given for both CSE 351 and CSE 451 . Prerequisites: CSE 109 and CSE 140 and ( MATH 205 or MATH 043 )
Sources
- Course catalogue ↗2026-2027