Research article · 2017 · Full text
International Journal of Statistics and Applied MathematicsGeneralization of Fourier and Mellin transforms
Volume 2(4) · Pages 28–32
Research areasFractional Differential Equations Solutions
Abstract
Author-writtenIntegral transform, such as Fourier and Mellin are helpful in providing techniques for solving problems in differential equations. It can be used as a mathematical tool to solve these problems. In this paper, we find the correlation of Fourier transform and Mellin transforms of some function f:R→C and characterizing condition in terms of Mellin transform. This will not only be helpful in solving various differential and integral equations, but also have versatile applications in many fields of applied science.
Summary
Source-checkedPlain-language reading of the full paper, prepared with AI and checked against the text. Each point links to the authors' own words.
Why it matters
- Integral transforms, specifically the Fourier and Mellin transforms, are valuable mathematical tools for solving differential equations. View evidence ↗
- Combining these two transforms results in Fourier-Finite Mellin transforms, which are applied to solve both differential and integral equations. View evidence ↗
- The Mellin transform has diverse applications across science and engineering, including algorithm analysis in computer science and analytic number theory. View evidence ↗
The question
- The paper aims to determine the correlation between Fourier and Infinite Mellin transforms and demonstrate how the Mellin transform can be derived from a Fourier transform for a function f: R → C. View evidence ↗
What they did
- The authors analyze the transforms based on two criteria: that the integral transform is unitary and that the integral kernel is Fourier. View evidence ↗
What they found
- The authors derive that the Mellin transform can be obtained from the Fourier transform by applying a specific substitution and defining a modified function f*(t) = f(t)t^-c. View evidence ↗
- The Mellin transform and its inverse are identified as the Fourier counterparts of the exponential map when passed through a topological isomorphism. View evidence ↗
What it means
- The authors conclude that their result can be extended to a 3x3 identity matrix, which would further refine the characterizing condition of the Mellin transform. View evidence ↗
Visual summary
1 visualsIllustrations explain the paper; they do not show study data.
Isomorphism Mapping
AI-generated conceptual illustration (Abstract mathematical manifolds representing additive and multiplicative groups). It explains the idea and does not show study data.
View source evidence ↗Introduction
The Fourier and Mellin transforms have been used collectively in many fields separately. On combining these two transforms i.e. Fourier-Finite Mellin transforms is obtained. Fourierfinite Mellin transforms are used for solving differential and integral equations. The algebraic properties of Fourier and Mellin transforms are (briefly) worked out in a series of exercises in [8] . For the more algebraically inclined, one can develop an abstract theory of convolution and Fourier analysis on groups. See [7] , or [14] for a full treatment [1, 19 , 11] , and [15] . all cover the Mellin transform, the last two in the probability context [3] . contains an extensive table of Mellin transforms (as well as Fourier, Laplace, and other transforms). A more abstract view is provided by [20] , which includes a treatment of integral transforms of (Schwartz) distributions [5] . contains a very complete treatment of properties of the Mellin transform, with proofs. But here in this paper we find the correlation of Fourier and Infinite Mellin transforms and how Mellin transform can be obtained from a Fourier transform for some function : → , which is helpful for solving differential equations with manifold applications. Important and interesting as those cited references are, we know that the Fourier transform has an inherent complex structure and is (more) naturally defined on R (rather than R+).Here we consider [Q] and use the below criteria (a) The integral transform is unitary. (b) The integral kernel is Fourier. (a) And (b) are understood by well-known Fourier-transform properties:
so that we have = , where denotes the identity operator, and the kernel is ( ) = √2 Thus, the Fourier transform itself is unitary, with a kernel ( ), satisfying both (a)
A characterizing condition on ( ) in terms of the Mellin transform has been obtained in [6] , [15] ( ) (1 -) = 1
is the Mellin transform of .
Interrelation of Mellin and Fourier transform
The Mellin transform of with argument ∈ is defined as
where ≤ ( ) ≤ (if 1 converges for = ∈ , then it can be easily shown that it converges for = + , ∈ ) For ( ) = , the inverse Mellin transform is
For the existence of inverse the condition is that ( ) is analytic in a strip ( , ) × (-∞, ∞) such that ∈ ( , ) [5]. In many engineering texts, statistics, the Fourier transform is defined as
Using the transform and substituting = -( ) for all real ≥ 0
(An aside on the substitution = -( ). The factor of 2π is a consequence of the way we define the Fourier transform. In statistics, and in many engineering texts, the Fourier transform is defined as ( ) = ( ) (essentially measuring frequency in radians per time unit instead of cycles per time unit), which simplifies the derivation of the Mellin transform from the Fourier transform. For a summary of the different ways the Fourier transform and its inverse are represented, see [13] .) The same technique can be used to derive Mellin inverse formula from Fourier inverse transform as
In some cases the transformation provides an easier way to invert Mellin transforms, by using Fourier inversion techniques.
Special case
For a suitable function : → , The Fourier transform of is the integral
for any suitable σ Thus, the Mellin inversion formula says that if the function and are well enough behaved then = iff = Now, easily the integral given below can also be evaluated
Generalized Characterizing condition in terms of Mellin transform Theorem: Let ( ) be a Fourier kernel (on R) such that (a) and (b) are satisfied. This holds if and only if
where ҡ and ҡ are respectively the Mellin transform of and of the Fourier kernel , ҡ ± ( ) = ҡ ± ( ̅ ) , is 2×2 identity matrix and can be analytically continued on .
Proof: For any function with compact support on , we have ( ) + ( ) let ( ) be the Fourier kernel satisfying (a) and (b), and let
taking Mellin transform of (1.2) and (1.3) and using
where ± , ҡ ± and ± are respectively the Mellin transform of ± , ± , ± , we thus have
similarly for reciprocal relation
from (1.4) and (1.5) we conclude (1.1).
Further reading:
Mathematical science is not the only one application area for the Mellin transform and Fourier transform, but many other applications also make the Fourier transform and its variants universal elsewhere in almost all branches of science and engineering, i.e, it has versatile applications in many fields. The Mellin transform is used in computer science for analysis of algorithms (see, for example, [17, ch. 9-10] ); it has applications to analytic number theory [10] ; and Mellin himself developed it in connection with his researches in the theory of functions, number theory, and partial differential equations [18] . The result (1.1) can also be extended in 3 × 3 identity matrix, that will further improve the characterizing condition of Mellin transform.
References
19 in the original paper- Andrews LC, Shivamoggi BK. Integral Transforms for Engineers and Applied Mathematicians. New: Macmillan Publishing, 1988.
- Arveson William. A Short Course on Spectral Theory. New York: Springer, 2002.
- Batemen Harry. Tables of Integral Transforms, Vol. I. New York: McGraw-Hill, 1954.
- Bauer Heinz. Probability Theory. Berlin: Walter de Gruyter, 1996.
- Butzer Paul L, Stefan Jansche. A direct approach to the Mellin trans-form. The Journal of Fourier Analysis and Applications. 1997; 3:325-376.
- Hardy GH, Titchmarsh EC. A class of Fourier kernels, Proc. London Math. Soc. 1933; 35:116-55.
- Davis Harry F. Fourier Series and Orthogonal Functions. New York: Dover Publications, 1989.
- Dym H, McKean HP. Fourier Series and Integrals. New York: Aca-demic Press, 1972.
- Epstein Benjamin. Some applications of the Mellin transform in statistics. The Annals of Mathematical Statistics. 1948; 19:370-379.
- Flajolet Philippe et al. Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science 1995; 144:2-58.
- Giffin Walter C. Transform Techniques for Probability Modeling. New York: Academic Press, 1975.
- Goffman Casper, George Pedrick. First Course in Functional Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1965.
- Hubbard Barbara Burke. The World According to Wavelets, 2nd Edition. Natick, MA: A K Peters, 1998.
- Rudin Walter. Fourier Analysis on Groups. New York: Wiley-Interscience, 1962.
- Watson GN. General transforms, Proc. London Math. Soc. 1933; 35:156-99.
- Springer MD, Thompson WE. The distribution of products of independent random variables. SIAM Journal on Applied Mathematics. 1966; 14:511-526.
- Szpankowski, Wojciech. Average Case Analysis of Algorithms on Sequences. New York: Wiley-Interscience, 2001. 18. University of St. Andrews. Robert Hjalmar Mellin, (biography). http://www-history.mcs.standrews.ac.uk/Biographies/Mellin.html.
- Wolf Kurt B. Integral Transforms in Science and Engineering. New York: Plenum Press, 1979.
- Zemanian AH. Generalized Integral Transforms. New York: Interscience, 1968.

