AMCS 253 Iterative Methods of Linear and Nonlinear Algebra

Prerequisites: Programming skills (MATLAB preferred) and linear algebra. Classical stationary iterative methods of linear algebra, Chebyshev, multilevel and Krylov subspace iterative methods, preconditioners from approximate factorizations, hierarchical solvers and domain decomposition; Classical nonlinear iterative methods, fixed-point, Newton and its variants, nonlinear Schwarz methods.