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.
Cite
CITATION STYLE
APA
Schrauf, G. (1988). Algorithm 664. ACM Transactions on Mathematical Software, 14(3), 257–260. https://doi.org/10.1145/44128.214379
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free