Lecture
Linear Systems: Iterative Methods
Related lectures (82)
Numerical Analysis: Linear Systems
Covers the analysis of linear systems, focusing on methods such as Jacobi and Richardson for solving linear equations.
Iterative Methods: Linear Systems
Explores iterative methods for solving linear systems, including Jacobi and Gauss-Seidel methods, Cholesky factorization, and preconditioned conjugate gradient.
Linear Systems: Direct Methods
Covers the formulation of linear systems, direct and iterative methods for solving them, and the cost of LU factorization.
Iterative Methods: Linear Systems
Covers iterative methods for solving linear systems and discusses convergence criteria and spectral radius.
Jacobi and Gauss-Seidel methods
Explains the Jacobi and Gauss-Seidel methods for solving linear systems iteratively.
Iterative Methods: Error Control and Linear Systems Resolution
Explores iterative methods for solving linear systems with a focus on error control.
Singular Value Decomposition: Applications and Interpretation
Explains the construction of U, verification of results, and interpretation of SVD in matrix decomposition.
Richardson Method: Preconditioned Iterative Solvers
Covers the Richardson method for solving linear systems with preconditioned iterative solvers and introduces the gradient method.
Iterative Methods for Linear Equations
Covers iterative methods for solving linear equations and analyzing convergence, including error control and positive definite matrices.
Linear Systems: Convergence and Methods
Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.