Published September 1988
| public
Journal Article
Algorithm 664: A Gauss algorithm to solve systems with large, banded matrices using random-access disk storage
- Creators
- Schrauf, Géza
Abstract
A FORTRAN 77 implementation of a Gauss algorithm with partial pivoting for banded matrices is described. The algorithm keeps only part of the matrix that is necessary for the actual computation in memory. This allows large systems to be solved on machine without virtual memory, or if the virtual memory is too small for the problem.
Additional Information
© 1988 ACM. Received September 1985; revised March 1988; accepted March 1988. This work was supported by the Deutsche Forschungsgemeinschaft (research scholarship Schr 271/1-2) and by the U.S. Department of Energy (contract DE-AM03-76SF00761).Additional details
- Eprint ID
- 66127
- Resolver ID
- CaltechAUTHORS:20160413-134437440
- Schr 271/1-2
- Deutsche Forschungsgemeinschaft (DFG)
- DE-AM03-76SF00761
- Department of Energy (DOE)
- Created
-
2016-04-13Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field