ConceptEngineering
Sparse LU factorization
The ability to explicitly decompose a sparse matrix into the product of a lower triangular and an upper triangular matrix.
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.
Lecturers
2Each in their own terms, from the easiest level.
Stephen Boyd
An LU factorization that includes both row and column permutation matrices to exploit sparsity and reduce computational cost.
Connections
4The lectures that define it or assume it, and the concepts next to it.