A spectral algorithm for envelope reduction of sparse matrices
Conference
·
OSTI ID:46245
- NASA Ames Research Center, Moffett Field, CA (United States). Cray Research Inc.
- Univ. of Waterloo, Ontario (Canada). Computer Science Dept.
A new algorithm for reducing the envelope of a sparse matrix is presented. This algorithm is based on the computation of eigenvectors of the Laplacian matrix associated with the graph of the sparse matrix. A reordering of the sparse matrix is determined based on the numerical values of the entries of an eigenvector of the Laplacian matrix. Numerical results show that the new reordering algorithm can in some cases reduce the envelope by more than a factor of two over the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK`s reverse Cuthill-McKee (RCM).
- DOE Contract Number:
- FG02-91ER25095
- OSTI ID:
- 46245
- Report Number(s):
- CONF-931115--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Partitioning sparse matrices with eigenvectors of graphs
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
A Partitioning Algorithm for Block-Diagonal Matrices With Overlap
Journal Article
·
Sun Jul 01 00:00:00 EDT 1990
· SIAM Journal on Matrix Analysis and Applications
·
OSTI ID:6696852
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
Journal Article
·
Thu Dec 31 23:00:00 EST 2015
·
OSTI ID:1439186
A Partitioning Algorithm for Block-Diagonal Matrices With Overlap
Journal Article
·
Fri Feb 01 23:00:00 EST 2008
· Parallel Computing
·
OSTI ID:941101