On evaluating elimination tree based parallel sparse cholesky factorizations

DOI10.1080/00207160008804948MaRDI QIDQ4955154zbMATH OpenOpenAlexWikidataFDO

Authors Wen-Yang Lin, Chuen-Liang Chen

Publication date 14 June 2001

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160008804948

zbMATH Keywords

sparse matricesCholesky factorizationnumerical examplesparallel computationmultifrontal methodelimination treeequivalent reordering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 434523
• A parallel algorithm for elimination tree computation and symbolic factorization
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 833696

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 833702 (Why is no real title available?)
• A Data Structure for Parallel L/U Decomposition
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• A New Implementation of Sparse Gaussian Elimination
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Highly Parallel Sparse Cholesky Factorization
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Parallel Algorithms for Sparse Linear Systems
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Parallel implementation of multifrontal schemes
• Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear

Cited in

(7)

• A survey of direct methods for sparse linear systems
• A compact row storage scheme for Cholesky factors using elimination trees
• scientific article; zbMATH DE number 2087095 (Why is no real title available?)
• Parallel implementation of multifrontal schemes
• The average parallel complexity of Cholesky factorization
• A parallel algorithm for elimination tree computation and symbolic factorization
• A study of the factorization fill‐in for a parallel implementation of the finite element method

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: On evaluating elimination tree based parallel sparse cholesky factorizations

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