Pages that link to "Item:Q1960600"
From MaRDI portal
The following pages link to Minimum communication cost reordering for parallel sparse Cholesky factorization (Q1960600):
Displaying 4 items.
- The average parallel complexity of Cholesky factorization (Q1192153) (← links)
- Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization (Q1402303) (← links)
- On the minimum FLOPs problem in the sparse Cholesky factorization (Q2877076) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)