"Fossies" - the Fresh Open Source Software Archive

Member "readme" (13 Aug 1995, 2598 Bytes) of package /linux/privat/old/laspack.tgz:

    1                         LASPack (version 1.12.2)
    2 
    3                              Tomas Skalicky
    4 		   (skalicky@msmfs1.mw.tu-dresden.de)
    5 
    6                      last revision: August 13, 1995
    7 
    8 -------------------------------------------------------------------------------
    9 
   10 LASPack is a package for solving large sparse systems of linear equations
   11 like those which arise from discretization of partial differential equations.
   12 
   13 Main features:
   14 
   15 - The primary aim of LASPack is the implementation of efficient iterative
   16   methods for the solution of systems of linear equations. All routines and
   17   data structures are optimized for effective usage of resources especially
   18   with regard to large sparse matrices. The package can be accessed from
   19   an application through a straightforward interface defined in the form
   20   of procedure calls.
   21 
   22 - Beside the obligatory Jacobi, succesive over-relaxation, Chebyshev, and
   23   conjugate gradient solvers, LASPack contains selected state-of-the-art
   24   algorithms which are commonly used for large sparse systems:
   25 
   26   - CG-like methods for non-symmetric systems: CGN, GMRES, BiCG, QMR, CGS, and
   27     BiCGStab,
   28   - multilevel methods such as multigrid and conjugate gradient method
   29     preconditioned by multigrid and BPX preconditioners.
   30 
   31   All above solvers are applicable not only to the positive definite or
   32   non-symmetric matrices, but are also adopted for singular systems
   33   (e.g. arising from discretization of Neumann boundary value problems).
   34 
   35 - The implementation is based on an object-oriented approach (although it
   36   has been programmed in C). Vectors and matrices are defined as new data
   37   types in connection with the corresponding supporting routines.
   38   The basic operations are implemented so that they allow the programming
   39   of linear algebra algorithms in a natural way.
   40 
   41 - LASPack is extensible in a simple manner. An access to the internal
   42   representation of vectors and matrices is not necessary and is, as required
   43   of the object-oriented programming, avoided. This allows an improvement
   44   of algorithms or a modification of data structures with no adjustment
   45   of application programs using the package.
   46 
   47 - LASPack is written in ANSI C and is thus largely portable.
   48 
   49 
   50 A complete description of the package (including the installation procedure)
   51 you may find in LASPack Reference Manual in the following postscript files:
   52 
   53     laspack/doc/laspack1.ps
   54     laspack/doc/laspack2.ps
   55 
   56 A HTML version of the manual is also available available at:
   57 
   58     laspack/html/laspack.html
   59 
   60 or
   61     
   62     http://www.tu-dresden.de/mwism/skalicky/laspack/laspack.html