Pith. sign in

REVIEW

"Interpolated Factored Green Function" Method for accelerated solution of Scattering Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.02857 v2 pith:6AFJTGKT submitted 2020-10-06 math.NA cs.NA

"Interpolated Factored Green Function" Method for accelerated solution of Scattering Problems

classification math.NA cs.NA
keywords greenifgfacceleratedalgorithmevaluationfunctionmethodmethods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper presents a novel {\em Interpolated Factored Green Function} method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas. Like existing acceleration methods in these fields, the IFGF algorithm evaluates the action of Green function-based integral operators at a cost of $\mathcal{O}(N\log N)$ operations for an $N$-point surface mesh. The IFGF strategy, which leads to an extremely simple algorithm, capitalizes on slow variations inherent in a certain Green function {\em analytic factor}, which is analytic up to and including infinity, and which therefore allows for accelerated evaluation of fields produced by groups of sources on the basis of a recursive application of classical interpolation methods. Unlike other approaches, the IFGF method does not utilize the Fast Fourier Transform (FFT), and is thus better suited than other methods for efficient parallelization in distributed-memory computer systems. Only a serial implementation of the algorithm is considered in this paper, however, whose efficiency in terms of memory and speed is illustrated by means of a variety of numerical experiments -- including a 43 min., single-core operator evaluation (on 10 GB of peak memory), with a relative error of $1.5\times 10^{-2}$, for a problem of acoustic size of 512$\lambda$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.