MATH-251(c): Numerical analysis

Lectures in this course (30)

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

Explores iterative methods for solving linear systems of equations, including Jacobi and Gauss-Seidel.

Explores solving non-linear equations using the bisection method iteratively.

Explores non-linear equations using the dichotomy method for finding zeros with tolerance.

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

Covers non-linear ordinary differential equations, including separation, Cauchy problems, and stability conditions.

Covers the extension of ordinary differential equations to n-dimensional space.

Covers the approximation of a system of differential equations using a method based on time intervals.

Explores the stability of progressive air and eigenvalues of matrix A.

Explores the Cauchy problem, stability analysis, Jacobian matrices, eigenvalues, and stability conditions for ordinary differential equations.

Page 2 of 2