The average parallel complexity of Cholesky factorization
From MaRDI portal
Publication:1192153
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
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Computing the Minimum Fill-In is NP-Complete
- On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
- The Evolution of the Minimum Degree Ordering Algorithm
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)