A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- 1 November 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 10 (6) , 1146-1173
- https://doi.org/10.1137/0910070
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- A Note on the Work Involved in No-fill Sparse Matrix FactorizationIMA Journal of Numerical Analysis, 1983
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- Applications of an Element Model for Gaussian Elimination11This work was supported in part by NSF Grant GJ-43157 and ONR Grant N00014-67-A-0097-0016.Published by Elsevier ,1976
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965