Sign inSign in
ConceptEngineering

Recursive least squares

An algorithm to compute least-squares estimates sequentially as new measurements arrive over time without recomputing the entire sum.
as Stephen Boyd defines itStanford University
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.

Least squares2Least-squares problem in row form1Matrices and transposition1Matrix inversion1Matrix multiplication1Normal equations1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Gilbert Strang

    MIT · Undergraduate

    An algorithm that updates the solution to a least squares problem when new data comes in without recomputing the entire matrix product.
    • 28:26Low Rank Changes in A and Its Inverse

Connections

6

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

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