Explores iterative methods for solving linear systems, including Jacobi and Gauss-Seidel methods, Cholesky factorization, and preconditioned conjugate gradient.
Covers the Conjugate Gradients method for solving linear systems iteratively with quadratic convergence and emphasizes the importance of linear independence among conjugate directions.
Covers the fixed point theorem and the convergence of Newton's method, emphasizing the importance of function choice and derivative behavior for successful iteration.