|
Volumn 54, Issue 1, 1995, Pages 39-67
|
A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
|
Author keywords
AMS Subject Classifications: 65F05, 65Y05; binary tree; block algorithm; coarse grain parallelism; drop tolerance; Gaussian elimination; general sparsity; re ordering; Sparse matrix; speed up
|
Indexed keywords
ALGORITHMS;
BINARY SEQUENCES;
BLOCK CODES;
LINEAR ALGEBRA;
MATRIX ALGEBRA;
OPTIMIZATION;
PERFORMANCE;
BINARY TREE;
BLOCK ALGORITHM;
COARSE GRAIN PARALLELISM;
DROP TOLERANCE;
FACTORIZATION;
GAUSSIAN ELIMINATION;
GENERAL SPARSITY;
LINEAR ALGEBRAIC EQUATION;
REORDERING;
SPARSE MATRIX;
PARALLEL PROCESSING SYSTEMS;
|
EID: 0029209175
PISSN: 0010485X
EISSN: 14365057
Source Type: Journal
DOI: 10.1007/BF02238079 Document Type: Article |
Times cited : (13)
|
References (28)
|