An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
SIAM Journal on Matrix Analysis and Applications
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Improving the Run Time and Quality of Nested Dissection Ordering
SIAM Journal on Scientific Computing
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Algorithm 849: A concise sparse Cholesky factorization package
ACM Transactions on Mathematical Software (TOMS)
Deployment of parallel direct sparse linear solvers within a parallel finite element code
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
ACM Transactions on Mathematical Software (TOMS)
On the design of interfaces to sparse direct solvers
ACM Transactions on Mathematical Software (TOMS)
Analysis and Comparison of Reordering for Two Factorization Methods (LU and WZ) for Sparse Matrices
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
SBA: A software package for generic sparse bundle adjustment
ACM Transactions on Mathematical Software (TOMS)
An out-of-core sparse Cholesky solver
ACM Transactions on Mathematical Software (TOMS)
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
Efficient methods for large resistor networks
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems
ACM Transactions on Mathematical Software (TOMS)
Sparse non-linear least squares optimization for geometric vision
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
SIAM Journal on Scientific Computing
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
ACM Transactions on Mathematical Software (TOMS)
Harmonic response computation of viscoelastic multilayered structures using a ZPST shell element
Computers and Structures
Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing
Direct sparse factorization of blocked saddle point matrices
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Implicit solutions with consistent additive and multiplicative components
Finite Elements in Analysis and Design
Sparse LU factorization for parallel circuit simulation on GPU
Proceedings of the 49th Annual Design Automation Conference
Harmonic response computation of poroelastic multilayered structures using ZPST shell elements
Computers and Structures
Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB
ACM Transactions on Mathematical Software (TOMS)
Power system probabilistic and security analysis on commodity high performance computing systems
HiPCNA-PG '13 Proceedings of the 3rd International Workshop on High Performance Computing, Networking and Analytics for the Power Grid
| Hi-index | 0.01 |
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.