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

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

  1. Duff, Iain; Hogg, Jonathan; Lopez, Florent: Experiments with sparse Cholesky using a sequential task-flow implementation (2018)
  2. Scott, Jennifer; Tůma, Miroslav: A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (2018)
  3. Gould, Nicholas I. M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)
  4. Pichon, Gregoire; Faverge, Mathieu; Ramet, Pierre; Roman, Jean: Reordering strategy for blocking optimization in sparse linear solvers (2017)
  5. Scott, Jennifer: On using Cholesky-based factorizations and regularization for solving rank-deficient sparse linear least-squares problems (2017)
  6. Agullo, Emmanuel; Buttari, Alfredo; Guermouche, Abdou; Lopez, Florent: Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems (2016)
  7. Badia, Santiago; Martín, Alberto F.; Principe, Javier: Multilevel balancing domain decomposition at extreme scales (2016)
  8. 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)
  9. Hogg, Jonathan D.; Scott, Jennifer A.: Pivoting strategies for tough sparse indefinite systems (2013)
  10. Kriemann, Ronald: (\mathcalH)-LU factorization on many-core systems (2013)
  11. 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)
  12. Hogg, J. D.; Reid, J. K.; Scott, J. A.: Design of a multicore sparse Cholesky factorization using DAGs (2010)