An efficient band-oriented scheme for solving n by n grid problems

  • Authors:

  • Alan George

  • Affiliations:

  • University of Waterloo, Waterloo, Ontario, Canada

  • Venue:
  • AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
  • Year:
  • 1972

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let N = n2 for some positive integer n, and consider a square n by n grid consisting of (n--1)2 small squares and having a node at each of the n2 grid points. In this paper we consider the problem of directly solving the class of N by N symmetric positive definite linear systems of equations Ax=b, (1) where each xi is associated with a grid point and A has the property that Aij≠0 only if xi and xj are associated with nodes belonging to the same small square. We must specify how the unknowns are to be numbered if the above remark is to precisely determine the structure of A.