The influence of relaxed supernode partitions on the multifrontal method

In this paper we present an algorithm for partitioning the nodes of a graph into supernodes, which improves the performance of the multifrontal method for the factorization of large, sparse matrices on vector computers. This new algorithm first partitions the graph into fundamental supernodes. Next, using a specified relaxation parameter, the supernodes are coalesced in a careful manner to create a coarser supernode partition. Using this coarser partition in the factorization generally introduces logically zero entries into the factor. This is accompanied by a decrease in the amount of sparse vector computations and data movement and an increase in the number of dense vector operations. The amount of storage required for the factor is generally increased by a small amount. On a collection of moderately sized 3-D structures, matrices speedups of 3 to 20 percent on the Cray X-MP are observed over the fundamental supernode partition which allows no logically zero entries in the factor. Using this relaxed supernode partition, the multifrontal method now factorizes the extremely sparse electric power matrices faster than the general sparse algorithm. In addition, there is potential for considerably reducing the communication requirements for an implementation of the multifrontal method on a local memory multiprocessor.

[1]  Stanley C. Eisenstat,et al.  Software for Sparse Gaussian Elimination with Limited Core Storage. , 1978 .

[2]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[3]  Stanley C. Eisenstat,et al.  Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination , 1981 .

[4]  Iain S. Duff,et al.  Full matrix techniques in sparse Gaussian elimination , 1982 .

[5]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[6]  Robert Schreiber,et al.  A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.

[7]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

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

[9]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .

[10]  Jack J. Dongarra,et al.  Squeezing the most out of an algorithm in CRAY FORTRAN , 1984, ACM Trans. Math. Softw..

[11]  John G. Lewis,et al.  Proposed sparse extensions to the Basic Linear Algebra Subprograms , 1985, SGNM.

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

[13]  Iain S. Duff,et al.  Parallel implementation of multifrontal schemes , 1986, Parallel Comput..

[14]  John G. Lewis,et al.  The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination , 1986, ICPP.

[15]  Joseph W. H. Liu,et al.  On the storage requirement in the out-of-core multifrontal method for sparse factorization , 1986, TOMS.

[16]  Joseph W. Liu,et al.  A compact row storage scheme for Cholesky factors using elimination trees , 1986, TOMS.

[17]  Barry W. Peyton,et al.  Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .

[18]  Jack J. Dongarra,et al.  An extended set of FORTRAN basic linear algebra subprograms , 1988, TOMS.

[19]  John G. Lewis,et al.  Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms , 1991, TOMS.