From: gaertner@rz-berlin.mpg.de
Subject: LAPACK availability !
Date: 9 Mar 92 15:47:05 +0100

The following information just appeared on na-net; I removed the infos not
relating to LAPACK.
Hope that it will answer all LAPACK questions.

Ralf

~~~~~~~~~~~~~~~~~

  Ralf Gaertner            gaertner@rz-berlin.mpg.de
  FHI Berlin

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


NA Digest   Sunday, March 8, 1992   Volume 92 : Issue 10

Today's Editor:

    Cleve Moler
    The MathWorks, Inc.
    moler@mathworks.com

Today's Topics:

    LAPACK is Now Available

Submissions for NA Digest:
    Mail to na.digest@na-net.ornl.gov.

Information about NA-NET:
    Mail to na.help@na-net.ornl.gov.

-------------------------------------------------------

From: Jack Dongarra <dongarra@cs.utk.edu>
Date: Fri, 6 Mar 92 12:36:44 -0500
Subject: LAPACK is Now Available

            ( L   A    P    A    C    K )
            ( L  -A    P   -A    C   -K )
            ( L   A    P    A   -C   -K )
            ( L  -A    P   -A   -C    K )
            ( L   A   -P   -A    C    K )
            ( L  -A   -P    A    C   -K )

LAPACK is a transportable library of Fortran 77 subroutines for
solving the most common problems in numerical linear algebra: systems
of linear equations, linear least squares problems, eigenvalue problems,
and singular value problems. It has been designed to be efficient
on a wide range of modern high-performance computers.

LAPACK is intended to be the successor to LINPACK and EISPACK.
It extends the functionality of these packages by including driver
routines, iterative refinement and error bounds for linear systems, the
capability for finding selected eigenvalues and invariant subspaces, and
condition estimation for the eigenproblem.  LAPACK improves on the accuracy
of standard algorithms for linear systems, for finding singular values and
singular vectors of bidiagonal matrices, and for finding eigenvalues and
eigenvectors of tridiagonal matrices.  The algorithms and software in the
package have been restructured to achieve high efficiency on vector processors,
high-performance ``superscalar'' workstations, and shared memory
multiprocessors. In addition to the LAPACK routines, comprehensive
testing and timing suite is provided along with the LAPACK software.

The LAPACK Users' Guide will be available from SIAM in or around May, 1992.
The Users' Guide gives an informal introduction to the design of the algorithms
and software, summarizes the contents of the package, describes conventions
used in the software and documentation, and includes complete specifications
for calling the routines.

The LAPACK routines are available from netlib for users who require only
selected pieces of the package.
For a description of the contents of LAPACK, send email to
netlib@ornl.gov, and in the mail message type: send index from lapack.
A set of working notes are available from netlib as well and details
can be found in the index to LAPACK.

The complete LAPACK package can be obtained on magnetic media from NAG for a
nominal handling charge. For further details, contact NAG at one of these
addresses:

NAG Inc                       NAG Ltd              NAG GmbH
1400 Opus Place               Wilkinson House      Schleissheimerstrasse 5
Suite 200                     Jordan Hill Road     W-8046 Garching bei Munchen
Downers Grove, IL 60515-5702  Oxford OX2 8DR       Germany
USA                           England
Tel: +1 708 971 2337          Tel: +44 865 511245  Tel: +49 89 3207395
Fax: +1 708 971 2706          Fax: +44 865 310139  Fax: +49 89 3207396


LAPACK has been funded in part by NSF, DOE, and DARPA, with
developmental support from NAG Ltd., Cray Research, and many friends
and colleagues around the world.

Ed Anderson, Zhao-jun Bai, Chris Bischof, Jim Demmel, Jack Dongarra,
Jeremy Du Croz, Anne Greenbaum, Sven Hammarling, Alan McKenney,
Susan Ostrouchov, and Danny Sorensen


            (           l    l    l    l )
            (           a   -a    a   -a )
      1/4 * ( p    p             -p   -p )
            ( a   -a             -a    a )
            ( c    c   -c   -c           )
            ( k   -k   -k    k           )



