Cited in
(42)- Multilevel balancing domain decomposition at extreme scales
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic
- Pivoting strategies for tough sparse indefinite systems
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- \(\mathcal H\)-LU factorization on many-core systems
- Sparse Cholesky factorization on FPGA using parameterized model
- Solving large linear least squares problems with linear equality constraints
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- PaStiX
- HSL_ea19
- WSMP
- MIQR
- SuiteSparseQR
- SuitSparseQR
- HSL_MA97
- MAGMA
- PLASMA
- HSL_MI28
- SPRAL
- SYM-ILDL
- HSL_MA77
- StarPU
- CIMGS
- kappa_SQ
- Tcmalloc
- Pogo
- Fortran_Virtual_Memory
- DAGuE
- UHM
- DQP
- heapsort
- Mongoose
- qr_mumps
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
- Experiments with sparse Cholesky using a sequential task-flow implementation
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- New parallel sparse direct solvers for multicore architectures
- Reordering strategy for blocking optimization in sparse linear solvers
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
This page was built for software: HSL_MA87
