The average parallel complexity of Cholesky factorization

DOI10.1016/0898-1221(91)90204-HzbMath0755.65033MaRDI QIDQ1192153

Giovanni Resta

Publication date: 27 September 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

numerical experimentsrandom matricesCholesky factorizationsparse matricesparallel complexitynumerical factorizationminimum degree orderingsparse symmetric matricesdirect factorizationsaverage-case performancesymbolic factorizationaverage depth of the elimination treesolution of triangular systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Recurrent neural networks for LU decomposition and Cholesky factorization

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Evolution of the Minimum Degree Ordering Algorithm
• Computing the Minimum Fill-In is NP-Complete
• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices

This page was built for publication: The average parallel complexity of Cholesky factorization