Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Gauss-Seidel Method

In courses (2)

MATH-250: Advanced numerical analysis I

Construction and analysis of numerical methods for the solution of problems from linear algebra, integration, approximation, and differentiation. ...

MATH-251(c): Numerical analysis

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, l'approximation de fonctions, l'intégration et la dérivation, et les équations différentielles. ...

Description

This lecture introduces the Gauss-Seidel method for solving linear systems. Starting with the iterative process, it covers the progressive substitution technique and the algorithm's implementation. The method's convergence and efficiency are discussed, along with practical examples.

Instructors (3)

Simone Deparis

Daniel Kressner

Annalisa Buffa

Official source

Related concepts (12)

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.

Jacobi method

In numerical linear algebra, the Jacobi method (a.k.a. the Jacobi iteration method) is an iterative algorithm for determining the solutions of a strictly diagonally dominant system of linear equations. Each diagonal element is solved for, and an approximate value is plugged in. The process is then iterated until it converges. This algorithm is a stripped-down version of the Jacobi transformation method of matrix diagonalization. The method is named after Carl Gustav Jacob Jacobi.

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.

Matrix splitting

In the mathematical discipline of numerical linear algebra, a matrix splitting is an expression which represents a given matrix as a sum or difference of matrices. Many iterative methods (for example, for systems of differential equations) depend upon the direct solution of matrix equations involving matrices more general than tridiagonal matrices. These matrix equations can often be solved directly and efficiently when written as a matrix splitting. The technique was devised by Richard S. Varga in 1960.

Rate of convergence

In numerical analysis, the order of convergence and the rate of convergence of a convergent sequence are quantities that represent how quickly the sequence approaches its limit. A sequence that converges to is said to have order of convergence and rate of convergence if The rate of convergence is also called the asymptotic error constant. Note that this terminology is not standardized and some authors will use rate where this article uses order (e.g., ).

Related lectures (39)

Iterative methods: Jacobi, Gauss-Seidel, SOR

Explores Jacobi, Gauss-Seidel, and SOR iterative methods for solving linear systems efficiently.

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Computational Geomechanics: Unconfined Flow Analysis

Explores unconfined flow analysis in geomechanics, emphasizing iterative solution methods and boundary condition considerations.

Matrix Inversion: Pivoting and Iterative Methods

Explores matrix inversion, pivoting, and iterative methods for solving linear systems of equations.

Matrix Construction and Function Manipulation