Related papers: Fourier Based Fast Multipole Method for the Helmho…
In this paper, we present a numerical algorithm for the accurate and efficient computation of the convolution of the frequency domain layered media Green's function with a given density function. Instead of compressing the convolution…
We present an implementation of the fast multipole method for computing coulombic electrostatic and polarization forces from polarizable force-fields based on induced point dipole moments. We demonstrate the expected $O(N)$ scaling of that…
Transmission matrix (TM) linearly maps the incident and transmitted complex fields, and has been used widely due to its ability to characterize scattering media. It is computationally demanding to reconstruct the TM from intensity images…
This paper is concerned with the error estimation of the fast multipole method (FMM) for scattering problems in 2-D. The FMM error is caused by truncating Graf's addition theorem in each step of the algorithm, including two expansions and…
This paper is concerned with the Fourier-Bessel method for the boundary value problems of the Helmholtz equation in a smooth simply connected domain. Based on the denseness of Fourier-Bessel functions, the problem can be approximated by…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
In this work, we develop a highly efficient representation of functions and differential operators based on Fourier analysis. Using this representation, we create a variational hybrid quantum algorithm to solve static, Schr\"odinger-type,…
This paper proposes a new multiple-scattering frequency-time hybrid (FTH-MS) integral equation solver for problems of wave scattering by obstacles in two dimensional space, including interior problems in closed cavities and problems…
In this paper, using the approximate particular solutions of Helmholtz equations, we solve the boundary value problems of Helmholtz equations by combining the methods of fundamental solutions (MFS) with the methods of particular solutions…
In finite element methods (FEMs), the accuracy of the solution cannot increase indefinitely because the round-off error increases when the number of degrees of freedom (DoFs) is large enough. This means that the accuracy that can be reached…
A set of semi-analytical techniques based on Fourier analysis is used to solve wave scattering problems in variously shaped waveguides with varying normal admittance boundary conditions. Key components are newly developed conformal mapping…
The boundary element method (BEM) is an efficient numerical method for simulating harmonic wave propagation. It uses boundary integral formulations of the Helmholtz equation at the interfaces of piecewise homogeneous domains. The…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
A boundary element method (BEM) simulation is used to compare the efficiency of numerical inverse Laplace transform strategies, considering general requirements of Laplace-space numerical approaches. The two-dimensional BEM solution is used…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
We have developed a symbolic algebra approach to automatically produce, verify, and optimize computer code for the Fast Multipole Method (FMM) operators. This approach allows for flexibility in choosing a basis set and kernel, and can…
We introduce a new class of multilevel, adaptive, dual-space methods for computing fast convolutional transforms. These methods can be applied to a broad class of kernels, from the Green's functions for classical partial differential…
This paper details the purpose, difficulties, theory, implementation, and results of developing a Fast Fourier Transform (FFT) using the prime factor algorithm on an embedded system. Many applications analyze the frequency content of…
We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…