Related papers: Discrete Fourier Transform Approximations Based on…
In this paper, we investigate the behavior of the Fourier transform on finite dimensional 2-step Lie groups and develop a general theory akin to that of the whole space or the torus. We provide a familiar framework in which computations are…
In this paper we derive formulas for the N-point discrete Fourier transform and the R1 x R2 finite Zak transform of multiplicative characters on Z/N, where N is an odd integer, and R1 and R2 are co-prime factors of N. In one special case…
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by…
Exact reconstruction of an image from measurements of its Discrete Fourier Transform (DFT) typically requires all DFT coefficients to be available. However, incorporating the prior assumption that the image contains only integer values…
We construct in the small-time setting the upper and lower estimates for the transition probability density of a L\'evy process in $\rn$. Our approach relies on the complex analysis technique and the asymptotic analysis of the inverse…
Following the ideas from a paper by the same author, we prove abstract maximal restriction results for the Fourier transform. Our results deal mainly with maximal operators of convolution-type and $r-$average maximal functions. As a…
A mathematical relation between elements of one- and multi-dimensional discrete Fourier transforms (DFT) is found. A method of analysing the multi-dimensional data by their single one-dimensional (1-D) DFT is offered. An experiment of…
In this paper we exploit the umbral calculus framework to reformulate the so-called discrete Cauchy-Kovalevskaya extension in the scope of hypercomplex variables. The key idea is to consider not only formal power series representation for…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
This paper derives the CUR-type factorization for tensors in the Tucker format based on a new variant of the discrete empirical interpolation method known as L-DEIM. This novel sampling technique allows us to construct an efficient…
As the third stage of the project multi-indexed orthogonal polynomials, we present, in the framework of 'discrete quantum mechanics' with pure imaginary shifts in one dimension, the multi-indexed Wilson and Askey-Wilson polynomials. They…
We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…
We establish a connection between semi-primitive roots of the multiplicative group of integers modulo $2^{k}$ where $k\geq 3$, and the logarithmic base in the algorithm introduced by Fit-Florea and Matula (2004) for computing the discrete…
The theory of self-reciprocal functions is applied to the study Mordell type integrals. We find two particular eigenfunctions of the double cosine Fourier transform and then use them to evaluate certain one- and two-dimensional Mordell type…
This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit…
We elucidate why an interval algorithm that computes the exact bounds on the amplitude and phase of the discrete Fourier transform can run in polynomial time. We address this question from a formal perspective to provide the mathematical…
This paper presents an operational framework for the computation of the discretized solutions for relativistic equations of Klein-Gordon and Dirac type. The proposed method relies on the construction of an evolution-type operador from the…
The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications…
We show that a 2-parameter family of $\tau$-functions for the first Painlev\'e equation can be constructed by the discrete Fourier transform of the topological recursion partition function for a family of elliptic curves. We also perform an…