Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Newton Method: Convergence Analysis
Graph Chatbot
Related lectures (27)
Previous
Page 2 of 3
Next
Root Finding Methods: Bisection and Secant Techniques
Covers root-finding methods, focusing on the bisection and secant techniques, their implementations, and comparisons of their convergence rates.
Numerical Analysis: Newton's Method
Explores Newton's method for finding roots of nonlinear equations and its interpretation as a second-order method.
Numerical Methods: Stopping Criteria, SciPy, and Matplotlib
Discusses numerical methods, focusing on stopping criteria, SciPy for optimization, and data visualization with Matplotlib.
Fixed Point Theorem: Convergence of Newton's Method
Covers the fixed point theorem and the convergence of Newton's method, emphasizing the importance of function choice and derivative behavior for successful iteration.
Numerical Methods: Bisection and Multidimensional Arrays
Discusses the bisection method for solving nonlinear equations and its implementation using Python with NumPy and Matplotlib.
Nonlinear Equations: Fixed Point Method Convergence
Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.
Quasi-Newton Methods
Introduces Quasi-Newton methods for optimization, explaining their advantages over traditional approaches like Gradient Descent and Newton's Method.
RTR practical aspects + tCG
Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.
Numerical Methods: Iterative Techniques
Covers open methods, Newton-Raphson, and secant method for iterative solutions in numerical methods.
Newton method for systems: Fixed point iterations
Explores the Newton method for systems and fixed point iterations, discussing convergence and properties.