A Mapping Algorithm for Parallel Sparse Cholesky Factorization

DOI10.1137/0914074zbMath0785.65016OpenAlexW2026139385MaRDI QIDQ4271106

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

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

Related Items (7)

A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions ⋮ Data-Parallel Sparse Factorization ⋮ A survey of direct methods for sparse linear systems ⋮ Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems ⋮ Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling ⋮ A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

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