[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

411.0. "Lots of free math software" by PIXEL::PWONG () Wed Dec 18 1985 12:07

Received: from DECWRL by DEC-RHEA with SMTP; Wed, 18 Dec 85 09:00-PST
Received: from anl-mcs.ARPA by decwrl.DEC.COM (4.22.01/4.7.34)
	id AA00768; Wed, 18 Dec 85 09:00:44 pst
Received: by anl-mcs.ARPA (4.12/4.9)
	id AA19021; Wed, 18 Dec 85 10:57:48 cst
Date: Wed, 18 Dec 85 10:57:48 cst
Message-Id: <[email protected]>
Apparently-To: pwong%[email protected]

Caveat receptor.  (Jack) dongarra@anl-mcs, (Eric Grosse) research!ehg
Compliments of netlib   Wed Dec 18 10:57:39 CST 1985

I n d e x   f o r   N E T L I B

To examine the full index for any library send a request
to netlib of the form: 
  Send index from eispack

The default precision for the libraries will be double precision. 
If you would like the single precision version of the package, 
prefix the library name with an 's'. However, if the library 
only comes in only one precision that's what you will be sent.

To search for somebody in Gene Golub's address list:
  Who is Joan Doe?
displays entries containing "Joan" and "Doe".  (no spelling correction!)



EISPACK  A collection of Fortran subroutines that compute the eigenvalues 
         and eigenvectors of nine classes of matrices.  The package can 
         determine the eigensystems of complex general, complex Hermitian, 
         real general, real symmetric, real symmetric band, real symmetric 
         tridiagonal, special real tridiagonal, generalized real, and 
         generalized real symmetric matrices. In addition, there are two 
         routines which use the singular value decomposition to solve 
         certain least squares problems.
         Developed by the NATS Project at Argonne National Laboratory.
         (d.p. refer to eispack, s.p. refer to seispack)

FMM      Routines from the book Computer Methods for Mathematical
         Computations, by Forsythe, Malcolm, and Moler.
         Developed by George Forsythe, Mike Malcolm, and Cleve Moler.
         (d.p. refer to fmm, s.p. refer to sfmm)

FNLIB    Fullerton's special function library.
         Developed by Wayne Fullerton.
         (all precisions contained here)

LINPACK  A collection of Fortran subroutines that analyze and solve linear 
         equations and linear least squares problems.  The package solves 
         linear systems whose matrices are general, banded, symmetric 
         indefinite, symmetric positive definite, triangular, and tridiagonal 
         square.  In addition, the package computes the QR and singular value 
         decompositions of rectangular matrices and applies them to least 
         squares problems.
         Developed by Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart.
         (all precisions contained here)

MINPACK	 A package of Fortran programs for the solution of systems of 
         nonlinear equations and nonlinear least squares problems.
	 Five algorithmic paths each include a core subroutine and an 
         easy-to-use driver.  The algorithms proceed either from an analytic 
         specification of the Jacobian matrix or directly from the problem 
         functions.  The paths include facilities for systems of equations 
         with a banded Jacobian matrix, for least squares problems with a 
         large amount of data, and for checking the consistency of the 
	 Jacobian matrix with the functions.
	 Developed by Jorge More', Burt Garbow, and Ken Hillstrom at 
         Argonne National Laboratory.
         (d.p. refer to minpack, s.p. refer to sminpack)

FFTPACK  A package of Fortran subprograms for the Fast Fourier
         Transform of periodic and other symmetric sequences
         This package consists of programs which perform Fast Fourier
         Transforms for both complex and real periodic sequences and
         certian other symmetric sequences.
         Developed by Paul Swarztrauber, at NCAR.

FISHPACK A package of Fortran subprograms providing finite difference
         approximations for elliptic boundary value problems.
         Developed by Paul Swarztrauber and Roland Sweet.

QUADPACK A package for numerical computation of definite 
         one-dimensional integrals.
         Developed by Piessens, Robert(Appl. Math. and Progr. Div.- K.U.Leuven)
         de Donker, Elise(Appl. Math. and Progr. Div.- K.U.Leuven
         Kahaner, David(National Bureau of Standards)

TOEPLITZ A package of Fortran subprograms for the solution of systems 
         of linear equations with coefficient matrices of Toeplitz or
         circulant form, and for orthogonal factorization of column-
         circulant matrices.
	 Developed by Burt Garbow at Argonne National Laboratory,
         as a culmination of Soviet-American collaborative effort.
         (d.p. refer to toeplitz, s.p. refer to stoeplitz)

GO       Golden Oldies:  routines that have been widely used, 
         but aren't available through the standard libraries.
         Nominations welcome!

PPPACK   Subroutines from: Carl de Boor, A Practical Guide to Splines, 
         Springer Verlag.
         Caution.  This is an old version, from around the time the book 
         was first published.  We will install a newer version as soon 
         as we can.

ITPACK   Iterative Linear System Solver based on a number of methods:
         Jacobi method, SOR, SSOR with conjugate gradient acceleration 
         or with Chebyshev (semi-iteration - SI) acceleration.
         Developed by Young and Kincaid and the group at U of Texas.

BIHAR    Biharmonic solver in rectangular geometry
         Biharmonic solver in polar coordinates 
         These routines were obtained from Petter Bjorstad, 
         Veritas Research, Oslo Norway in July 1984.  

MISC     Contains various pieces of software collected over time.

TOMS     Collected algorithms of the ACM. When requesting a specific
         item, please refer to be Algorithm number.

LASO     A package computing a few eigenvalues of a large (sparse) 
         symmetric matrix.   
         Developed by David Scott University of Texas, Austin.

SCPACK   contains routines to solve the "parameter problem"
         associated with the Schwarz-Christoffel map (subroutine SCSOLV),
         to evaluate the resulting S-C map (WSC), and to evaluate its inverse
         (ZSC).  
         Developed by Llyod N. Trefethen, Courant Inst.
         (d.p. refer to scpack, s.p. refer to sscpack)

FITPACK  A package for splines under tension.
         This is an early version of some fitpack routines.  
         For a current copy and for other routines, contact:
         Alan Kaylor Cline 
         8603 Altus Cove, Austin, Texas 78759, USA

HARWELL  Currently contains on the sparse matrix routine MA28 from the
         Harwell library. contact:
         Iain Duff
         Computer Science & Systems Division
         AERE Harwell
         Didcot, Oxford OX11 ORA England

BENCHMARK contains various benchmark programs.

PORT  ===== public subset of the PORT library =====
         In general, contents of the PORT3 library are available by license.

CORE     Machine constants, blas

MACHINES contains information on high performance computers that
         are or soon to be made available

Y12M  calculation of the solution of systems of linear systems of
      linear algebra equations whose matrices are large and sparse.
      authors: Zahari Zlatev, Jerzy Wasniewski and Kjeld Schaumburg
      contact:
      Prof. Zahari Zlatev
      Computer Science Department
      Mathematical Institute
      University of Aarhus
      Ny Munkegade
      DK 8000 Aarhus C

PCHIP is a fortran package for piecewise cubic hermite inter-
     polation of data.  It features software to produce a monotone and
     "visually pleasing" interpolant to monotone data.  As is demon-
     strated in reference 1, such an interpolant may be more reasonable
     than a cubic spline if the data contains both "steep" and "flat"
     sections.  Interpolation of cumulative probability distribution
     functions is another application.
     Fred N. Fritsch
     Lawrence Livermore National Laboratory

LP      Linear Programming - At present, this consists of one subdirectory,
        data    a set of test problems in MPS format.
        For more information, try a request of the form
            send index for lp/data

ODEPACK The ODE package from Alan Hindmarch and others.
        This is the single precision verison to get dp refer to dodepack.
        Alan Hindmarch
        Lawrence Livermore National Laboratory

Coming soon:

SLATEC library
------------



T.RTitleUserPersonal
Name
DateLines
411.1For further info...PIXEL::PWONGPaul H. WongMon Aug 03 1987 11:297
    I got a few requests on further info on NETLIB.  I have none.
    The best way to find out more is to send mail to:

	nm%rhea::decwrl::"[email protected]"
	nm%rhea::decwrl::"[email protected]"

    - Paul
411.2New addressVMSDEV::HALLYBThe Smart Money was on GoliathSat Mar 10 1990 08:0914
                  <<< 2B::NOTES1:[NOTES$LIBRARY]MATH.NOTE;7 >>>
                            -< Mathematics at DEC >-
================================================================================
Note 1139.6               Mathematics Library from DEC?                   6 of 6
WSE049::KAMATH                                        7 lines   9-MAR-1990 20:38
                              -< netlib address >-
--------------------------------------------------------------------------------
    Netlib can be reached at [email protected]
    
    It used to be at Argonne earlier, but as Jack Dongarra moved to 
    Tennessee, it has moved with him.
    
    Chandrika.
    
411.3Can't get netlib indexCSC32::J_MARSHSvelte &amp; Petite-nosedThu Nov 01 1990 17:5813
I posted this in the GATEWAYS conference (808.3) but got no response.  Perhaps
someone in this conference knows the answer?...

I've been unable to get netlib to send me the index (I've tried several
times now).  Could someone tell me what I'm doing wrong?  (Perhaps I need
to say "please"?  :-)  Here's the last mail I sent to it:

From:	CSC32::J_MARSH      "Svelte & Petite-nosed" 19-OCT-1990 10:05:16.84
To:	DECWRL::"[email protected]"
CC:	J_MARSH
Subj:	send index

send index
411.4GUESS::DERAMODan D&#039;EramoThu Nov 01 1990 18:5310
From:	CSC32::J_MARSH      "Svelte & Petite-nosed" 19-OCT-1990 10:05:16.84

	It wouldn't hurt when sending mail outside Digital
	to change your p.n. to a return address, e.g.,

		[email protected]

	However, in this case I doubt that it would help, either.

	Dan
411.5Works fine for me.CADSYS::COOPERTopher CooperFri Nov 02 1990 11:31501
I just tried it, using exactly the same format you did, except that I used
a blank subject line (I don't know whether that made a difference).  For
reference, the reply is posted below -- Please note that this will go out
of date and repeating the request to get an update is advisable.  This will
give a feel for what is there, however.

What were they symptoms of your failure?  Did the mail not "go through"
(bad timing) or did you not get a reply (bad timing again, or your return
address was misconstructed somehow), or something else?

			    Topher
------------------------------------------------------------------------------- 
===== general NETLIB index =====
 
Welcome to netlib, a system for distribution of mathematical software
by electronic mail.  This index is the reply you'll get to:
	mail [email protected]
	send index.
To examine the full index for any library send a request of the form:
	send index from eispack.
To search for all software with certain keywords:
	find cubic spline.
To search for somebody in Gene Golub's address list:
	Who is Joan Doe?
displays entries containing "Joan" and "Doe".  (no spelling correction!)
You may include several requests in a single piece of mail, but put
each on a separate line.
 
Here are some additional forms a request may take...
send dgeco from linpack
  (Retrieves routine DGECO and all routines it calls from the LINPACK library.)
send only dgeco from linpack
  (Retrieves just DGECO and not subsidiary routines.)
send dgeco but not dgefa from linpack
  (Retrieves DGECO and subsidiaries, but excludes DGEFA and subsidiaries.)
send list of dgeco from linpack
  (Retrieves just the file names rather than the contents;
  this can be helpful when one already has an entire library and just
  wants to know what pieces are needed in a particular application.)
 
Send the requests to "[email protected]" even though replies appear to be
coming from "[email protected]".  You'll be talking to a program, so don't
expect it to understand much English.  If your Unix system doesn't talk
directly to research (AT&T Bell Labs in Murray Hill, New Jersey), you might
try forwarding through ihnp4 (Bell Labs in Chicago) or mcvax (Math Centrum
in Amsterdam).  Someone will be paying for long distance phone calls, so be
reasonable!  Those with access to the arpanet can use [email protected] (at
Oak Ridge National Labs).  For an introduction to the mysteries of networks
and address syntax, see J. Quarterman and J. Hoskins, Comm. ACM (Oct 1986)
29,932-971.  For background about netlib, see Jack J. Dongarra and Eric
Grosse, Distribution of Mathematical Software Via Electronic Mail, Comm.
ACM (1987) 30,403--407.
 
The default precision is double; to get single, prefix the library name
with "s".  However, if the library only comes in one precision, that's what
you will be sent.  To save space we remove sequence numbers and maintain a
central set of machine dependent constants. Otherwise the codes, which are
almost all in Fortran, are as received from the authors.  Bugs found in
core libraries like eispack will receive prompt attention; in general, we
will forward comments (and annual lists of recipients) to the code authors.
Many of these codes are designed for use by professional numerical analysts
who are capable of checking for themselves whether an algorithm is suitable
for their needs.  One routine can be superb and the next awful.  So be
careful!
 
-------quick summary of contents---------
a - approximation algorithms  (almost empty, but soon to grow)
alliant - set of programs collected from Alliant users
apollo - set of programs collected from Apollo users
benchmark - various benchmark programs and a summary of timings
bihar - Bjorstad's biharmonic solver
bmp - Brent's multiple precision package
cheney-kincaid - programs from the text Numerical Mathematics and Computing.
conformal - Schwarz-Christoffel codes by Trefethen; Bjorstad+Grosse
core - machine constants, Level 1, 2, and 3 BLAS
domino - communication and scheduling of multiple tasks; Univ. Maryland
eispack - matrix eigenvalues and vectors
elefunt - Cody and Waite's tests for elementary functions
errata - corrections to numerical books
fishpack - separable elliptic PDEs; Swarztrauber and Sweet
fitpack - Cline's splines under tension
fftpack - Swarztrauber's Fourier transforms
fmm - software from the book by Forsythe, Malcolm, and Moler
fn - Fullerton's special functions
gcv - Generalized Cross Validation
go - "golden oldies"  gaussq, zeroin, lowess, ...
graphics - ray-tracing
harwell - MA28 sparse linear system
hompack - nonlinear equations by homotopy method
itpack - iterative linear system solution by Young and Kincaid
lanczos - Cullum and Willoughby's Lanczos programs
laso - Scott's Lanczos program for eigenvalues of sparse matrices
linpack - gaussian elimination, QR, SVD  by Dongarra, Bunch, Moler, Stewart
lp - linear programming
machines - short descriptions of various computers
matlab - software from the MATLAB user's group
microscope - Alfeld and Harris' system for discontinuity checking
minpack - nonlinear equations and least squares by More, Garbow, Hillstrom
misc - everything else
na-digest - archive of mailings to NA distribution list
napack - numerical algebra programs
ode - ordinary differential equations
odepack - ordinary differential equations from Hindmarsh
paranoia - Kahan's floating point test
pchip - hermite cubics  Fritsch+Carlson
picl - portable instrumented communication library for multiprocessors
pltmg - Bank's multigrid code;  too large for ordinary mail
polyhedra - Hume's database of geometric solids
port - the public subset of PORT library
pppack - subroutines from de Boor's Practical Guide to Splines
quadpack - univariate quadrature by Piessens, de Donker, Kahaner
siam - typesetting macros for SIAM journal format
slatec - machine constants and error handling package from the Slatec library
sparse - a set of c codes for sparse systems of equations
sparspak - George + Liu, sparse linear algebra core
specfun - transportable special functions
toeplitz - linear systems in Toeplitz or circulant form by Garbow
toms - Collected Algorithms of the ACM
vfftpk - A vectorized package of Fortran for fast Fourier transform 
y12m - sparse linear system  (Aarhus)
 
--------a bit more detail--------
 
The first few libraries here are widely regarded as being of high quality.
The likelihood of your encountering a bug is relatively small; if you do,
we certainly want to hear about it!
 
CORE    Machine constants (i1mach,r1mach,d1mach), blas (level 1, 2 and 3)
 
EISPACK  A collection of Fortran subroutines that compute the eigenvalues 
	and eigenvectors of nine classes of matrices.  The package can 
	determine the eigensystems of complex general, complex Hermitian, 
	real general, real symmetric, real symmetric band, real symmetric 
	tridiagonal, special real tridiagonal, generalized real, and 
	generalized real symmetric matrices. In addition, there are two 
	routines which use the singular value decomposition to solve 
	certain least squares problems.
	Developed by the NATS Project at Argonne National Laboratory.
	(d.p. refer to eispack, s.p. refer to seispack)
 
FFTPACK A package of Fortran subprograms for the Fast Fourier
	Transform of periodic and other symmetric sequences
	This package consists of programs which perform Fast Fourier
	Transforms for both complex and real periodic sequences and
	certian other symmetric sequences.
	Developed by Paul Swarztrauber, at NCAR.
 
FISHPACK A package of Fortran subprograms providing finite difference
	approximations for elliptic boundary value problems.
	Developed by Paul Swarztrauber and Roland Sweet.
 
FNLIB   Wayne Fullerton's special function library. (single and double)
 
GO      Golden Oldies:  routines that have been widely used, 
	but aren't available through the standard libraries.
	Nominations welcome!
 
HARWELL  Sparse matrix routine MA28 from the Harwell library.  from Iain Duff
 
LINPACK  A collection of Fortran subroutines that analyze and solve linear 
	equations and linear least squares problems.  The package solves 
	linear systems whose matrices are general, banded, symmetric 
	indefinite, symmetric positive definite, triangular, and tridiagonal 
	square.  In addition, the package computes the QR and singular value 
	decompositions of rectangular matrices and applies them to least 
	squares problems.
	Developed by Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart.
	(all precisions contained here)
 
PPPACK  Subroutines from: Carl de Boor, A Practical Guide to Splines, 
	Springer Verlag. This is an old version, from around the time the book 
	was published.  We will install a newer version as soon as we can.
 
TOMS    Collected algorithms of the ACM. When requesting a specific
	item, please refer to the Algorithm number.
 
----------------
 
In contrast to the above libraries, the following are collections of codes
from a variety of sources.  Most are excellent, but you should exercise
caution.  We include research codes that we haven't tested and codes
that may not be state-of-the-art but useful for comparisons.
The following list is chronological, not by merit:
 
MISC    Contains various pieces of software collected over time and:
	the source code for the netlib processor itself;
	the paper describing netlib and its implementation;
	the abstracts list maintained by Richard Bartels.
 
FMM      Routines from the book Computer Methods for Mathematical
	Computations, by Forsythe, Malcolm, and Moler.
	Developed by George Forsythe, Mike Malcolm, and Cleve Moler.
	(d.p. refer to fmm, s.p. refer to sfmm)
 
QUADPACK A package for numerical computation of definite univariate integrals.
	Developed by Piessens, Robert(Appl. Math. and Progr. Div.- K.U.Leuven)
	de Donker, Elise(Appl. Math. and Progr. Div.- K.U.Leuven
	Kahaner, David(National Bureau of Standards)      (slatec version)
 
TOEPLITZ A package of Fortran subprograms for the solution of systems 
	of linear equations with coefficient matrices of Toeplitz or
	circulant form, and for orthogonal factorization of column-
	circulant matrices.
	 Developed by Burt Garbow at Argonne National Laboratory,
	as a culmination of Soviet-American collaborative effort.
	(d.p. refer to toeplitz, s.p. refer to stoeplitz)
 
ITPACK   Iterative linear system solvers for symmetric and nonsymmetric
         sparse problems.  Includes ITPACK 2C (single and double
         precision), ITPACKV 2C (vectorized version of ITPACK 2C),    
         and NSPCG.  Developed by Young and Kincaid and the group at
         U of Texas.
 
BIHAR   Biharmonic solver in rectangular geometry and polar coordinates.
	These routines were obtained from Petter Bjorstad, 
	Veritas Research, Oslo Norway in July 1984.  
 
LANCZOS procedures computing a few eigenvalues/eigenvectors of a large (sparse) 
	symmetric matrix.  Jane Cullum and Ralph Willoughby, IBM Yorktown.
	
LASO    A competing Lanczos package.  David Scott.
 
CONFORMAL   contains routines to solve the "parameter problem" associated
	with the Schwarz-Christoffel mapping.  Includes:
	SCPACK (polygons with straight sides) from Nick Trefethen.
	CAP (circular arc polygons) from Petter Bjorstad and Eric Grosse.
 
FITPACK  A package for splines under tension.  (an early version)
	For a current copy and for other routines, contact:
	Alan Kaylor Cline, 8603 Altus Cove, Austin, Texas 78759, USA
 
BENCHMARK contains benchmark programs and the table of Linpack timings.
 
MACHINES contains information on high performance computers that
	are or soon to be made available
 
MINPACK	A package of Fortran programs for the solution of systems of 
	nonlinear equations and nonlinear least squares problems.
	Five algorithmic paths each include a core subroutine and an 
	easy-to-use driver.  The algorithms proceed either from an analytic 
	specification of the Jacobian matrix or directly from the problem 
	functions.  The paths include facilities for systems of equations 
	with a banded Jacobian matrix, for least squares problems with a 
	large amount of data, and for checking the consistency of the 
	Jacobian matrix with the functions.
	Developed by Jorge More', Burt Garbow, and Ken Hillstrom at 
	Argonne National Laboratory.
	(d.p. refer to minpack, s.p. refer to sminpack)
 
PORT    The public subset of the PORT library.  Includes the latest version
	of Gay's NL2SOL nonlinear least squares. The rest of the PORT3
	library is available by license from AT&T.
 
Y12M  calculation of the solution of systems of linear systems of
	linear algebra equations whose matrices are large and sparse.
	authors: Zahari Zlatev, Jerzy Wasniewski and Kjeld Schaumburg
 
PCHIP is a fortran package for piecewise cubic hermite inter-
	polation of data.  It features software to produce a monotone and
	"visually pleasing" interpolant to monotone data.
	Fred N. Fritsch, Lawrence Livermore National Laboratory
 
LP      Linear Programming - At present, this consists of one subdirectory,
	data: a set of test problems in MPS format, maintained by David Gay.
	For more information, try a request of the form
	send index for lp/data
 
ODE	various initial and boundary value ordinary differential equation
	solvers: colsys, dverk, rkf45, ode
	A subset of these in single precision is in the library sode.
 
ODEPACK The ODE package from Hindmarch and others.
	This is the double precision verison; to get sp refer to sodepack.
	Alan Hindmarch, Lawrence Livermore National Laboratory
 
ELEFUNT is a collection of transportable Fortran programs for testing
	the elementary function programs provided with Fortran compilers.  The
	programs are described in detail in the book "Software Manual for the 
	Elementary Functions" by W. J. Cody and W. Waite, Prentice Hall, 1980.
 
SPECFUN is an incomplete, but growing, collection of transportable
	Fortran programs for special functions, and of accompanying test
	programs similar in concept to those in ELEFUNT.
	W.J. Cody, Argonne National Laboratory
 
PARANOIA is a rather large program, devised by Prof. Kahan of Berkeley,
	to explore the floating point system on your computer.
 
SLATEC library    DoE policy apparently prohibits us from distributing this.
	Contact the National Energy Software Center or your congressman.
 
HOMPACK is a suite of FORTRAN 77 subroutines for solving nonlinear systems
	of equations by homotopy methods.  There are subroutines for fixed
	point, zero finding, and general homotopy curve tracking problems,
	utilizing both dense and sparse Jacobian matrices, and implementing
	three different algorithms: ODE-based, normal flow, and augmented
	Jacobian.  
 
DOMINO is a set of C-language routines with a short assembly language
       interface that allows multiple tasks to communicate and schedules 
       local tasks for execution.  These tasks may be on a single processor 
       or spread among multiple processors connected by a message-passing 
       network.  (O'Leary, Stewart, Van de Geijn, University of Maryland) 
 
GCV    software for Generalized Cross Validation, from: Woltring, 
       (univariate spline smoothing ); Bates, Lindstrom, Wahba and Yandell 
       (multivariate thin plate spline smoothing and ridge regression).
 
Cheney-Kincaid  programs from: Ward Cheney & David Kincaid, Numerical
       Mathematics and Computing.
 
POLYHEDRA    a database of angles, vertex locations, and so on for over a
       hundred geometric solids, compiled by Andrew Hume.
 
GRAPHICS    presently just contains some C routines for testing ray-tracing
 
A      approximation algorithms  (almost empty, but soon to grow)
    lowess:   multivariate smoothing of scattered data; Cleveland+Devlin+Grosse
 
Apollo  A set of programs collected from Apollo users.
 
Alliant A set of programs collected from Alliant users.
 
parmacs	-  parallel programmming macros for monitors and send/receive
      Rusty Lusk, Argonne National Laboratory, June 5, 1987 ([email protected])
 
sched - The Schedule Package is an environment for the transportable 
        implementation of parallel algorithms in a Fortran setting.  
        Jack Dongarra and Dan Sorensen, Univ of Tenn. and Rice Univ., 
        June 5, 1987 ([email protected] [email protected])
 
NAPACK  A collection of Fortran subroutines to solve linear systems,
        to estimate the condition number or the norm of a matrix,
        to compute determinants, to multiply a matrix by a vector,
        to invert a matrix, to solve least squares problems, to perform
        unconstrained minimization, to compute eigenvalues, eigenvectors,
        the singular value decomposition, or the QR decomposition.
        The package has special routines for general, band, symmetric,
        indefinite, tridiagonal, upper Hessenberg, and circulant matrices.
        Code author: Bill Hager, Mathematics Department, Penn State
        University, University Park, PA 16802, e-mail: [email protected]
        or [email protected]. Related book: Applied Numerical Linear
        Algebra, Prentice-Hall, Englewood Cliffs, New Jersey.
        Book scheduled to appear in December, 1987.
 
SPARSPAK  Subroutines from the book "Computer Solution of Large Sparse
        Positive Definite Systems" by George and Liu, Prentice Hall 1981.
 
Sparse  A library of subroutines written in C that solve large sparse
        systems of linear equations using LU factorization.  The
        package is able to handle arbitrary real and complex square
        matrix equations.  Besides being able to solve linear systems,
        it is solves transposed systems, find determinants, multiplies
        a vector by a matrix, and estimate errors due to
        ill-conditioning in the system of equations and instability in
        the computations.  Sparse does not require or assume symmetry
        and is able to perform numerical pivoting (either diagonal or
        complete) to avoid unnecessary error in the solution.  Sparse
        also has an optional interface that allow it to be called from
        FORTRAN programs.
	Ken Kundert, Alberto Sangiovanni-Vincentelli. ([email protected])
 
SLAP This is  the official release version  2.0  of the  Sparse Linear
     Algebra Package:  a  SLAP for the   Masses!  It  contains  "core"
     routines for the  iterative solution symmetric  and non-symmetric
     positive  definite  and positive  semi-definite  linear  systems.
     Included in  this package  are  core routines  to   do  Iterative
     Refinement    iteration,   Preconditioned    Conjugate   Gradient
     iteration,  Preconditioned Conjugate Gradient   iteration on  the
     Normal Equations,  Preconditioned BiConjugate Gradient iteration,
     Preconditioned BiConjugate Gradient  Squared iteration,  Orthomin
     iteration  and  Generalized  Minimum  Residual  iteration.   Core
     routines  require the   user  to supply  "MATVEC"  (Matrix Vector
     Multiply) and "MSOLVE" (Preconditiong) routines.  This allows the
     core routines to be written in a way  that makes them independent
     of the matrix data  structure.  For each  core routine  there are
     several  drivers and support  routines  that allow   the user  to
     utilize  Diagonal Scaling and  Incomplete Cholesky/Incomplete  LU
     factorization as preconditioners with no  coding.   The price for
     this  convience is that one  must use the  a specific matrix data
     structure: SLAP Column or SLAP Triad format.
        Written by Mark K. Seager & Anne Greenbaum
 
problem-set: This set of directories is a collection of problems for 
             automated theorem provers.  It is partioned by subject.
             Larry Wos, Argonne National Laboratory
 
sequent software from the Sequent Users Group.
      Jack Dongarra 9/88
 
UNCON/DATA test problems: unconstrained optimization, nonlinear least squares.
	Problems from More, Garbow, and Hillstrom;  Fraley, matrix square
	root;  Hanson, Salane;  McKeown;  De Villiers and Glasser;
	Dennis, Gay, and Vu.   Collected by Chris Fraley.
 
JAKEF is a precompiler that analyses a given Fortran77 source code for
     the evaluation of a scalar or vector function and then generates an
     expanded Fortran subroutine that simultaneously evaluates the gradient
     or Jacobian respectively. 
     A. Griewank, Argonne National Laboratory, [email protected], 12/1/88.
 
sparse-blas an extension to the set of Basic Linear Algebra Subprograms.
     The extension is targeted at sparse vector operations, with the goal of
     providing efficient, but portable, implementations of algorithms for high
     performance computers.
     [email protected] Mon Aug 31 19:53:21 1987 (Dave Dodson)
 
voronoi - compute Voronoi diagram or Delaunay triangulation.
     From research!sjf Thu May  5 14:09:33 EDT 1988
 
matlab - software from the MATLAB Users Group.
     Christian Bischof [email protected] 12/89
 
picl - is a subroutine library that implements a generic message-passing
       interface for a variety of multiprocessors. It also provides
       timestamped trace data, if requested.
       authors: Geist, Heath, Peyton, and Worley, Oak Ridge National Lab.
       [email protected] 4/17/90.
   
parallel - a directory containing information on parallel processing and
       high-performance computing.
 
 
MADPACK is a a compact package for solving systems of linear equations using
       multigrid or aggregation-disaggregation methods.  Imbedded in 
       the algorithms are implementations for sparse Gaussian elimination 
       and symmetric Gauss-Seidel (unaccelerated or accelerated by 
       conjugate gradients or Orthomin(1)).  This package is particularly 
       useful for solving problems which arise from discretizing partial 
       differential equations, regardless of whether finite
       differences, finite elements, or finite volumes are used.
       It was written by Craig Douglas.
 
 
ParaGraph - a graphical display system for visualizing the behavior of
            parallel algorithms on message-passing multiprocessor architectures.
            Authors: Jennifer Etheridge and Michael Heath, Oak Ridge National Lab.
            [email protected], 4/19/90.
 
NAPACK  A collection of Fortran subroutines to solve linear systems,
        to estimate the condition number or the norm of a matrix,
        to compute determinants, to multiply a matrix by a vector,
        to invert a matrix, to solve least squares problems, to perform
        unconstrained minimization, to compute eigenvalues, eigenvectors,
        the singular value decomposition, or the QR decomposition.
        The package has special routines for band, symmetric,
        indefinite, tridiagonal, upper Hessenberg, and circulant matrices.
        Code author: Bill Hager, Mathematics Department, University of
        Florida, Gainesville, FL 32611, e-mail: [email protected].
        Related book: Applied Numerical Linear Algebra, Prentice-Hall,
        Englewood Cliffs, New Jersey, 1988.
 
GMAT -
From Mark Seager (LLNL Oct 8, 1987)
 
stategraph.shar This shar file contains the source code for the GMAT
        Stategraph analysis tool.  This tool will analyze multiproces-
        sing trace files generated by the Cray Compatibility library
        on the Alliant FX/8.  The input file specification is very
        similar to that for MTDUMP from Cray Research.
 
timeline.shar   This shar file contains the source code for the GMAT
        Timeline analysis tool.  This tool will assist the user in a
        time based analysis of multiprocessing trace files generated
        by the Cray Compatibility library on the Alliant FX/8.  The
        input file specification is very similar to that for MTDUMP
        from Cray Research.
 
gmat.shar       This shar file contains documentation the GMAT multi-
        processing Time Line and State Graph tools.  It also includes
        some (compaced and uuencoded) sample trace files for use with
        the tools.
 
vfftpk - A vectorized package of Fortran subprograms for the
           fast Fourier transform of multiple real sequences
 
FORTRAN    contains tools specific to Fortran.
        At present, it contains a single-double precision converter.
 
TYPESETTING  troff and LaTeX macros, mostly written at Bell Labs.  Also,
        AMS-TeX macros by Arnold, Lucier, and SIAM.
 
C++   miscellaneous codes in the C++ language.   At present this includes
        Hansen's C++ Answer Book.
 
OPT     miscellaneous optimization software.  Contains Brent's praxis.
 
                                                                       
BIB     bibliographies:  Golub and Van Loan, 2nd ed.
 
 
 
% ====== Internet headers and postmarks (see DECWRL::GATEWAY.DOC) ======
Received: by decpa.pa.dec.com; id AA11902; Fri, 2 Nov 90 08:22:15 -0800
Received: by surfer.EPM.ORNL.GOV (5.61/1.34)
	id AA04149; Fri, 2 Nov 90 11:21:54 -0500
Date: Fri, 2 Nov 90 11:21:54 -0500
From: [email protected] (Netlib)
Message-Id: <[email protected]>
To: cadsys::cooper
Subject: send index
411.6CSC32::J_MARSHSvelte &amp; Petite-nosedFri Nov 02 1990 12:2111
RE: .5

� What were they symptoms of your failure?  Did the mail not "go through"
� (bad timing) or did you not get a reply (bad timing again, or your return
� address was misconstructed somehow), or something else?

I got no errors from the send, I just never received any reply.  It has worked
for me in the past, I last got stuff from netlib on 28-SEP-1989.

I've tried again with a blank subject line and my return address in the
personal name field.  We'll see if it works this time.  Thanks for the replies!
411.7FORTY2::TATHAMNick Tatham @REOTue Nov 06 1990 03:4810
I'm also having trouble sending to DECWRL::"[email protected]". I can send
the mail successfully but I never get a response. I've tried blank subject
lines. I tried the same with the stats lib and that worked so the method
must be right.

Any ideas why there is a problem for some people?

Nick

411.8utk == University of Tennessee, KnoxvilleVMSDEV::HALLYBThe Smart Money was on GoliathTue Nov 06 1990 09:538
    I too am having trouble getting responses.
    
    Jack Dongarra can be reached at DECWRL::"[email protected]"
    
    Perhaps someone who is in dire need can send him mail and ask him
    if netlib is getting requests OK.
    
      John
411.9try the bell labs gateway if oak ridge failsALLVAX::JROTHIt&#039;s a bush recording...Tue Nov 06 1990 17:275
    There are quite a few other ways to access netlib, for example

	[email protected]

     - Jim
411.10FORTY2::TATHAMNick Tatham @REOFri Nov 09 1990 03:4312
Re -.1

Thanks, Jim

	[email protected]

did the trick, I have what I wanted. Thanks for the help.

Nick