Direct Methods for Solving Linear Equations

Related lectures (41)

Covers the basics of linear algebra, including matrix operations and singular value decomposition.

Explores direct methods for solving linear systems of equations, including Gauss elimination and LU decomposition.

Summarizes methods for resolving linear systems, including Gaussian elimination and LU decomposition.

Covers the resolution of linear systems and its link to optimization problems.

Explores floating point numbers, LU decomposition, errors, and matrix properties.

Explores the link between linear systems and optimization through elimination and LU decomposition.

Covers the QR factorization method applied to solving a system of linear equations in the least squares sense.

Covers the Cholesky decomposition of a symmetric positive definite matrix and its applications.

Discusses eigenvalues, their calculation methods, and their applications in optimization and numerical analysis.

Covers the Choleski factorisation method for solving linear systems efficiently.

Covers the concept of Singular Value Decomposition (SVD) for compressing information in matrices and images.

Explores the conditions for LU factorization without permutation and diagonal dominance in matrices.

Covers linear systems, diagonal and triangular matrices, and LU factorization.

Explores the Cholesky factorization method for symmetric positive definite matrices.

Explores the Thomas algorithm for tridiagonal systems and the accuracy of direct methods in numerical computations.

Covers the decomposition of matrices into triangular blocks and spectral decomposition.

Covers the decomposition of symmetric matrices into eigenvalues and eigenvectors.

Explores the properties of invertible matrices, including unique solutions and linear independence.

Explores symmetric matrices, their diagonalization, and properties like eigenvalues and eigenvectors.

Page 1 of 3