The following pages link to HSL_MA87 (Q24957):
Displayed 17 items.
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- \(\mathcal H\)-LU factorization on many-core systems (Q1685030) (← links)
- Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
- New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
- Sparse Cholesky factorization on FPGA using parameterized model (Q1992573) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling (Q2830621) (← links)
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints (Q2952141) (← links)
- Pivoting strategies for tough sparse indefinite systems (Q3189697) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- Multilevel Balancing Domain Decomposition at Extreme Scales (Q3464426) (← links)
- SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic (Q5065492) (← links)
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems (Q5270774) (← links)
- Reordering Strategy for Blocking Optimization in Sparse Linear Solvers (Q5346752) (← links)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems (Q5350438) (← links)