Related papers: A fast FFT-based discrete Legendre transform
Let $\Theta$ be a point in ${\bf R}^n$. We split the classical Khintchine's Transference Principle into $n-1$ intermediate estimates which connect exponents $\omega_d(\Theta)$ measuring the sharpness of the approximation to $\Theta$ by…
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…
The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial…
In this paper we consider the special case where a discrete signal ${\bf x}$ of length N is known to vanish outside a support interval of length $m < N$. If the support length $m$ of ${\bf x}$ or a good bound of it is a-priori known we…
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…
A simple technique is described, that provides improved nearside-farside (NF) decompositions of elastic scattering amplitudes. The technique, involving the resummation of a Legendre partial wave series, reduces the importance of unphysical…
We study the spectrum and OPE coefficients of the three-dimensional critical O(2) model, using four-point functions of the leading scalars with charges 0, 1, and 2 ($s$, $\phi$, and $t$). We obtain numerical predictions for low-twist OPE…
An inverse nonequispaced fast Fourier transform (iNFFT) is a fast algorithm to compute the Fourier coefficients of a trigonometric polynomial from nonequispaced sampling data. However, various applications such as magnetic resonance imaging…
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 study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive direction $(u,v)$ and two side lengths,…
The usual fluid equations describing the large-scale evolution of mass density in the universe can be written as local in the density, velocity divergence, and velocity potential fields. As a result, the perturbative expansion in small…
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…
We study large N conformal field theories perturbed by relevant double-trace deformations. Using the auxiliary field trick, or Hubbard-Stratonovich transformation, we show that in the infrared the theory flows to another CFT. The generating…
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear…
We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer…
In this note, we derive a Mellin space version of the Lorentzian inversion formula for CFTs by explicitly integrating over the cross-ratios in $d=2$ and $d=4$ spacetime dimensions. We use the simplicity of the Mellin representation of…
We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…
This paper presents an algorithm to deform any Legendrian singularity to a nearby Legendrian subvariety with singularities of a simple combinatorial nature. Furthermore, the category of microlocal sheaves on the original Legendrian…