Related papers: 2-FAST: Fast and accurate computation of projected…
We present a general method for accelerating by more than an order of magnitude the convolution of pixelated function on the sphere with a radially-symmetric kernel. Our method splits the kernel into a compact real-space, and a compact…
By using Poisson's summation formula, we calculate periodic integrals over Gaussian basis functions by partitioning the lattice summations between the real and reciprocal space, where both sums converge exponentially fast with a large…
The precise analysis and accurate measurement of harmonic provides a reliable scientific industrial application. However, the high-performance DSP processor is the important method of electrical harmonic analysis. Hence, in this research…
Many areas of science and engineering encounter data defined on spherical manifolds. Modelling and analysis of spherical data often necessitates spherical harmonic transforms, at high degrees, and increasingly requires efficient computation…
We present a systematic framework for the calculation of dijet soft functions, which are defined as a matrix element of two light-like Wilson lines that is weighted by a generic measurement function. Based on a universal parametrisation of…
The fast Fourier transform (FFT) based matrix-free ansatz interpolatory approximations of periodic functions are fundamental for efficient realization in several applications.In this work we design, analyze, and implement similar…
We present explicit filtration/backprojection-type formulae for the inversion of the spherical (circular) mean transform with the centers lying on the boundary of some polyhedra (or polygons, in 2D). The formulae are derived using the…
The desire for wide-field of view, large fractional bandwidth, high sensitivity, high spectral and temporal resolution has driven radio interferometry to the point of big data revolution where the data is represented in at least three…
We present a fast and efficient method to compute the inclusive two-particle two-hole (2p-2h) electroweak responses in the neutrino and electron quasielastic inclusive cross sections. The method is based on two approximations. The first…
Spectral clustering is a popular and effective algorithm designed to find $k$ clusters in a graph $G$. In the classical spectral clustering algorithm, the vertices of $G$ are embedded into $\mathbb{R}^k$ using $k$ eigenvectors of the graph…
We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. We focus on algorithms in which convolution with the point-spread function to be deconvolved is used in each iteration, and aim at accelerating…
This paper presents an efficient and concise double fast algorithm to solve high dimensional time-space fractional diffusion problems with spectral fractional Laplacian. We first establish semi-discrete scheme of time-space fractional…
In this paper we investigate the holographic computation of the two-point functions of $\frac{1}{2}$-BPS chiral primary operators with scaling dimensions $\Delta \sim N$ or $\Delta \sim N^2$ in $\mathcal{N}=4$ $SU(N)$ SYM using Type IIB…
We have developed a new analytic method to calculate the galaxy two-point correlation functions (TPCFs) accurately and efficiently, applicable to surveys with finite, regular, and mask-free geometries. We have derived simple, accurate…
When a pulsed, few-cycle electromagnetic wave is focused by optics with f-number smaller than two, the frequency components it contains are focused to different regions of space, building up a complex electromagnetic field structure.…
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…
An $\mathcal{O}(N(\log N)^2/\log\!\log N)$ algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
We consider the analytic calculation of a two-loop non-planar three-point function which contributes to the two-loop amplitudes for $t \bar{t}$ production and $\gamma \gamma$ production in gluon fusion through a massive top-quark loop. All…
An alternative methodology to evaluate two-electron-repulsion integrals based on numerical approximation is proposed. Computational chemistry has branched into two major fields with methodologies based on quantum mechanics and classical…