HSL_MA87

HSL_MA87. Parallel Sparse Cholesky Solver: HSL_MA87 provides a parallel sparse Cholesky factorization for real symmetric or complex Hermitian systems that are positive-definite. It is a new code that has been designed for top performance on modern multi-core machines, giving superior performance to that of other solvers

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 15 articles , 1 standard article )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Jacquelin, Mathias; Ng, Esmond G.; Peyton, Barry W.: Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes (2021)
  2. Duff, Iain; Hogg, Jonathan; Lopez, Florent: Experiments with sparse Cholesky using a sequential task-flow implementation (2018)
  3. Scott, Jennifer; Tůma, Miroslav: A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (2018)
  4. Gould, Nicholas I. M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)
  5. Pichon, Gregoire; Faverge, Mathieu; Ramet, Pierre; Roman, Jean: Reordering strategy for blocking optimization in sparse linear solvers (2017)
  6. Scott, Jennifer: On using Cholesky-based factorizations and regularization for solving rank-deficient sparse linear least-squares problems (2017)
  7. Sun, Yichun; Liu, Hengzhu; Zhou, Tong: Sparse Cholesky factorization on FPGA using parameterized model (2017)
  8. Agullo, Emmanuel; Buttari, Alfredo; Guermouche, Abdou; Lopez, Florent: Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems (2016)
  9. Badia, Santiago; Martín, Alberto F.; Principe, Javier: Multilevel balancing domain decomposition at extreme scales (2016)
  10. Ghysels, Pieter; Li, Xiaoye S.; Rouet, François-Henry; Williams, Samuel; Napov, Artem: An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling (2016)
  11. Hogg, Jonathan D.; Scott, Jennifer A.: Pivoting strategies for tough sparse indefinite systems (2013)
  12. Hogg, Jonathan; Scott, Jennifer: New parallel sparse direct solvers for multicore architectures (2013)
  13. Kriemann, Ronald: (\mathcalH)-LU factorization on many-core systems (2013)
  14. Browne, P. A.; Budd, C.; Gould, N. I. M.; Kim, H. A.; Scott, J. A.: A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints (2012)
  15. Hogg, J. D.; Reid, J. K.; Scott, J. A.: Design of a multicore sparse Cholesky factorization using DAGs (2010)