toms423

toms423, a Fortran77 code which implements ACM toms algorithm 423, for Gaussian elimination to factor a matrix and solve a related linear system.

The text of many ACM TOMS algorithms is available online through ACM: https://www.acm.org/pubs/calgo or NETLIB: https://www.netlib.org/toms/index.html.

Usage:

call decomp(n,ndim,a,ip)

computes the LU factorization of an N by N matrix A, stored in an array with leading dimension NDIM. The vector IP returns pivot information.

call solve(n,ndim,a,b,ip)

solves a linear system A*X=B, after A has been factored by DECOMP. B contains the right hand side on input, and the solution on output.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

toms423 is available in a Fortran77 version.

Related Programs:

toms423_test

lapack_examples, a Fortran77 program which demonstrates the use of the LAPACK linear algebra library.

LINPACK, a Fortran77 library which solves linear systems for a variety of matrix storage schemes, real or complex arithmetic, and single or double precision.

Author:

Cleve Moler

Reference:

1. Cleve Moler,
   Algorithm 423: Linear Equation Solver,
   Communications of the ACM,
   Volume 15, Number 4, April 1972, page 274.

Source Code:

• toms423.f, the source code.
• toms423.sh, commands to compile the source code.