Accession Number : ADA186559
Title : Multicolor Numbering of Irregular Triangular Meshes.
Descriptive Note : Technical rept.,
Corporate Author : PITTSBURGH UNIV PA INST FOR COMPUTATIONAL MATHEMATICS AND APPLICATIONS
Personal Author(s) : Melhem, Rami G ; Ramarao, K V
PDF Url : ADA186559
Report Date : Jun 1987
Pagination or Media Count : 33
Abstract : Many iterative algorithms for the solution of large linear systems may be effectively vectorized only if the diagonal of the matrix is surrounded by a large band of zeroes, which 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 generalization of a known algorithm for regularly sparse matrices, executes in linear time, and produces a zero stretch approximately equal to n/2sigma, where sigma is the number of colors used in the algorithm. For triangular meshes, it is shown that sigmaor=3, and that it is possible to obtain o mega = 2 by applying a simple backtracking scheme.
Descriptors : *ALGORITHMS, *ITERATIONS, *SOLUTIONS(GENERAL), COLORS, LINEAR SYSTEMS, SPARSE MATRIX, TIME, MESH
Subject Categories : Statistics and Probability
Distribution Statement : APPROVED FOR PUBLIC RELEASE