Fourier Coefficients of Beurling Functions and a Class of Mellin Transform Formally Determined by its Values on the Even Integers
نویسنده
چکیده
n∈Z |c(n)| 2 is a possible tool to compute or estimate this norm. In this note we give an expression for the Fourier coefficients c(n) of f+1, when f is a function defined as above. As an application, we derive an expression for Mf (s) := ∫ 1 0 (f(x)+1)x s−1 dx as a series that only depends on Mf (2k), k ∈ N. We remark that the Fourier coefficients c(n) depend on Mf (2k) which, for a function f defined as above, can be expressed also in terms of the ak’s and θk’s. Therefore, a better control on these parameters will allow to estimate Mf (2k) and therefore eventually to handle ‖f + 1‖ via our expression for the Fourier coefficients and Parsevall Identity.
منابع مشابه
Simulation of Singular Fourth- Order Partial Differential Equations Using the Fourier Transform Combined With Variational Iteration Method
In this paper, we present a comparative study between the modified variational iteration method (MVIM) and a hybrid of Fourier transform and variational iteration method (FTVIM). The study outlines the efficiencyand convergence of the two methods. The analysis is illustrated by investigating four singular partial differential equations with variable coefficients. The solution of singular partia...
متن کاملImageCompression Using Real Fourier Transform, Its Wavelet Transform And Hybrid Wavelet With DCT
This paper proposes new image compression technique that uses Real Fourier Transform. Discrete Fourier Transform (DFT) contains complex exponentials. It contains both cosine and sine functions. It gives complex values in the output of Fourier Transform. To avoid these complex values in the output, complex terms in Fourier Transform are eliminated. This can be done by using coefficients of Discr...
متن کاملFractional Fourier Transform Based OFDMA for Doubly Dispersive Channels
The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...
متن کاملPeriodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملClifford Fourier-Mellin transform with two real square roots of -1 in Cl(p, q), p+q=2
We describe a non-commutative generalization of the complex Fourier-Mellin transform to Clifford algebra valued signal functions over the domain Rp,q taking values in Cl(p,q), p+q = 2.
متن کامل