A spectral algorithm for envelope reduction of sparse matrices
Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope‐reducing reordering is...
Publications
2 shownPartitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
Frequent Co-Authors
Researcher Info
- h-index
- 2
- Publications
- 2
- Citations
- 1,826
- Institution
- Old Dominion University
External Links
Identifiers
- ORCID
- 0000-0002-3421-3325
Impact Metrics
h-index
2
h-index: Number of publications with at least h citations each.