mgmres, a C code which applies the restarted Generalized Minimum Residual (GMRES) algorithm to solve a sparse linear system, using compressed row (CR) or sparse triplet (ST) format, by Lili Ju.
One matrix format used is the sparse triplet (ST) format, which simply stores NZ_NUM, the number of nonzeros, and stores the K-th nonzero matrix entry as
Another matrix format used is the compressed row (CR) format, which is similar to the sparse triplet format except that the vector of row indices is compressed to a vector of length N+1 which points to the beginning of the set of entries for each row.
The computer code and data files described and made available on this web page are distributed under the MIT license
mgmres is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version.
ccs, a data directory which contains examples of the Compressed Column Storage (CCS) sparse matrix file format;
cg_rc, a C code which implements the conjugate gradient method for solving a positive definite sparse linear system A*x=b, using reverse communication.
crs, a data directory which contains examples of the Compressed Row Storage (CRS) sparse matrix file format;
CSPARSE, a C code which carries out the direct solution of sparse linear systems, by Timothy Davis.
LINPACK_D, a C code which carries out direct methods for solving linear systems.
MM, a data directory which contains a description and examples of the Matrix Market format for storing matrices.
ST, a data directory which contains a description and examples of the sparse triplet (ST) format for storing sparse matrices, which used by the C and C++ versions of mgmres.
SUPERLU, C codes which illustrate how to use the SUPERLU library, which applies a fast direct solution method to solve sparse linear systems, by James Demmel, John Gilbert, and Xiaoye Li.
test_matrix, a C code which defines test matrices.
Original C version by Lili Ju, Mathematics Department, University of South Carolina; this C version by John Burkardt.