Highly Parallel Sparse Cholesky Factorization

DOI10.1137/0913067MaRDI QIDQ4021695zbMATH OpenOpenAlexFDO

Authors J. R. Gilbert, Robert Schreiber

Publication date 16 January 1993

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2060/19910023533

zbMATH Keywords

matrix factorizationsparse matricesCholesky decompositionparallel algorithmsmassively parallel computersGrid CholeskyRouter Cholesky

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Parallel Algorithms for Sparse Linear Systems
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
• scientific article; zbMATH DE number 1372507
• scientific article; zbMATH DE number 434521

Cited in

(23)

• scientific article; zbMATH DE number 17454 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• Sparse QR factorization on a massively parallel computer
• Data-Parallel Sparse Factorization
• scientific article; zbMATH DE number 554771 (Why is no real title available?)
• Recurrent neural networks for LU decomposition and Cholesky factorization
• Locality of reference in sparse Cholesky factorization methods
• Tree organization of the data structure for Cholesky factorization
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
• Parallel iterative solution for the Helmholtz equation with exact non-reflecting boundary conditions
• Multiple-rank modifications of a sparse Cholesky factorization
• Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Task scheduling for parallel sparse Cholesky factorization
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• scientific article; zbMATH DE number 434521 (Why is no real title available?)
• scientific article; zbMATH DE number 440657 (Why is no real title available?)
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• On evaluating elimination tree based parallel sparse cholesky factorizations

This page was built for publication: Highly Parallel Sparse Cholesky Factorization

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