Marching Methods for Elliptic Problems: Part 3

Abstract

Further extensions to the title problem are presented. Banded approximations to the full influence coefficient matrices are shown to provide significant improvements in initialization time and in storage requirements. The three-dimensional problems are treated, first by an obvious but inefficient extension of the two-dimensional algorithm, then by an efficient banded approximation, and finally by the use of the fast Fourier transform in conjunction with the two-dimensional marching algorithm.