Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- 1 March 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 9 (2), 327-340
- https://doi.org/10.1137/0909021
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- Parallel Cholesky factorization on a shared-memory multiprocessorLinear Algebra and its Applications, 1986
- The Multifrontal Solution of Unsymmetric Sets of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1984
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- Full matrix techniques in sparse Gaussian eliminationPublished by Springer Nature ,1982
- An Optimal Agorithm for Symbolic Factorization of Symmetric MatricesSIAM Journal on Computing, 1980
- An Automatic Nested Dissection Algorithm for Irregular Finite Element ProblemsSIAM Journal on Numerical Analysis, 1978
- 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