Related papers: A Nonuniform Fast Hankel Transform
In this paper, we present a Clenshaw-Curtis-Filon-type method for the weakly singular oscillatory integral with Fourier and Hankel kernels. By interpolating the non-oscillatory and nonsingular part of the integrand at $(N+1)$…
We obtain an asymptotic formula for the counting function of the discrete spectrum for Hankel-type pseudo-differential operators with discontinuous symbols.
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a…
We consider the problem of computing the Boolean convolution (with wraparound) of $n$~vectors of dimension $m$, or, equivalently, the problem of computing the sumset $A_1+A_2+\ldots+A_n$ for $A_1,\ldots,A_n \subseteq \mathbb{Z}_m$. Boolean…
In this paper we consider the fundamental operations dilation and erosion of mathematical morphology. Many powerful image filtering operations are based on their combinations. We establish homomorphism between max-plus semi-ring of integers…
We use lookup tables to design faster algorithms for important algebraic problems over finite fields. These faster algorithms, which only use arithmetic operations and lookup table operations, may help to explain the difficulty of…
Nonuniformly sampled signals are prevalent in real-world applications. However, estimating their power spectra from finite samples poses a significant challenge. The optimal solution-Bronez Generalized Prolate Spheroidal Sequence (GPSS) by…
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…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
We generalize the generalized-squeezing problem to include fractional values of the squeezing order $n$. This approach allows us to determine the locations of critical points at which qualitative changes in behaviour occur and accurately…
In this paper, we study nonconvex constrained optimization problems with both equality and inequality constraints, covering deterministic and stochastic settings. We propose a novel first-order algorithm framework that employs a…
In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called…
We present an efficient self-contained algorithm for computing the modified Bessel function of the first kind $I_{\nu}(z)$, implemented in a robust Fortran code supporting double and quadruple (quad) precision. The algorithm overcomes the…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential…
Existing fast algorithms for bilateral and nonlocal means filtering mostly work with grayscale images. They cannot easily be extended to high-dimensional data such as color and hyperspectral images, patch-based data, flow-fields, etc. In…
Universal multiport interferometers (UMIs) have emerged as a key tool for performing arbitrary linear transformations on optical modes, enabling precise control over the state of light in essential applications of classical and quantum…
Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…
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…
We demonstrate a fast spin-s spherical harmonic transform algorithm, which is flexible and exact for band-limited functions. In contrast to previous work, where spin transforms are computed independently, our algorithm permits the…