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

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

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