The Role of Elimination Trees in Sparse Factorization
- 1 January 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 11 (1), 134-172
- https://doi.org/10.1137/0611010
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- General Sparse Elimination Requires No Permanent Integer StorageSIAM Journal on Scientific and Statistical Computing, 1987
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- A Note on the Work Involved in No-fill Sparse Matrix FactorizationIMA Journal of Numerical Analysis, 1983
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982
- Experience of sparse matrix codes on the CRAY-1Computer Physics Communications, 1982
- Full matrix techniques in sparse Gaussian eliminationPublished by Springer Nature ,1982
- Algorithms and Data Structures for Sparse Symmetric Gaussian EliminationSIAM Journal on Scientific and Statistical Computing, 1981
- Some stable methods for calculating inertia and solving symmetric linear systemsMathematics of Computation, 1977
- 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