last modified: 23-JUL-1987 | catalog | categories | new | search |

NESC9776 SLAP.

SLAP, Large Sparse Linear System Solution Package

top ]
1. NAME OR DESIGNATION OF PROGRAM:  SLAP.
top ]
2. COMPUTERS
To submit a request, click below on the link of the version you wish to order. Only liaison officers are authorised to submit online requests. Rules for requesters are available here.
Program name Package id Status Status date
SLAP NESC9776/02 Tested 23-JUL-1987

Machines used:

Package ID Orig. computer Test computer
NESC9776/02 CRAY 1 CRAY 1
top ]
3. DESCRIPTION OF PROGRAM OR FUNCTION

SLAP is a set of routines for solving large sparse systems of linear equations. One need not store the entire matrix - only the nonzero elements and their row and column numbers. Any nonzero structure is acceptable, so the linear system solver need not be modified when the structure of the matrix  changes. Auxilliary storage space is acquired and released within the routines themselves by use of the LRLTRAN POINTER statement.
top ]
4. METHOD OF SOLUTION

SLAP contains one direct solver, a band matrix  factorization and solution routine, BAND, and several iteractive solvers. The iterative routines are as follows: JACOBI, Jacobi iteration; GS, Gauss-Seidel Iteration; ILUIR, incomplete LU decomposition with iterative refinement; DSCG and ICCG, diagonal scaling and incomplete Cholesky decomposition with conjugate gradient iteration (for symmetric positive definite matrices only);  DSCGN and ILUGGN, diagonal scaling and incomplete LU decomposition with conjugate gradient iteraction on the normal equations; DSBCG and ILUBCG, diagonal scaling and incomplete LU decomposition with biconjugate gradient iteration; and DSOMN and ILUOMN, diagonal scaling and incomplete LU decomposition with ORTHOMIN iteration.
top ]
5. RESTRICTIONS ON THE COMPLEXITY OF THE PROBLEM:
top ]
6. TYPICAL RUNNING TIME:
NESC9776/02
NEA-DB compiled the FORTRAN routines correctly on a CRAY-XMP/2200 computer in 2.7 seconds of CPU time. No attempt has been made to execute the subroutine collection.
top ]
7. UNUSUAL FEATURES OF THE PROGRAM:
top ]
8. RELATED AND AUXILIARY PROGRAMS:
top ]
9. STATUS
Package ID Status date Status
NESC9776/02 23-JUL-1987 Tested at NEADB
top ]
10. REFERENCES

- Anne Greenbaum,
  Routines for Solving Large Sparse Linear Systems,
  LLNL Tentacle, Vol. 6, No. 1, pp.15-21, January 1986.
NESC9776/02, included references:
- Availability of SLAP
  NESC Note 86-45  (May 22, 1986)
- A. Greenbaum:
  Routines for Solving Large Sparse Linear Systems.
  CMRD Reports  (January 1986)
- W.S. Derby, J.T. Engle, J.T. Martin:
  LRLTRAN Language used with the CHAT and CIVIC compilers
  LCSD-302, Rev. 1 (1 June 1982)
top ]
11. MACHINE REQUIREMENTS:
top ]
12. PROGRAMMING LANGUAGE(S) USED
Package ID Computer language
NESC9776/02 LLNL-FORTRAN
top ]
13. OPERATING SYSTEM UNDER WHICH PROGRAM IS EXECUTED:
NESC9776/02
The subroutines have been compiled under COS 1.4 using  the CFT 1.14 version of the CRAY-XMP/220 FORTRAN compiler.
top ]
14. OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS

SLAP utilizes dynamic memory management provided by the LRLTRAN POINTER statement in conjuction with the Lawrence Livermore National Laboratory FORTLIB routines GETSPACE and RELSPACE. This feature can  be replaced by specifying dimensions for the required arrays. SLAP also makes use of routines from the LLNL FORTLIB, OMNILIB, and GRAFLIB libraries and the proprietary IMSL sorting routine, VSRTM; these routines are not included.
   SLAP is written in LRLTRAN (79%) and CAL (21%).
top ]
15. NAME AND ESTABLISHMENT OF AUTHORS

         A. Greenbaum
         Lawrence Livermore National Laboratory
         P.O. Box 808
         Livermore, California 94550
top ]
16. MATERIAL AVAILABLE
NESC9776/02
File name File description Records
NESC9776_02.001 Information file 52
NESC9776_02.002 Fortran source 4194
NESC9776_02.003 Assembler source 1110
top ]
17. CATEGORIES
  • P. General Mathematical and Computing System Routines

Keywords: algorithms, equations, linear, mathematical routines, matrices.