Pages that link to "Item:Q4271106"
From MaRDI portal
The following pages link to A Mapping Algorithm for Parallel Sparse Cholesky Factorization (Q4271106):
Displaying 12 items.
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor (Q1108738) (← links)
- Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems (Q2009864) (← links)
- Multiple-rank modifications of a sparse Cholesky factorization (Q2706302) (← links)
- Robust memory-aware mappings for parallel multifrontal factorizations (Q2815696) (← links)
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor (Q3783413) (← links)
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization (Q4316313) (← links)
- Data-Parallel Sparse Factorization (Q4389260) (← links)
- A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling (Q5270706) (← links)
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization (Q5270756) (← links)
- A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions (Q5350214) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)