NANASep 16, 2014

Fast Directional Computation of High Frequency Boundary Integrals via Local FFTs

arXiv:1408.11975 citationsh-index: 54
Originality Incremental advance
AI Analysis

For researchers solving time-harmonic acoustic obstacle scattering problems, this algorithm offers a simple, fast, and kernel-independent method to reduce computational cost.

The paper presents a new fast algorithm for evaluating oscillatory boundary integrals in 2D acoustic scattering, achieving quasi-linear complexity via directional low-rank approximations and local FFTs. Numerical results demonstrate its effectiveness.

The boundary integral method is an efficient approach for solving time-harmonic acoustic obstacle scattering problems. The main computational task is the evaluation of an oscillatory boundary integral at each discretization point of the boundary. This paper presents a new fast algorithm for this task in two dimensions. This algorithm is built on top of directional low-rank approximations of the scattering kernel and uses oscillatory Chebyshev interpolation and local FFTs to achieve quasi-linear complexity. The algorithm is simple, fast, and kernel-independent. Numerical results are provided to demonstrate the effectiveness of the proposed algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes