Fast Parallel Iterative Solution of Poisson’s and the Biharmonic Equations on Irregular Regions

In [SIAM J. Numer. Anal., 21 (1984), pp. 285-299], a method was introduced for solving Poisson's or the biharmonic equation on an irregular region by making use of an integral equation formulation. Because fast solvers were used to extend the solution to an enclosing rectangle, this method avoi...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific and statistical computing Vol. 13; no. 1; pp. 101 - 118
Main Authors: Mayo, A., Greenbaum, A.
Format: Journal Article
Language:English
Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.1992
Subjects:
Applied mathematics
Approximation
Integral equations
Iterative methods
Methods
ISSN:0196-5204, 1064-8275, 2168-3417, 1095-7197
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In [SIAM J. Numer. Anal., 21 (1984), pp. 285-299], a method was introduced for solving Poisson's or the biharmonic equation on an irregular region by making use of an integral equation formulation. Because fast solvers were used to extend the solution to an enclosing rectangle, this method avoided many of the standard problems associated with integral equations. The equations that arose were Fredholm integral equations of the second kind with bounded kernels. In this paper iterative methods are used to solve the dense nonsymmetric linear systems arising from the integral equations. Because the matrices are very well conditioned, conjugate gradient-like methods can be used and will converge very rapidly. The methods are very amenable to vectorization and parallelization, and parallel and vector implementations are described on shared memory multiprocessors. Numerical experiments are described and results presented for a three-dimensional interface problem for the Laplacian on a recording head geometry.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0196-5204
1064-8275
2168-3417
1095-7197
DOI:10.1137/0913006