The basic data structure used for the sparse linear system in the LSA is the compressed sparse row (CSR) data structure. This stores only the "interesting" entries in the matrix, normally just the nonzero ones. In some applications, some zeros are explicitly stored. For example, in a time-dependent PDE solver the user may choose to set up a sparse matrix CSR data structure which holds all entries that

Additional components of the LSA sparse system structure are:

- Right hand side vector b, an n-array of doubles.
- System title, a character array of length 72
- System key, a character array of length 8 containing a short name for the system.
- Gang, need to fill in here!

bramley@cs.indiana.edu

*
Last updated: Tue Jan 26 12:16:59 1999
*