A Gauss algorithm to solve systems with large, banded matrices using random-access disk storage. A FORTRAN 77 implementation of a Gauss algorithm with partial pivoting for banded matrices is described. The algorithm keeps only the part of the matrix that is necessary for the actual computation in memory. This allows large systems to be solved on machines without virtual memory, or if the virtual memory is too small for the problem.

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element