linpack_z, a C++ code which can solve systems of linear equations for a variety of matrix types and storage modes, using double precision complex arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, 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 computer code and data files described and made available on this web page are distributed under the MIT license
linpack_z is available in a C++ version and a FORTRAN90 version.
BLAS1_Z a C++ code which contains basic linear algebra routines for vector-vector operations, using double precision complex arithmetic.
COMPLEX_NUMBERS, a C++ code which demonstrates some simple features involved in the use of complex numbers in C programming.
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_D, a C++ code which solves linear systems using double precision real arithmetic;
LINPACK_S, a C++ code which solves linear systems using single precision real arithmetic;
TEST_MAT, a C++ code which defines test matrices.
Original FORTRAN77 version by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart. C++ version by John Burkardt.