A collection of numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse matrices. Implements Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left- and right-singular vectors). has been ported to a variety of machines ranging from supercomputers to workstations: CRAY Y-MP, SPARC 10, IBM RS/6000, DEC 5000, and HP 9000. Type : Subprogram package Portability : Portable Availability : Public domain Language : Fortran Reference : M. Berry, Large Scale Singular Value Computations, International Journal of Supercomputer Applications, 6:1 (1992), pp. 13-49 Developer : Michael W. Berry, University of Tennessee at Knoxville, berry@cs.utk.edu Distributor : netlib. (See svdpack subdirectory). On sites : (1) NETLIB
NETLIB : Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Version : 1991 Support : Unsupported You may access components from NETLIB outside GAMS as follows. Readme : Anonymous FTP from ftp.netlib.org in svdpack/readme Documentation : Anonymous FTP from ftp.netlib.org in svdpack/ijsa.ps
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:49:32 UTC