The average parallel complexity of Cholesky factorization

DOI10.1016/0898-1221(91)90204-HzbMATH Open0755.65033MaRDI QIDQ1192153FDOQ1192153

Authors: Giovanni Resta 

Publication date: 27 September 1992

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

Recommendations

• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• On evaluating elimination tree based parallel sparse cholesky factorizations
• On the minimum FLOPs problem in the sparse Cholesky factorization
• Minimum communication cost reordering for parallel sparse Cholesky factorization
• Parallel sparse Cholesky factorization on a shared memory multiprocessor

zbMATH Keywords

sparse matricesCholesky factorizationnumerical experimentsrandom matricesparallel complexityminimum degree orderingnumerical factorizationsparse symmetric matricesdirect factorizationsaverage-case performancesymbolic factorizationaverage depth of the elimination treesolution of triangular systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Evolution of the Minimum Degree Ordering Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the Minimum Fill-In is NP-Complete
• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices

Cited In (1)

• Recurrent neural networks for LU decomposition and Cholesky factorization

Uses Software

• symrcm

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

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