JOURNAL ARTICLE
Reordering sparse matrices for parallel elimination
Year: 1989 Journal: Parallel Computing Vol: 11 (1)Pages: 73-91 Publisher: Elsevier BV
Keywords:
Gaussian elimination Tree (set theory) Gaussian Matrix (chemical analysis) Rotation (mathematics) Computer science Algorithm Class (philosophy) Combinatorics Scheme (mathematics) Running time Mathematics Artificial intelligence Physics
Metrics
81
Cited By
11.04
FWCI (Field Weighted Citation Impact)
29
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Graph Theory and Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
JOURNAL ARTICLE
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
John G. LewisBarry W. PeytonAlex Pothen
Journal: SIAM Journal on Scientific and Statistical Computing Year: 1989 Vol: 10 (6)Pages: 1146-1173
JOURNAL ARTICLE
Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
Journal: SIAM Journal on Scientific and Statistical Computing Year: 1988 Vol: 9 (3)Pages: 424-444
BOOK-CHAPTER
A Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices
Lecture notes in computer science Year: 2012 Pages: 183-193
JOURNAL ARTICLE
On sparse matrix reordering for parallel factorization
B. Raghu KumarP. SadayappanChien‐Hung Huang
Year: 1994 Pages: 431-438
JOURNAL ARTICLE
Optimally bipartitioning sparse matrices with reordering and parallelization
Aras MumcuyanBaran UstaKamer KayaHüsnü Yenigün
Journal: Concurrency and Computation Practice and Experience Year: 2018 Vol: 30 (21)