ConceptEngineering
Sparse Cholesky factorization
Sparse Cholesky factorization uses permutation matrices to preserve sparsity and reduce computational cost when factoring sparse positive definite matrices.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.