Direct Methods for Solving Linear Equations

Related lectures (28)

Page 1 of 3

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

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

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.

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

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

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

Covers the decomposition of symmetric matrices into eigenvalues and eigenvectors.

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

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