Iterative Methods: Error Control and Linear Systems Resolution

Related lectures (39)

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

Covers the convergence of Newton's method and its applications in numerical analysis.

Explores applying fixed point methods to solve electrical circuit equations and find diode voltage.

Covers iterative methods for solving linear systems and discusses convergence criteria and spectral radius.

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

Covers numerical methods for finding roots, including secant, Newton, and fixed point iteration techniques.

Covers the construction of an iterative method for linear systems, emphasizing matrix decomposition and convexity.

Covers iterative methods for solving linear systems, including Jacobi and Gauss-Seidel methods.

Covers the Picard method for solving nonlinear equations using fixed point iteration.

Covers linear algebraic groups, including special sets and matrix examples.

Explores linear applications, matrices, injectivity, unique solutions, and matrix operations.

Explores linear hatching systems, unique solutions, norms, and fixed points in linear systems.

Covers the stability of discrete time periodic solutions and their properties.

Explores optimization techniques like gradient descent, line search, and Newton's method for efficient problem-solving.

Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.

Explores homotheties, fixed points, and composition of water in transformations.

Covers eigenvalues, eigenvectors, and diagonalization of matrices.

Covers the Hessian and Newton's method for optimization using iterative processes.

Explores linear transformations, matrices, injective and surjective functions, and their applications.

Page 2 of 2