Minimal Storage Band Elimination.

Abstract

A variation of Gaussian elimination is presented for solving band 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 coefficients in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a five-point problem on an n x n grid, the storage required is approx. n-squared versus approx. n-cubed for band elimination, while surprisingly the work required at most doubles. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 15, 1977
Accession Number
ADA047723

Entities

People

  • A. H. Sherman
  • Martin H. Schultz
  • S. C. Eisenstat

Organizations

  • Yale University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Central Processing Units
  • Coefficients
  • Computer Programs
  • Computer Science
  • Computers
  • Core Storage
  • Data Storage Systems
  • Differential Equations
  • Equations
  • Numerical Analysis
  • Operating Systems
  • Partial Differential Equations
  • Poisson Equation
  • Standards

Readers

  • Computer Science.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Linear Algebra