Scalability of parallel sparse Cholesky factorization

DOI10.1007/BFB0002801MaRDI QIDQ4537015zbMATH OpenFDO

Authors Thomas Rauber, Gudula Rünger, Carsten Scholtes

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002801

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Computing methodologies and applications (68U99)

Recommendations

• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 1163095
• scientific article; zbMATH DE number 833702
• Computational models and task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 833696

Cited in

(12)

• Computational models and task scheduling for parallel sparse Cholesky factorization
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Multiple-rank modifications of a sparse Cholesky factorization
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 554770 (Why is no real title available?)
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• scientific article; zbMATH DE number 833702 (Why is no real title available?)
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• Task scheduling for parallel sparse Cholesky factorization

This page was built for publication: Scalability of parallel sparse Cholesky factorization

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