Highly Parallel Sparse Cholesky Factorization

DOI10.1137/0913067zbMath0784.65018OpenAlexW2051800546MaRDI QIDQ4021695

Robert Schreiber, John R. Gilbert

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

sparse matricesparallel algorithmsmatrix factorizationCholesky decompositionmassively parallel computersGrid CholeskyRouter Cholesky

Mathematics Subject Classification ID

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

Related Items (8)

Parallel iterative solution for the Helmholtz equation with exact non-reflecting boundary conditions ⋮ Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors ⋮ Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method ⋮ Data-Parallel Sparse Factorization ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse QR factorization on a massively parallel computer ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Recurrent neural networks for LU decomposition and Cholesky factorization

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