C++ templated library of modern iterative methods for solving symmetric and nonsymmetric linear systems. Templates allow the same source code to work for dense, sparse, and distributed matrices. Includes Richardson and Chebyshev Iteration, Conjugate Gradient, Conjugate Gradient Squared (CGS), BiConjugate Gradient (BiCG), BiConjugate Gradient Stabilized (BiCGSTAB), Generalized Minimum Residual (GMRES), and Quasi-Minimal Residual (QMR) without lookahead. Type : Subprogram package Portability : Portable Availability : Public domain Language : C++ Reference : IML++ Home Page Developer : R. Pozo, K. Remington, A. Lumsdaime and J. Dongarra Distributor : R. Pozo (pozo@cam.nist.gov), via anonymous ftp from math.nist.gov. or via the IML++ Home Page On sites : (1) ITL
ITL : Unix Workstation Network, National Institute of Standards and Technology (NIST), Gaithersburg, MD. Available to NIST staff. Version : 1.2 Support : Unsupported Access available only to NIST staff on internal Unix systems. They may access this package provided the /itl tree is cross-mounted. Source : Anonymous ftp from math.nist.gov in /pub/pozo/src Documentation : Anonymous ftp from math.nist.gov in /pub/pozo/docs Paper : Anonymous ftp from math.nist.gov in /pub/pozo/papers/sparse.ps.Z Examples : Anonymous ftp from math.nist.gov in /pub/pozo/src
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 09:38:16 UTC