Pages that link to "Item:Q1086977"
From MaRDI portal
The following pages link to Computational models and task scheduling for parallel sparse Cholesky factorization (Q1086977):
Displaying 11 items.
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- The formal development of a parallel program performing LU-decomposition (Q1096311) (← links)
- Solution of sparse positive definite systems on a shared-memory multiprocessor (Q1101182) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers (Q1186822) (← links)
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices (Q1647455) (← links)
- Multiprocessing a sparse matrix code on the Alliant FX/8 (Q1824981) (← links)
- On evaluating elimination tree based parallel sparse cholesky factorizations (Q4955154) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
