The following pages link to Jonathan Hogg (Q1693235):
Displaying 16 items.
- A synchronization-free algorithm for parallel sparse triangular solves (Q1693237) (← links)
- Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
- New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
- A structure-conveying modelling language for mathematical and stochastic programming (Q2267351) (← links)
- A Sparse Symmetric Indefinite Direct Solver for GPU Architectures (Q2828161) (← links)
- A Fast Dense Triangular Solve in CUDA (Q2847757) (← links)
- Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems (Q2923371) (← links)
- An efficient analyse phase for element problems (Q2931513) (← links)
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems (Q2989100) (← links)
- Pivoting strategies for tough sparse indefinite systems (Q3189697) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
- A Structure Conveying Parallelizable Modeling Language for Mathematical Programming (Q3613507) (← links)
- Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems (Q4581369) (← links)
- Design of a Multicore Sparse Cholesky Factorization Using DAGs (Q5200267) (← links)
- A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting (Q5220405) (← links)
- Optimal Weighted Matchings for Rank-Deficient Sparse Matrices (Q5413656) (← links)
