Direct and Iterative Methods for Linear Equations

Related lectures (29)

Page 1 of 3

Covers iterative methods for solving linear equations and analyzing convergence, including error control and positive definite matrices.

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

Introduces iterative methods for solving linear equations and discusses the gradient method for minimizing errors.

Covers the analysis of linear systems, focusing on methods such as Jacobi and Richardson for solving linear equations.

Covers the stability analysis of ODEs using numerical methods and discusses stability conditions.

Explains the Jacobi and Gauss-Seidel methods for solving linear systems iteratively.

Explores iterative methods for linear equations, including Jacobi and Gauss-Seidel methods, convergence criteria, and the conjugate gradient method.

Covers the calculation of eigenvalues and eigenvectors, emphasizing their significance and applications.

Explores the Newton method for non-linear equations, discussing convergence criteria and stopping conditions.

Explores direct methods for solving linear equations and the impact of errors on solutions and matrix properties.