AMD

Algorithm 837: AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C and Fortran 77. A MATLAB interface is included.

Keywords for this software

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

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

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

1 2 3 next

  1. Ebenbeck, Matthias; Garcke, Harald; Nürnberg, Robert: Cahn-Hilliard-Brinkman systems for tumour growth (2021)
  2. Lin, Tianyi; Ma, Shiqian; Ye, Yinyu; Zhang, Shuzhong: An ADMM-based interior-point method for large-scale linear programming (2021)
  3. Wang, Jie; Magron, Victor; Lasserre, Jean-Bernard: Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension (2021)
  4. Zhang, Richard Y.; Lavaei, Javad: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (2021)
  5. Ben Hermans, Andreas Themelis, Panagiotis Patrinos: QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs (2020) arXiv
  6. Gu, Xian-Ming; Zhao, Yanpu; Huang, Tingzhu; Zhao, Ran: Efficient preconditioned iterative linear solvers for 3-D magnetostatic problems using edge elements (2020)
  7. Stellato, Bartolomeo; Banjac, Goran; Goulart, Paul; Bemporad, Alberto; Boyd, Stephen: OSQP: an operator splitting solver for quadratic programs (2020)
  8. Axelsson, Owe; Liang, Zhao-Zheng: Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices (2019)
  9. Berger-Vergiat, Luc; Chen, Xiaocui; Waisman, Haim: Explicit and implicit methods for shear band modeling at high strain rates (2019)
  10. Finley, Andrew O.; Datta, Abhirup; Cook, Bruce D.; Morton, Douglas C.; Andersen, Hans E.; Banerjee, Sudipto: Efficient algorithms for Bayesian nearest neighbor Gaussian processes (2019)
  11. Dillon, Geoffrey; Kalantzis, Vassilis; Xi, Yuanzhe; Saad, Yousef: A hierarchical low rank Schur complement preconditioner for indefinite linear systems (2018)
  12. Duff, Iain; Hogg, Jonathan; Lopez, Florent: Experiments with sparse Cholesky using a sequential task-flow implementation (2018)
  13. Peng, Wei; Wang, Hongxia: A general scheme for log-determinant computation of matrices via stochastic polynomial approximation (2018)
  14. Xi, Yuanzhe; Li, Ruipeng; Saad, Yousef: Fast computation of spectral densities for generalized eigenvalue problems (2018)
  15. Yamashita, Makoto; Mullin, Tim J.; Safarina, Sena: An efficient second-order cone programming approach for optimal selection in tree breeding (2018)
  16. Li, Ruipeng; Saad, Yousef: Low-rank correction methods for algebraic domain decomposition preconditioners (2017)
  17. Suñagua, Porfirio; Oliveira, Aurelio R. L.: A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (2017)
  18. Xi, Yuanzhe; Saad, Yousef: A rational function preconditioner for indefinite sparse linear systems (2017)
  19. Zhang, Ke; Zhang, Ju-Li; Gu, Chuan-Qing: A new relaxed PSS preconditioner for nonsymmetric saddle point problems (2017)
  20. Adcock, Aaron B.; Sullivan, Blair D.; Mahoney, Michael W.: Tree decompositions and social graphs (2016)

1 2 3 next