The fast multipole method and Fourier convolution for the solution of acoustic scattering on regular volumetric grids

Authors:
Andrew J. Hesford;Robert C. Waag
Affiliations:
Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14642-8648, USA;Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14642-8648, USA and Department of Imaging Sciences, University of Rochester, Rochester, NY 14642-8648, USA
Venue:
Journal of Computational Physics
Year:
2010

Citing 6
Cited 1

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A fast algorithm for particle simulations

Journal of Computational Physics
Rapid solution of integral equations of scattering theory in two dimensions

Journal of Computational Physics
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Fast and Efficient Algorithms in Computational Electromagnetics

Fast and Efficient Algorithms in Computational Electromagnetics
An efficient hybrid MLFMA-FFT solver for the volume integral equation in case of sparse 3D inhomogeneous dielectric scatterers

Journal of Computational Physics

Reduced-rank approximations to the far-field transform in the gridded fast multipole method

Journal of Computational Physics

Quantified Score

Hi-index	31.45

Visualization

Abstract

The fast multipole method (FMM) is applied to the solution of large-scale, three-dimensional acoustic scattering problems involving inhomogeneous objects defined on a regular grid. The grid arrangement is especially well suited to applications in which the scattering geometry is not known a priori and is reconstructed on a regular grid using iterative inverse scattering algorithms or other imaging techniques. The regular structure of unknown scattering elements facilitates a dramatic reduction in the amount of storage and computation required for the FMM, both of which scale linearly with the number of scattering elements. In particular, the use of fast Fourier transforms to compute Green's function convolutions required for neighboring interactions lowers the often-significant cost of finest-level FMM computations and helps mitigate the dependence of FMM cost on finest-level box size. Numerical results demonstrate the efficiency of the composite method as the number of scattering elements in each finest-level box is increased.