A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
DOI10.1016/0167-8191(88)90039-7zbMATH Open0654.65025OpenAlexW2023521505MaRDI QIDQ1108738FDOQ1108738
Authors: Earl Zmijewski, J. R. Gilbert 
Publication date: 1988
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(88)90039-7
Recommendations
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- Publication:4860184
- Parallel Cholesky factorization on a shared-memory multiprocessor
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
- Parallel Cholesky factorization on orthogonal multiprocessors
- Highly Parallel Sparse Cholesky Factorization
- scientific article; zbMATH DE number 1760069
- Publication:4860191
- Parallel symbolic factorization of sparse linear systems
parallel algorithmcomplexityelimination forestslarge sparse symmetric positive definite matrixmessage-passing hypercube multiprocessorparallel symbolic Cholesky factorization algorithm
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Factorization of matrices (15A23)
Cited In (12)
- A survey of direct methods for sparse linear systems
- Parallel symbolic factorization of sparse linear systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- Title not available (Why is that?)
- A parallel Cholesky algorithm for the solution of symmetric linear systems
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
- Task scheduling for parallel sparse Cholesky factorization
- A parallel algorithm for elimination tree computation and symbolic factorization
- Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
This page was built for publication: A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108738)
