On the Minimum FLOPs Problem in the Sparse Cholesky Factorization

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 fill elements in Cholesky factor and the number of arithmetic operations (FLOPs) in the numerical factorization. These two metrics are clearly somehow related and yet it is suspected that these two problems are different. However, no rigorous theoretical treatment of the relation of these two problems seems to have been given yet. In this paper we show by means of an explicit, scalable construction that the two problems are different in a very strict sense: no ordering is optimal for both fill and FLOPs in the constructed graph. Further, it is commonly believed that minimizing the number of FLOPs is no easier than minimizing the fill (in the complexity sense), but so far no proof appears to be known. We give a reduction chain that shows the NP hardness of minimizing the number of arithmetic operations in the Cholesky factorization.

[1]  Padma Raghavan,et al.  Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization , 1999, SIAM J. Matrix Anal. Appl..

[2]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.

[3]  Alan George,et al.  The Evolution of the Minimum Degree Ordering Algorithm , 1989, SIAM Rev..

[4]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[5]  Pinar Heggernes,et al.  Minimal triangulations of graphs: A survey , 2006, Discret. Math..

[6]  Roded Sharan,et al.  A Polynomial Approximation Algorithm for the Minimum Fill-In Problem , 2000, SIAM J. Comput..

[7]  Timothy A. Davis,et al.  Algorithm 837: AMD, an approximate minimum degree ordering algorithm , 2004, TOMS.

[8]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[9]  A. George,et al.  An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems , 1997, SIAM J. Matrix Anal. Appl..

[10]  S. Eisenstat,et al.  Node Selection Strategies for Bottom-Up Sparse Matrix Ordering , 1998, SIAM J. Matrix Anal. Appl..

[11]  Shimon Even,et al.  Graph Algorithms , 1979 .

[12]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[13]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[14]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[15]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[16]  Sartaj Sahni,et al.  Handbook Of Data Structures And Applications (Chapman & Hall/Crc Computer and Information Science Series.) , 2004 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[19]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[20]  Sartaj Sahni,et al.  Handbook of Data Structures and Applications , 2004 .

[21]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[22]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[23]  Iain S. Duff,et al.  A Note on the Work Involved in No-fill Sparse Matrix Factorization , 1983 .

[24]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[25]  Philip N. Klein,et al.  Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings , 1993 .