Algorithm 837: AMD, an approximate minimum degree ordering algorithm

被引：200
|
作者：
Amestoy, PR
Enseeiht-Irit
Davis, TA
Duff, IS
机构：
[1] Univ Florida, Dept Comp Sci & Informat Sci & Engn, Gainesville, FL USA
[2] Rutherford Appleton Lab, Didcot OX11 0QX, Oxon, England
[3] Stanford Univ, Stanford, CA 94305 USA
来源：
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2004年 / 30卷 / 03期
关键词：
D O I：
10.1145/1024074.1024081
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：381 / 388
页数：8
相关论文
共 50 条
  • [1] An approximate minimum degree ordering algorithm
    Amestoy, PR
    Davis, TA
    Duff, IS
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1996, 17 (04) : 886 - 905
  • [2] A column approximate minimum degree ordering algorithm
    Davis, TA
    Gilbert, JR
    Larimore, SI
    Ng, EG
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2004, 30 (03): : 353 - 376
  • [3] THE EVOLUTION OF THE MINIMUM DEGREE ORDERING ALGORITHM
    GEORGE, A
    LIU, JWH
    [J]. SIAM REVIEW, 1989, 31 (01) : 1 - 19
  • [4] COMPRESSED GRAPHS AND THE MINIMUM DEGREE ALGORITHM
    ASHCRAFT, C
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (06): : 1404 - 1411
  • [5] A Simple Algorithm for Submodular Minimum Linear Ordering
    Katzelnick, Dor
    Schwartzt, Roy
    [J]. 2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 28 - 35
  • [6] A MINIMAL STORAGE IMPLEMENTATION OF THE MINIMUM DEGREE ALGORITHM
    GEORGE, A
    LIU, JWH
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1980, 17 (02) : 282 - 299
  • [7] The Reverse Loop Subdivision Algorithm on Approximate Minimum Error
    Ma, Boning
    Kong, Longxing
    Tang, Xiaoan
    Kuang, Gangyao
    [J]. PROCEEDINGS OF 2013 CHINESE INTELLIGENT AUTOMATION CONFERENCE: INTELLIGENT INFORMATION PROCESSING, 2013, 256 : 811 - 818
  • [8] THE MINIMUM DEGREE ORDERING WITH CONSTRAINTS
    LIU, JWH
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1989, 10 (06): : 1136 - 1145
  • [9] A distributed approximation algorithm for the minimum degree minimum weight spanning trees
    Lavault, Christian
    Valencia-Pabon, Mario
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2008, 68 (02) : 200 - 208
  • [10] Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering
    Pellegrini, F
    Roman, J
    Amestoy, P
    [J]. CONCURRENCY-PRACTICE AND EXPERIENCE, 2000, 12 (2-3): : 69 - 84
12345