Conjugate Gradient Method

In course

Elit duis amet id est veniam pariatur est aliquip. Do sunt aute irure incididunt minim pariatur dolor sint reprehenderit occaecat Lorem elit est. Mollit eiusmod laborum fugiat tempor incididunt esse esse excepteur excepteur est exercitation.

Description

This lecture covers the Conjugate Gradient method for solving linear systems, focusing on the algorithm's termination conditions, the importance of precision in algorithms, and the use of MATLAB files to explain the process. It also delves into Quasi-Newton methods and the concept of rank 2 updates.

Instructor

commodo dolor

Veniam veniam velit tempor aute eu. Lorem minim aliqua tempor id. Id ea excepteur velit qui velit. Nisi cupidatat veniam ex cupidatat anim ex consectetur proident esse tempor velit irure nulla fugiat. Enim ex exercitation nisi aliquip esse.

Official source

https://mediaspace.epfl.ch/media/0_z3m5vrkr

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

Mathematics

Analysis: Numerical analysis

Related lectures (38)