Fast potential theory. II: Layer potentials and discrete sums (Q1186197)

From author's abstract: Three new families of fast algorithms for classical potential theory, based on Ewald summation and fast transforms of Gaussians and Fourier series are presented. Ewald summation separates the Green function for a cube into a high- frequency localized part and a rapidly-converging Fourier series. Each part can then be evaluated efficiently with appropriate fast transform algorithms. Our algorithms are naturally suited to the use of Green functions with boundary conditions imposed on the boundary of a cube, rather than free-space Green functions. Two-dimensional numerical results are presented for all algorithms. Layer potentials are evaluated to second-order accuracy, in times which exhibit considerable speedups even over a reasonably sophisticated direct calculation.