Parallel and fully recursive multifrontal supernodal sparse Cholesky

DOI10.1007/3-540-46080-2_35MaRDI QIDQ4737756zbMATH OpenFDO

Authors Dror Irony, Gil Shklarski, Sivan Toledo

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2330/23300335.htm

zbMATH Keywords

parallel computationparallel sparse Cholesky factorizationperformancesupernodal multifrontal 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) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• On evaluating elimination tree based parallel sparse cholesky factorizations
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• scientific article; zbMATH DE number 434523
• scientific article; zbMATH DE number 833696

Cited in

(7)

• Hypermatrix oriented supernode amalgamation
• Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• On Finding Supernodes for Sparse Matrix Computations
• Large-scale sparse inverse covariance matrix estimation
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• A parallel sparse direct solver via hierarchical DAG scheduling

Describes a project that uses

Uses Software

• ATLAS
• PaStiX
• PSPASES
• LAPACK
• BLAS
• ScaLAPACK
• PHiPAC
• Algorithm 679

This page was built for publication: Parallel and fully recursive multifrontal supernodal sparse Cholesky

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