Multicolor reordering of sparse matrices resulting from irregular grids

Many iterative algorithms for the solution of large linear systems may be effectively vectorized if the diagonal of the matrix is surrounded by a large band of zeroes, whose width is called the zero stretch. In this paper, a multicolor numbering technique is suggested for maximizing the zero stretch of irregularly sparse matrices. The technique, which is a generalization of a known multicoloring algorithm for regularly sparse matrices, executes in linear time, and produces a zero stretch approximately equal to n/2&sgr;, where 2&sgr; is the number of colors used in the algorithm. For triangular meshes, it is shown that &sgr; ≤ 3, and that it is possible to obtain &sgr; = 2 by applying a simple backtracking scheme.

[1]  Jonathan S. Turner,et al.  On the Probable Performance of Heuristics for Bandwidth Minimization , 1986, SIAM J. Comput..

[2]  J. Meijerink,et al.  An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix , 1977 .

[3]  J. Ortega,et al.  A multi-color SOR method for parallel computation , 1982, ICPP.

[4]  Pamela Zave,et al.  Design of an Adaptive, Parallel Finite-Element System , 1979, TOMS.

[5]  T. Manteuffel.  An incomplete factorization technique for positive definite linear systems , 1980 .

[6]  Rami Melhem,et al.  Toward Efficient Implementation of Preconditioned Conjugate Gradient Methods On Vector Supercomputers , 1987 .

[7]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[8]  Oliver Vornberger,et al.  On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..

[9]  Rami G. Melhem.  Iterative Solution of Sparse Linear Systems on Systolic Arrays , 1987, ICPP.

[10]  Norman E. Gibbs,et al.  A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.

[11]  Rami G. Melhem,et al.  Parallel solution of linear systems with striped sparse matrices , 1988, Parallel Comput..

[12]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[13]  G. Chartrand,et al.  Graphs with Forbidden Subgraphs , 1971 .

[14]  Kincho H. Law,et al.  A node-addition model for symbolic factorization , 1986, TOMS.

[15]  L Marro.  A linear time implementation of profile reduction algorithms for sparse matrices , 1986 .

[16]  E. L. Poole,et al.  Multicolor ICCG methods for vector computers , 1987 .

[17]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[18]  Rami Melhem,et al.  Determination of stripe structures for finite element matrics , 1987 .

[19]  Richard Rosen.  Matrix bandwidth minimization , 1968, ACM National Conference.

[20]  D. Young,et al.  Vector computations for sparse linear systems , 1986 .

[21]  Youcef Saad,et al.  Parallel Implementations of Preconditioned Conjugate Gradient Methods. , 1985 .

[22]  H. Saunders.  Book Reviews : The Finite Element Method (Revised): O.C. Zienkiewicz McGraw-Hill Book Co., New York, New York , 1980 .