Related papers: New Algorithms for Computing a Single Component of…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
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…
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
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 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…
This paper presents a new finite difference algorithm for solving the 2D one-way wave equation with a preliminary approximation of a pseudo-differential operator by a system of partial differential equations. As opposed to the existing…
We present an efficient, fast and robust Nonlinear Fourier Transform (NFT) algorithm to detect eigenvalues of the discrete spectrum. It outperforms other known NFT algorithms as it detects the eigenvalues from the continuous spectrum, the…
We introduce a fast algorithm for computing sparse Fourier transforms supported on smooth curves or surfaces. This problem appear naturally in several important problems in wave scattering and reflection seismology. The main observation is…
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms…
This article presents a unified theory for analysis of components in discrete data, and compares the methods with techniques such as independent component analysis, non-negative matrix factorisation and latent Dirichlet allocation. The main…
Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for such algorithms and provide a detailed analysis of the…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
We propose an entropic Fourier method for the numerical discretization of the Boltzmann collision operator. The method, which is obtained by modifying a Fourier Galerkin method to match the form of the discrete velocity method, can be…
In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the…