Algorithm 837-Reference-Cited by-同舟云学术

Algorithm 837

Published:2004-09 Issue:3 Volume:30 Page:381-388
ISSN:0098-3500
Container-title:ACM Transactions on Mathematical Software
language:en
Short-container-title:ACM Trans. Math. Softw.

Author:

Amestoy Patrick R.¹,Davis Timothy A.²,Duff Iain S.³

Affiliation:

1. Enseeiht-Irit

2. University of Florida, Gainesville, FL

3. CERFACS and Rutherford Appleton Laboratory, Oxon, England

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Link

https://dl.acm.org/doi/pdf/10.1145/1024074.1024081

Reference9 articles.

1. An Approximate Minimum Degree Ordering Algorithm

2. A column approximate minimum degree ordering algorithm

3. The Evolution of the Minimum Degree Ordering Algorithm

4. Improving the Run Time and Quality of Nested Dissection Ordering

Cited by 193 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ginkgo - A math library designed to accelerate Exascale Computing Project science applications;The International Journal of High Performance Computing Applications;2024-08-20

2. A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting;Journal of Physics A: Mathematical and Theoretical;2024-07-01

3. Convergent Authalic Energy Minimization for Disk Area-Preserving Parameterizations;Journal of Scientific Computing;2024-06-25

4. Monte Carlo on manifolds in high dimensions;Journal of Computational Physics;2024-06

5. A survey on convex optimization for guidance and control of vehicular systems;Annual Reviews in Control;2024