A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
SIAM Journal on Matrix Analysis and Applications
Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]
ACM Transactions on Mathematical Software (TOMS)
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
ACM Transactions on Mathematical Software (TOMS)
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
A Multilevel Algorithm for Wavefront Reduction
SIAM Journal on Scientific Computing
Minimizing the Profile of a Symmetric Matrix
SIAM Journal on Scientific Computing
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Two Improved Algorithms for Envelope and Wavefront Reduction
Two Improved Algorithms for Envelope and Wavefront Reduction
A Spectral Algorithm for Envelope Reduction of Sparse Matrices *
A Spectral Algorithm for Envelope Reduction of Sparse Matrices *
A partitioning algorithm for block-diagonal matrices with overlap
Parallel Computing
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
SIAM Journal on Scientific Computing
| Hi-index | 0.00 |
Hager recently introduced down and up exchange methods for reducing the profile of a sparse matrix with a symmetric sparsity pattern. The methods are particularly useful for refining orderings that have been obtained using a standard profile reduction algorithm, such as the Sloan method. The running times for the exchange algorithms reported by Hager suggested their cost could be prohibitive for practical applications. We examine how to implement the exchange algorithms efficiently. For a range of real test problems, it is shown that the cost of running our new implementation does not add a prohibitive overhead to the cost of the original reordering.