A Mapping Algorithm for Parallel Sparse Cholesky Factorization

DOI10.1137/0914074MaRDI QIDQ4271106zbMATH OpenOpenAlexFDO

Authors Alex Pothen, Chunguang Sun

Publication date 6 January 1994

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0914074

zbMATH Keywords

numerical resultsparallel computingdistributed-memory multiprocessormapping algorithmirregular sparse linear systemsparallel multifrontal Cholesky factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 833696
• Highly Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 833702
• scientific article; zbMATH DE number 1760069
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• scientific article; zbMATH DE number 1302627
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Task scheduling for parallel sparse Cholesky factorization

Cited in

(12)

• A survey of direct methods for sparse linear systems
• A distributed-memory randomized structured multifrontal method for sparse direct solutions
• Data-Parallel Sparse Factorization
• A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Multiple-rank modifications of a sparse Cholesky factorization
• Task scheduling for parallel sparse Cholesky factorization
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Robust memory-aware mappings for parallel multifrontal factorizations
• A parallel sparse direct solver via hierarchical DAG scheduling

This page was built for publication: A Mapping Algorithm for Parallel Sparse Cholesky Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271106)