Related papers: hankl: A lightweight Python implementation of the …
Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A…
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…
The notion of fractional Fourier transform (FrFT) has been used and investigated for many years by various research communities, which finds widespread applications in many diverse fields of research study. The potential applications…
Wide-field imaging has become a major challenge for modern radio astronomy, which uses high sensitivity acquisition systems that deal with huge amounts of data. In this paper we investigate a fast wide-field imaging solution based on the…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Though Fourier Transforms (FTs) are a common technique for finding correlation functions, they are not typically used in computations of the anisotropy of the two-point correlation function (2PCF) about the line of sight in wide-angle…
Harmonic polylogarithms $\H(\vec{a};x)$, a generalization of Nielsen's polylogarithms ${S}_{n,p}(x)$, appear frequently in analytic calculations of radiative corrections in quantum field theory. We present an algorithm for the numerical…
PySymmPol is a Python package designed for efficient manipulation of symmetric polynomials. It provides functionalities for working with various types of symmetric polynomials, including elementary, homogeneous, monomial symmetric, (skew-)…
Strongly-coupled Quantum Field Theories (QFTs) are ubiquitous in high energy physics and many-body physics, yet our ability to do precise computations in such systems remains limited. Hamiltonian Truncation is a method for doing…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…
We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…
Motivated by an earlier work on fractional-action cosmology with a periodic weight function [1], we extend it by choosing a power-law weight function in the action. In this approach, we obtain a varying gravitational coupling constant. We…
Analytic methods are emerging in solid and configuration modeling, while providing new insights into a variety of shape and motion related problems by exploiting tools from group morphology, convolution algebras, and harmonic analysis.…
There are a number of different phenomena in the early universe that have to be studied numerically with lattice simulations. This paper presents a graphics processing unit (GPU) accelerated Python program called PyCOOL that solves the…
We recently introduced the Fast Newton Transform (FNT), an hierarchical algorithm for performing multivariate Newton interpolation in arbitrary downward closed polynomial spaces of spatial dimension $m$. Here, we analyze the FNT in the…
Filtering of digital signals is accomplished on an Excel spreadsheet using fast Fourier transform (FFT) convolution in which the kernel is either a Gaussian or a cosine modulated Gaussian. Pedagogical examples of low-pass and band-pass…
Convolutional neural networks (CNNs) have a large number of variables and hence suffer from a complexity problem for their implementation. Different methods and techniques have developed to alleviate the problem of CNN's complexity, such as…
We describe a fast algorithm for computing discrete Hankel transforms of moderate orders from $n$ nonuniform points to $m$ nonuniform frequencies in $O((m+n)\log\min(n,m))$ operations. Our approach combines local and asymptotic Bessel…
Novel types of convolution operators for quaternion linear canonical transform (QLCT) are proposed. Type one and two are defined in the spatial and QLCT spectral domains, respectively. They are distinct in the quaternion space and are…
The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency…