Lecture

Iterative methods: Jacobi, Gauss-Seidel, SOR

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ChE-312: Numerical methods

This course introduces students to modern computational and mathematical techniques for solving problems in chemistry and chemical engineering. The use of introduced numerical methods will be demonstrated using the Python programming language. ...

Description

This lecture covers iterative methods for solving large linear systems of equations, focusing on Jacobi, Gauss-Seidel, and Successive Over Relaxation (SOR) methods. It explains how these methods transform complex systems into simpler ones, making them easier to solve. The Jacobi method updates each variable using the previous iteration's values, while the Gauss-Seidel method uses updated values immediately. SOR combines these approaches with a relaxation parameter. The lecture emphasizes the computational efficiency of iterative techniques for large systems and the importance of choosing the right parameters for convergence.

Instructors (2)

Ljubisa Miskovic

Ljubisa Miskovic earned his Ph.D. degree in Automatic Control from the Swiss Federal Institute of Technology (EPFL) under the co-supervision of Dominique Bonvin and Alireza Karimi, in 2006. He pursued his postdoctoral studies at the Centre for Systems Engineering and Applied Mechanics, Universite Catholique de Louvain with Michel Gevers before moving to the laboratory of Vassily Hatzimanikatis at the EPFL. In 2010, he became a research scientist. His research interests include systems biology, metabolic engineering, synthetic biology, data-driven control design, system identification, stochastic processes and estimation theory.

Kevin Sivula

See webpage for more info limno.epfl.ch Teaching & PhD PhD Students Odile Louise Andres, Arthur Eliot Bouchez, Benjamin Goldman, Nicolas Johannes Diercks, Aurélie Fanny Marie Célérien, Jiajun Li, Louise Marie Foltzer-De Cian, Melanie Victoria Johanning, Nils William Laurent Golay Past EPFL PhD Students Andrea Gasperini, Pauline Bornoz, Xavier Adrian Jeanbourquin, Xiaoyun Yu, Mathieu Steven Prévot, Muhammad Aiman Bin Rahmanudin Hamdan, Nhât-Tân Vuong, Yongpeng Liu, Arvindh Sekar, Barbara Alexandra Primera

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (23)

Numerical methods for linear least squares

Numerical methods for linear least squares entails the numerical analysis of linear least squares problems. A general approach to the least squares problem can be described as follows. Suppose that we can find an n by m matrix S such that XS is an orthogonal projection onto the image of X. Then a solution to our minimization problem is given by simply because is exactly a sought for orthogonal projection of onto an image of X (see the picture below and note that as explained in the next section the image of X is just a subspace generated by column vectors of X).

Numerical stability

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues.

Successive over-relaxation

In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process. It was devised simultaneously by David M. Young Jr. and by Stanley P. Frankel in 1950 for the purpose of automatically solving linear systems on digital computers. Over-relaxation methods had been used before the work of Young and Frankel.

Iterative method

In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Related lectures (64)

Vectorization in Python: Efficient Computation with Numpy

Covers vectorization in Python using Numpy for efficient scientific computing, emphasizing the benefits of avoiding for loops and demonstrating practical applications.

Iterative Methods: Jacobi

Covers the Jacobi iterative method for solving electrostatic problems and discusses convergence and practical examples.

Numerics: semester project

Covers the semester project on numerics, focusing on adaptive algorithms and multistep methods.

Convergence Analysis: Explicit RK Scheme

Explores the convergence analysis of the Explicit Runge-Kutta scheme for accurate numerical solutions.

Numerical Methods: Iterative Techniques