Sign inSign in
ConceptMathematics

Vandermonde matrix

A matrix with terms of a geometric progression in each row, used here to represent the polynomial evaluation process.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 7 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

6

Each in their own terms, from the easiest level.

  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    A matrix where each row is a geometric progression of a specific value, used to represent polynomial evaluation.
    • 25:12Divide & Conquer: FFT
  • Peter Shor

    MIT · Undergraduate

    A matrix with terms of a geometric progression in each row, which has full rank.
  • Alex Townsend

    MIT · Undergraduate

    A matrix with terms of a geometric progression in each row, arising from polynomial interpolation at real points, which has low numerical rank and is difficult to invert.
    • 25:38Rapidly Decreasing Singular Values
  • Gilbert Strang

    MIT · Undergraduate

    A matrix that arises in polynomial interpolation, often characterized by having a very large condition number.
    • 28:03Saddle Points Continued, Maxmin Principle
  • Stephen Boyd

    Stanford University · Graduate

    A matrix with the terms of a geometric progression in each row, commonly used in polynomial interpolation and fitting.
    • 1:37Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
    • 1:13:33Applications of Least-Squares Estimation: System Identification & Filtering

Connections

11

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

6 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.