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

Lecture

Iterative Methods: Error Control and Linear Systems Resolution

In course

MATH-251(a): Numerical analysis

This course presents numerical methods to solve mathematical problems such as systems of linear and nonlinear equations, function approximation, integration and differentiation, and differential equations. ...

Description

This lecture covers iterative methods for solving linear systems, focusing on error control and resolution techniques. Topics include Richardson methods, invertible matrices, and iterative convergence analysis. The instructor explains different approaches and algorithms, such as fixed-point methods and spectral radius challenges. The lecture emphasizes the importance of accurate solutions and convergence criteria in iterative processes.

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 Mediaspace

Instructors (4)

Pablo Antolin Sanchez

Fabio Nobile

Espen Sande

Daniel Kressner

Official source

Related concepts (32)

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.

Fixed-point iteration

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space.

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.

Root-finding algorithms

In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Related lectures (39)

Nonlinear Equations: Methods and Applications

Covers methods for solving nonlinear equations, including bisection and Newton-Raphson methods, with a focus on convergence and error criteria.

Nonlinear Equations: Fixed Point Method Convergence

Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.

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.

Numerical Methods: Iterative Techniques

Covers open methods, Newton-Raphson, and secant method for iterative solutions in numerical methods.

Computational Geomechanics: Unconfined Flow Analysis