Two-dimensional block partitionings for the parallel sparse Cholesky factorization

DOI10.1023/A:1019122726788MaRDI QIDQ1385158zbMATH OpenOpenAlexFDO

Authors M. Doreille, B. Dumitrescu, Jean-Louis Roch, Denis Trystram

Publication date 17 August 1999

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019122726788

zbMATH Keywords

parallel computationblock partitioningsparse Cholesky factorizationmapping algorithmsdistributed-memory computer systems

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

• Publication:4860184
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

Cited in

(7)

• scientific article; zbMATH DE number 833696 (Why is no real title available?)
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• scientific article; zbMATH DE number 720649 (Why is no real title available?)
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• scientific article; zbMATH DE number 554769 (Why is no real title available?)

Describes a project that uses

Uses Software

• BLAS

This page was built for publication: Two-dimensional block partitionings for the parallel sparse Cholesky factorization

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