Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AAT, updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx = b, and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS. Both real and complex matrices are supported. CHOLMOD is written in ANSI/ISO C, with both C and MATLABTM interfaces. It appears in MATLAB 7.2 as x = A when A is sparse symmetric positive definite, as well as in several other sparse matrix functions. (Source:

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

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

1 2 3 4 5 next

  1. Anita K. Nandi, Tim C. D. Lucas, Rohan Arambepola, Peter Gething, Daniel J. Weiss: disaggregation: An R Package for Bayesian Spatial Disaggregation Modelling (2020) arXiv
  2. Ben Hermans, Andreas Themelis, Panagiotis Patrinos: QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs (2020) arXiv
  3. Calo, Victor M.; Ern, Alexandre; Muga, Ignacio; Rojas, Sergio: An adaptive stabilized conforming finite element method via residual minimization on dual discontinuous Galerkin norms (2020)
  4. Cambier, Léopold; Chen, Chao; Boman, Erik G.; Rajamanickam, Sivasankaran; Tuminaro, Raymond S.; Darve, Eric: An algebraic sparsified nested dissection algorithm using low-rank approximations (2020)
  5. Hartwig Anzt, Terry Cojean, Yen-Chen Chen, Goran Flegar, Fritz Göbel, Thomas Grützmacher, Pratik Nayak, Tobias Ribizel, Yu-Hsiang Tsai: Ginkgo: A high performance numerical linear algebra library (2020) not zbMATH
  6. Liu, Xiao; Xia, Jianlin; de Hoop, Maarten: Fast factorization update for general elliptic equations under multiple coefficient updates (2020)
  7. Nigam, Nilima; Siudeja, Bartłomiej; Young, Benjamin: A proof via finite elements for Schiffer’s conjecture on a regular pentagon (2020)
  8. Sander, Oliver: DUNE -- the distributed and unified numerics environment (2020)
  9. Sassen, Josua; Heeren, Behrend; Hildebrandt, Klaus; Rumpf, Martin: Geometric optimization using nonlinear rotation-invariant coordinates (2020)
  10. Yeung, Yu-Hong; Pothen, Alex; Crouch, Jessica: AMPS: Real-time mesh cutting with augmented matrices for surgical simulations. (2020)
  11. Bollhöfer, Matthias; Eftekhari, Aryan; Scheidegger, Simon; Schenk, Olaf: Large-scale sparse inverse covariance matrix estimation (2019)
  12. Hardin, Thomas J.: Accelerating coupled finite element-kinetic Monte Carlo models: (200 \times) speedup of shear transformation zone dynamics simulations (2019)
  13. Howse, Alexander J.; de Sterck, Hans; Falgout, Robert D.; MacLachlan, Scott; Schroder, Jacob: Parallel-in-time multigrid with adaptive spatial coarsening for the linear advection and inviscid Burgers equations (2019)
  14. Li, Ruipeng; Xi, Yuanzhe; Erlandson, Lucas; Saad, Yousef: The eigenvalues slicing library (EVSL): algorithms, implementation, and software (2019)
  15. Senne, Thadeu A.; Gomes, Francisco A. M.; Santos, Sandra A.: On the approximate reanalysis technique in topology optimization (2019)
  16. Druinsky, Alex; Carlebach, Eyal; Toledo, Sivan: Wilkinson’s inertia-revealing factorization and its application to sparse matrices. (2018)
  17. Essid, Montacer; Solomon, Justin: Quadratically regularized optimal transport on graphs (2018)
  18. Fougner, Christopher; Boyd, Stephen: Parameter selection and preconditioning for a graph form solver (2018)
  19. Jung, Jihyun; Bae, Daesung: Accelerating implicit integration in multi-body dynamics using GPU computing (2018)
  20. Krattiger, Dimitri; Hussein, Mahmoud I.: Generalized Bloch mode synthesis for accelerated calculation of elastic band structures (2018)

1 2 3 4 5 next