Related papers: A Fast, Accurate and Robust Algorithm For Transfer…
Fourier and related transforms is a family of algorithms widely employed in diverse areas of computational science, notoriously difficult to scale on high-performance parallel computers with large number of processing elements (cores). This…
The continuous wavelet transform (CWT) is very useful for processing signals with intricate and irregular structures in astrophysics and cosmology. It is crucial to propose precise and fast algorithms for the CWT. In this work, we review…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
Image simulation for scanning transmission electron microscopy at atomic resolution for samples with realistic dimensions can require very large computation times using existing simulation algorithms. We present a new algorithm named PRISM…
The Quantum Fourier Transformation ($QFT$) is a key building block for a whole wealth of quantum algorithms. Despite its proven efficiency, only a few proof-of-principle demonstrations have been reported. Here we utilize $QFT$ to enhance…
The extraction of information carried by light plays an increasingly important role in optical communication, imaging, and detection. However, the information can only be successfully extracted when the light pulse is comparably strong,…
Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save…
We introduce a fast algorithm for computing volume potentials - that is, the convolution of a translation invariant, free-space Green's function with a compactly supported source distribution defined on a uniform grid. The algorithm relies…
Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3D) volumes while considering its real-time implementation. The first algorithm, referred…
This paper is concerned with the fast computation of Fourier integral operators of the general form $\int_{\R^d} e^{2\pi\i \Phi(x,k)} f(k) d k$, where $k$ is a frequency variable, $\Phi(x,k)$ is a phase function obeying a standard…
We develop a new numerical scheme for solving the radiative transfer equation in a spherically symmetric system. This scheme does not rely on any kind of diffusion approximation and it is accurate for optically thin, thick, and intermediate…
The paper is concerned with the three-dimensional electromagnetic scattering from a large open rectangular cavity that is embedded in a perfectly electrically conducting infinite ground plane. By introducing a transparent boundary…
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent…
Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…
Radiation hydrodynamical transport of ionization fronts in the next generation of cosmological reionization simulations holds the promise of predicting UV escape fractions from first principles as well as investigating the role of…
Edge devices are being deployed at increasing volumes to sense and act on information from the physical world. The discrete Fourier transform (DFT) is often necessary to make this sensed data suitable for further processing -- such as by…
We present a fast iterative FFT-based reconstruction algorithm that allows for non- parallel redshift-space distortions (RSD). We test our algorithm on both N-body dark matter simulations and mock distributions of galaxies designed to…
Based on the sampling theorem, interpolation should be conducted by employing the sinc functions as the kernels. Inspired by the fact that the discrete Fourier transform (DFT) is sampled from the discrete time Fourier transform, a fast…
A new near-to-far-field transformation algorithm for three-dimensional finite-different time-domain is presented in this article. This new approach is based directly on the polarization current of the scatterer, not the scattered near…
A Discrete Fourier Transform Method (DFTM) for discrimination between the signal of neutrons and gamma rays in organic scintillation detectors is presented. The method is based on the transformation of signals into the frequency domain…