On some variants of the bandwidth minimization problem
SIAM Journal on Computing
A node-addition model for symbolic factorization
ACM Transactions on Mathematical Software (TOMS) - The MIT Press scientific computation series
A linear time implementation of profile reduction algorithms for sparse matrices
SIAM Journal on Scientific and Statistical Computing
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
Determination of stripe structures for finite element matrics
SIAM Journal on Numerical Analysis
A Comparison of Several Bandwidth and Profile Reduction Algorithms
ACM Transactions on Mathematical Software (TOMS)
Design of an Adaptive, Parallel Finite-Element System
ACM Transactions on Mathematical Software (TOMS)
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
ACM '68 Proceedings of the 1968 23rd ACM national conference
A Systolic Accelerator for the Iterative Solution of Sparse Linear Systems
IEEE Transactions on Computers
Techniques to overlap computation and communication in irregular iterative applications
ICS '94 Proceedings of the 8th international conference on Supercomputing
Multicoloring of Grid-Structured PDE Solvers on Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Parallelizing SOR for GPGPUs using alternate loop tiling
Parallel Computing
| Hi-index | 0.00 |
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.