On the minimum FLOPs problem in the sparse Cholesky factorization

Robert Luce, Esmond Ng

Prior to computing the Cholesky factorization of a sparse, symmetric positive definite matrix, a reordering of the rows and columns is computed so as to reduce both the number of f…