Approximate minimum degree ordering for symmetric sparse matrices. Includes routines for six variations of the algorithm, differing only by what type of degree (or approximation) is used to select the pivots. Type : Subprogram package Portability : Portable Availability : Some uses prohibited Language : Fortran Reference : Amestoy, Davis, and Duff, SIAM J. Matrix Analysis and Applications 17 (1996) pp. 886-905 Developer : Timothy Davis et al., University of Florida, Gainesville, Fl 32611 (davis@cis.ufl.edu). Distributor : netlib. (See linalg/amd subdirectory). On sites : (1) NETLIB
NETLIB : Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Version : 1996 Support : Unsupported You may access components from NETLIB outside GAMS as follows. Readme : Anonymous ftp from ftp.netlib.org in linalg/amd/readme
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Tue Sep 16, 2008 at 00:52:30 UTC