Sign inSign in
ConceptEngineering

Polynomial approximation on spectrum

The error bound of the iterative method depends on finding a polynomial of degree k taking value 1 at 0 that remains small across the eigenvalues of A.
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.

Conjugate gradient or Krylov subspace methods1Eigenvalue1Polynomials1

Lecturers

1

    Connections

    2

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

    1 lecturer. 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.