scientific article; zbMATH DE number 1760069

MaRDI QIDQ4537015zbMATH OpenFDO

Authors Thomas Rauber, Gudula Rünger, Carsten Scholtes

Publication date 6 November 2002

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
• Publication:4860191
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Publication:4860184

Cited in

(12)

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

This page was built for publication:

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