MC21A: a subroutine for finding a row permutation for a zero-free diagonal. That is, given the pattern of nonzeros of a sparse matrix, this routine attempts to find a permutation of its rows that makes the matrix have no zeros on its diagonal. (See I.S. Duff, ACM TOMS 7 (1981) pp. 387-390.). Classes : D2e . Operations associated with the solution of systems of linear equations, including matrix inverses, and LU and related factorizations (e.g., matrix reorderings) Type : Fortran software in TOMS collection. Access : Some uses prohibited. Portable. Precision: Single. Usage : CALL MC21A (N, ICN, LICN, IP, LENR, IPERM, NUMNZ, IW) Details : Fullsource Sites : (1) NETLIB
NETLIB: Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Precision: Single. You may access components from NETLIB outside GAMS as follows. Fullsource : echo "send 575 from toms" | mail netlib@ornl.gov
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 Sat Sep 20, 2008 at 07:02:54 UTC