Related papers: A numerical method of Fourier transform based on h…
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
A recent generalization of the Central Limit Theorem consistent with nonextensive statistical mechanics has been recently achieved through a generalized Fourier transform, noted $q$-Fourier transform. A representation formula for the…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
This paper deals with the error analysis of the trapezoidal rule for the computation of Fourier type integrals, based on two double exponential transformations. The theory allows to construct algorithms in which the steplength and the…
The two most commonly used hypergeometric functions are the confluent hypergeometric function and the Gauss hypergeometric function. We review the available techniques for accurate, fast, and reliable computation of these two hypergeometric…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
One of the goals of the present paper is to propose an elementary method to find a general formula for the Fourier transform containing a pair of complex gamma functions with a monomial sm in terms of Gauss's hypergeometric functions 2F1.…
The notion of Fourier transformation is described from an algebraic perspective that lends itself to applications in Symbolic Computation. We build the algebraic structures on the basis of a given Heisenberg group (in the general sense of…
The present article is an extended version of [6] containing new results and an updated list of references. We review the notion of polar analyticity introduced in a previous paper and succesfully applied in Mellin analysis and quadrature…
We propose a new class of generative diffusion models, called functional diffusion. In contrast to previous work, functional diffusion works on samples that are represented by functions with a continuous domain. Functional diffusion can be…
Quaternionic analysis relies heavily on results on functions defined on domains in $\mathbb R^4$ (or $\mathbb R^3$) with values in $\mathbb H$. This theory is centered around the concept of $\psi-$hyperholomorphic functions i.e.,…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
The Fourier transform operation is an important conceptual as well as computational tool in the arsenal of every practitioner of physical and mathematical sciences. We discuss some of its applications in optical science and engineering,…
We present an overview of the existing methods for computing functional determinants, and outline a possible way forward for Hamiltonians of higher dimensions without radial symmetry.
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the fourth paper, the application of the Fourier series multiscale method to the…
In this article, we deal with the efficient computation of the Wright function in the cases of interest for the expression of solutions of some fractional differential equations. The proposed algorithm is based on the inversion of the…
In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…
The "theoretical limit of time-frequency resolution in Fourier analysis" is thought to originate in certain mathematical and/or physical limitations. This, however, is not true. The actual origin arises from the numerical (technical) method…