2013
DOI: 10.1137/11085774x
|View full text |Cite
|
Sign up to set email alerts
|

Fourier-Based Fast Multipole Method for the Helmholtz Equation

Abstract: The fast multipole method (FMM) has had great success in reducing the computa-4 tional complexity of solving the boundary integral form of the Helmholtz equation. We present a 5 formulation of the Helmholtz FMM that uses Fourier basis functions rather than spherical harmonics. 6 By modifying the transfer function in the precomputation stage of the FMM, time-critical stages of 7 the algorithm are accelerated by causing the interpolation operators to become straightforward ap-8 plications of fast Fourier transfo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
24
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(24 citation statements)
references
References 27 publications
0
24
0
Order By: Relevance
“…• For out-to-in translation the radiation pattern must be interpolated to translation size, which contains around four times the samples of storage size, i.e., about half of the samples of the algorithm that utilizes the local interpolator. • Error control and stability are excellent, but unfortunately asymptotic CPU-time cost of matrix-vector product is [12], which is higher than the that can be obtained with the local interpolator. However, on lower levels (or smaller problems) the global interpolator based on trigonometric polynomial expansion remains very competitive.…”
Section: Introductionmentioning
confidence: 94%
See 2 more Smart Citations
“…• For out-to-in translation the radiation pattern must be interpolated to translation size, which contains around four times the samples of storage size, i.e., about half of the samples of the algorithm that utilizes the local interpolator. • Error control and stability are excellent, but unfortunately asymptotic CPU-time cost of matrix-vector product is [12], which is higher than the that can be obtained with the local interpolator. However, on lower levels (or smaller problems) the global interpolator based on trigonometric polynomial expansion remains very competitive.…”
Section: Introductionmentioning
confidence: 94%
“…This method was first proposed by Sarvas in 2003 [11]. The approach allows the storage of the sampled radiation pattern components to take place in significantly reduced size, and the method has been developed further [12], [13]. The version presented in [13] reduced the number of sample points to roughly half compared to the original version by Sarvas, by simply reducing the sample rate in the polar regions in azimuthal direction.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…One alternative for local interpolators is the global interpolator based on trigonometric polynomial expansions [120,128,129]. Such presentations have several useful properties: Conversion between sample values and coefficients of the expansion can be performed effectively and accurately with fast Fourier transform (FFT).…”
Section: Mlfma With Global Interpolatorsmentioning
confidence: 99%
“…Figure 7 illustrates solutions (acoustic surface pressure) of broadband MLFMA (scalar Helmholtz SIE solver) utilizing global interpolators at two frequencies 2.5 Hz and 2.5 kHz corresponding to 22 MHz and 2.2 GHz in EM with the same wavelength as in acoustics. The major challenges of the discussed global interpolator, along with the higher asymptotic cost O(N log 2 N ) [129], are that the construction of the translators is a heavy process and implementation in distributed computing system is challenging.…”
Section: Mlfma With Global Interpolatorsmentioning
confidence: 99%