A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- 1 June 1988
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 7 (2), 199-210
- https://doi.org/10.1016/0167-8191(88)90039-7
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987
- Symbolic Cholesky factorization on a local-memory multiprocessorParallel Computing, 1987
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Sparse Cholesky factorization on a local-memory multiprocessorPublished by Office of Scientific and Technical Information (OSTI) ,1986
- Parallel pivoting algorithms for sparse symmetric matricesParallel Computing, 1984
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982
- A Survey of Interconnection NetworksComputer, 1981
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefrontInternational Journal for Numerical Methods in Engineering, 1979
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976