Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer

DOI10.1016/0024-3795(86)90175-8zbMath0587.65016OpenAlexW2061691414MaRDI QIDQ1072331

David S. Scott

Publication date: 1986

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90175-8

zbMATH Keywords

parallel computationCholesky factorizationsquare-root bottleneck

Mathematics Subject Classification ID

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

Cites Work

• Assignment and scheduling in parallel matrix factorization

This page was built for publication: Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer