Code by Yousef Saad and Jun Zhang to solve general sparse linear systems by using Krylov subspace methods preconditioned by some multi-level block ILU (BILUM) preconditioning techniques.

By Udo Grabowski.

Collection of Fortran 77 subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms.

Uses iterative techniques based on generalized conjugate gradient methods and beyond to solve large and sparse linear systems.

Solves sparse linear equations using a conjugate-gradient type method.

Fortran 90 package for solving linear systems of equations of the form A*x = b, where the matrix A is sparse and can be either unsymmetric, symmetric positive definite, or general symmetric. Available in various arithmetics (real or complex, single or double), and with or without MPI.

Provides computational kernels for fundamental sparse matrix operations.

Fortran 77 subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms.

The optimqr program will read a description of the sparsity pattern of some system matrix for system of linear equations. It will then apply heuristic branch & bound search to find a near-optimal ordering of the rows and columns of the system matrix. The ordering is written to disk. The codegen.pl program can then read the system ordering, and create a solver written in Fortran 77, that will solve the system using sparse QR factorization (using Givens rotations).

Provides a framework to enable easy, efficient and portable implementations of iterative solvers for linear systems, while shielding the user from most details of their parallelization. The interface is designed keeping in view a Single Program Multiple Data programming model on distributed memory machines.

Software by Rasmus Munk Larsen for large and sparse SVD calculations, with versions in Fortran and Matlab.

By Yousef Saad and Kesheng Wu.

Fortran 90 modules by Ernst Meese for the compressed sparse row (CSR) and the modified sparse row (MSR) data storage formats, a very general incomplete LU factorisation routine, the Krylov subspace solvers CGS, BiCGSTAB and GMRES.

Fortran 77 code for sparse matrix multiplication, transposition, and format conversion.

General purpose Fortran library by Yousef Saad for sparse matrix computations.

Comprised of four numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse matrices using double precision Fortran 77.

Solves a set of sparse, symmetric linear equations using a conjugate gradient type method.

Code for sparse linear equations (symmetric or general) and sparse least squares, and updating a dense square factorization L C = U.

Fortran 77 source code for solving sparse asymmetric linear equations, including a version for complex matrices. There are copyright restrictions.

Fortran 77 code that solves sparse systems of linear algebraic equations by Gaussian elimination.