Sign inSign in
ConceptEngineering

Gram-Schmidt procedure

An algorithm that takes a set of independent vectors and generates an orthonormal basis spanning the same subspace.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Barton Zwiebach

    MIT · Undergraduate

    An algorithm to construct an orthonormal basis from a linearly independent list of vectors.
    • 56:23Linear Algebra III: Hermitian & Unitary Operators, Eigenvalues & Spectral Theorem

Lectures that assume it

1

Connections

11

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.