Lecture
Approximation of Greek Functions
Related lectures (31)
Convergence Analysis: Explicit RK Scheme
Explores the convergence analysis of the Explicit Runge-Kutta scheme for accurate numerical solutions.
Nonlinear Optimization
Covers line search, Newton's method, BFGS, and conjugate gradient in nonlinear optimization.
Convergence of Fixed Point Methods
Explores the convergence of fixed point methods and the implications of different convergence rates.
Iterative Methods for Linear Equations
Covers iterative methods for solving linear equations and analyzing convergence, including error control and positive definite matrices.
Newton Method: Convergence Analysis
Explores the Newton method for root finding and its convergence analysis, including the modified Newton method.
Gradient Descent
Covers the concept of gradient descent in scalar cases, focusing on finding the minimum of a function by iteratively moving in the direction of the negative gradient.
Richardson Method: Preconditioned Iterative Solvers
Covers the Richardson method for solving linear systems with preconditioned iterative solvers and introduces the gradient method.
Newton's Method: Order 2
Explains Newton's method of order 2 for finding function zeros.
High Order Methods: Space Discretisation
Covers high order methods for space discretisation in linear differential systems.
Numerical Analysis: Linear Systems
Covers the analysis of linear systems, focusing on methods such as Jacobi and Richardson for solving linear equations.