All the nonzero entries of the matrix are stored row by row in a vector. The matrix entries are not a part of this class. Two indexing functions are used for locating a matrix entry. The sparse matrix storage scheme is described in detail below. There are three constructors.
Most member functions are self-explanatory.
See below how this can be done. Since the number of nonzeroes is not known on beforehand, a local list is a flexible way of storing the column number information. It can also be used to set this value. This is the function to be used when, for example, communicating with Fortran programs.