Sign inSign in
ConceptEngineering

Newton's method

An iterative numerical method for finding successively better approximations to the roots of a real-valued function using tangent lines.
as Gilbert Strang defines itMITThe wording closest to all 14 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

8

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    A way to find the roots of a polynomial numerically using successive approximation.
    • 44:11Strings, Input/Output, and Branching in Python
  • Stephen Boyd

    Stanford University · Undergraduate

    An iterative method for minimizing a convex function by computing the Newton step from the Hessian and gradient using Cholesky factorization.
    • 38:33Geometric Problems Continued
    • 49:52Unconstrained Minimization
    • 2:36Equality Constrained Minimization
    • 46:49Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
  • Gilbert Strang

    MIT · Undergraduate

    • 41:09Newton's Method and Other Applications
    • 11:04Minimizing a Function Step by Step
  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    A general method for finding the roots (zeros) of functions by starting with a guess and iteratively applying a difference equation.
    • 44:04Higher-Order Procedures and Functional Abstraction
    • 44:07Higher-order Procedures (SICP Lecture 2a)
  • Fei-Fei Li, Justin Johnson & Serena Yeung

    Stanford University · Undergraduate

    A second-order optimization update rule that uses the inverse of the Hessian matrix to step directly to the minimum of a quadratic approximation.
    • 48:25Training Neural Networks II
  • Srini Devadas

    MIT · Undergraduate

    A method to find the roots of a function through successive approximation using tangents.
    • 18:16Integer Arithmetic, Karatsuba Multiplication
  • Steven Strogatz

    Cornell University · Undergraduate

    A numerical method for finding roots of equations that exhibits quadratic convergence.
    • 8:08Feigenbaum's Renormalization Analysis of Period Doubling
  • Jeremy Bernstein

    MIT · Graduate

    A second-order optimization algorithm that approximates the loss function as a quadratic form and solves for the step that minimizes it.
    • 18:05Scaling Rules for Optimization

Lectures that assume it

11

Connections

35

The lectures that define it or assume it, and the concepts next to it.

Concepts10

Show 4 more

Lectures25

Show 19 more

8 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.