Covers vectorization in Python using Numpy for efficient scientific computing, emphasizing the benefits of avoiding for loops and demonstrating practical applications.
Covers the Conjugate Gradient method for solving linear systems without pre-conditioning, exploring parallel computing implementations and performance predictions.
Covers the concept of gradient descent in scalar cases, focusing on finding the minimum of a function by iteratively moving in the direction of the negative gradient.
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.