We consider the problem of secure distributed matrix computation (SDMC), where a user queries function data matrices generated at xmlns:xlink="http://www.w3.org/1999/xlink">source nodes. assume availability <tex-math notation="LaTe...

Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...

We prove a uniform generalized Gaussian bound for the powers of discrete convolution operator in one space dimension. Our is derived under assumption that Fourier transform coefficients trigonometric rational function, which generalizes previous results were restricted to polynomials. also allow modulus attain its maximum at finitely many points over period.

This paper is concerned with the definition of the discrete fractional Fourier transform (DFRFT). First, an eigendecomposition of the discrete Fourier transform (DFT) matrix is derived by sampling the Hermite Gauss functions which are eigenfunctions of the continuous Fourier transform and by performing a novel error removal procedure. Then, the result of the eigendecomposition of the DFT matrix...