Sign inSign in
ConceptEngineering

Sparse Cholesky factorization

Sparse Cholesky factorization uses permutation matrices to preserve sparsity and reduce computational cost when factoring sparse positive definite matrices.
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.

Cholesky factorization1Permutation matrices1Sparse matrices1Sparsity pattern1

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    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.