linpack_d, a C++ code which solves systems of linear equations for a variety of matrix types and storage modes, using double precision real arithmetic, by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
LINPACK has officially been superseded by the LAPACK library. The LAPACK library uses more modern algorithms and code structure. However, the LAPACK library can be extraordinarily complex; what is done in a single LINPACK routine may correspond to 10 or 20 utility routines in LAPACK. This is fine if you treat LAPACK as a black box. But if you wish to learn how the algorithm works, or to adapt it, or to convert the code to another language, this is a real drawback. This is one reason I still keep a copy of LINPACK around.
Versions of LINPACK in various arithmetic precisions are available through the NETLIB web site.
The information on this web page is distributed under the MIT license.
linpack_d is available in a C version and a C++ version and a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
blas1_d, a C++ code which contains basic linear algebra routines for vector-vector operations, using double precision real arithmetic.
condition, a C++ code which implements methods of computing or estimating the condition number of a matrix.
linpack_bench, a C++ code which measures the time taken by LINPACK to solve a particular linear system.
linpack_c, a C++ code which solves linear systems using single precision complex arithmetic;
linpack_s, a C++ code which solves linear systems using single precision real arithmetic;
linpack_z, a C++ code which solves linear systems using double precision complex arithmetic;
qr_solve, a C++ code which computes the least squares solution of a linear system A*x=b.
test_matrix, a C++ code which defines test matrices.
toeplitz_cholesky, a C++ code which computes the Cholesky factorization of a nonnegative definite symmetric Toeplitz matrix.
Original Fortran77 version by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart. This version by John Burkardt.