Lecture
Conjugate Gradient Method: Iterative Optimization
Description
This lecture covers the continuation of the gradient method, introduction to the conjugate gradient method, and various stopping criteria. It explains the preconditioned Richardson method, convergence properties, and the computation of new iterates. The lecture also discusses the stationary and dynamic nature of the gradient method, the computation of residuals, and the Richardson method for symmetric positive definite matrices.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (47)
Richardson Method: Preconditioned Iterative Solvers
Covers the Richardson method for solving linear systems with preconditioned iterative solvers and introduces the gradient method.
Bisection Method, Newton Method
Covers the Bisection Method and Newton Method for solving nonlinear equations using interval splitting and tangent lines.
Numerical Analysis: Linear Systems
Covers the analysis of linear systems, focusing on methods such as Jacobi and Richardson for solving linear equations.
Convergence of Fixed Point Methods
Explores the convergence of fixed point methods and the implications of different convergence rates.
Power Method
Covers the Power Method for approximating the largest eigenvalue of a matrix.