Accession Number:

ADA162925

Title:

Analysis of Preconditioners for Domain Decomposition.

Descriptive Note:

Research rept.,

Corporate Author:

YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1985-08-01

Pagination or Media Count:

13.0

Abstract:

Domain decomposition is a class of techniques that are designed to solve elliptic problems on irregular domains and on multiprocessor systems. Typically, a domain is decomposed into many smaller regular subdomains and the capacitance system governing the interface unknowns is solved by some version of the preconditioned conjugate gradient method. In this paper, we show that for a simple model problem -- Poissons equation on a rectangle decomposed into two smaller rectangles -- the capacitance system can be inverted exactly by fast Fourier transform. No iteration is needed. An exact eigen-decomposition of the capacitance matrix also makes possible a comparison of various preconditioners that have been proposed in the literature. For example, we show that in the limit as the aspect ratio of the two rectangles tend to infinity, the preconditioner proposed by Golub-Mayers becomes exact, but the one proposed by Dryja does not. Both preconditioners, however, are poor when the aspect ratio is small. Author

Subject Categories:

  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE