On the minimum FLOPs problem in the sparse Cholesky factorization
The authors reconsider the idea of reordering rows and columns of a matrix, for reducing both the number of fill elements and, respectively, arithmetic operations in the Cholesky factorization algorithm. They show that no ordering is optimal for both fill and FLOPs in the constructed graph, and provide a reduction chain that shows the NP hardness of minimizing the number of arithmetic operations.
scientific article; zbMATH DE number 6333357