Accession Number:

ADA067263

Title:

Software for Sparse Gaussian Elimination with Limited Core Storage.

Descriptive Note:

Research rept.,

Corporate Author:

YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Eisenstat,S. C.
• Schultz,M. H.
• Sherman,A. H.

Report Date:

1978-01-01

Pagination or Media Count:

26.0

Abstract:

A variant of Gaussian elimination is presented for solving sparse symmetric systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero entries in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a nine-point problem with the nested dissection ordering on an n x n grid, fewer than 72n-squared nonzeroes must be saved versus approx-9312n-squaredlogbase2n for sparse elimination, while the work required at most doubles. The use of auxiliary storage in sparse elimination is also discussed. Author

Descriptors:

• *COMPUTER PROGRAMMING
• *SPARSE MATRIX
• ALGORITHMS
• COMPUTATIONS
• REDUCTION
• SOLUTIONS(GENERAL)
• DATA STORAGE SYSTEMS

Subject Categories:

• Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE