Next Article in Journal
Layered Growth of 3D Snowflake Subject to Membrane Effect and More than One Nucleation Center by Means of Cellular Automata
Next Article in Special Issue
Strict Stability of Fractional Differential Equations with a Caputo Fractional Derivative with Respect to Another Function
Previous Article in Journal
Resource Allocation Optimization Model for Computing Continuum
Previous Article in Special Issue
AGTM Optimization Technique for Multi-Model Fractional-Order Controls of Spherical Tanks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Inversion of the Mellin Convolution

by
Gabriel Bengochea
1,
Manuel Ortigueira
2,* and
Fernando Arroyo-Cabañas
1
1
Colegio de Ciencia y Tecnología, Universidad Autónoma de la Ciudad de México, Ciudad de México 09790, Mexico
2
CTS-UNINOVA and LASI, NOVA School of Science and Technology, NOVA University of Lisbon, Quinta da Torre, 2829-516 Caparica, Portugal
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(3), 432; https://doi.org/10.3390/math13030432
Submission received: 24 December 2024 / Revised: 23 January 2025 / Accepted: 25 January 2025 / Published: 28 January 2025
(This article belongs to the Special Issue Fractional Calculus and Mathematical Applications, 2nd Edition)

Abstract

:
The deconvolution of the Mellin convolution is studied for a great variety of functions that are expressed in terms of α –log-exponential monomials. It is shown that the generation of pairs of functions satisfying a Sonin-like condition can be worked as a deconvolution process. Applications of deconvolution to scale-invariant linear systems are presented.

1. Introduction

As the Duhamel convolution plays a very important role in modulating and describing linear shift-invariant systems [1,2,3,4], the Mellin convolution plays the same role in scale-invariant systems [5,6,7,8,9,10,11]. This has a deep connection with several applications in physics and engineering for dealing with multi-scale wavelet analyses and self-similarity problems [12,13,14,15,16,17].
While the Laplace transform plays an important role in studying shift-invariant systems, the same role is performed by the Mellin transform. Its history is connected to that of the gamma function
Γ ( ν ) = 0 e t t ν 1 d t ,
and its relation with the exponential function
e τ = 1 2 π i γ Γ ( t ) τ t d t ,
where γ is a vertical straight line in the complex plane. The first formula is due to Euler and the second one Pincherle; see [18]. Riemann was the first to apply the Mellin transform to the zeta function problem, but it was Mellin who began to apply a special treatment of this transform that usually is defined by [9,18,19]
G ( ν ) = M g ( τ ) = 0 g ( t ) t ν 1 d t ,
and provided conditions of existence. The number of applications in science and engineering has been increasing in recent times, for example, in economics [20], electromagnetism [21], physics [22], signal processing [23], etc. Currently, one of the main challenges is to extend the Mellin transform theory to the fractional system applications [9,24,25,26].
The Mellin convolution (MC) results from the Mellin transform product defined by
x ( τ ) g ( τ ) = 0 x τ η g ( η ) d η η ,
and verifying
M x ( τ ) g ( τ ) = M x ( τ ) M g ( τ ) .
Let g ( τ ) , h ( τ ) , τ R + , be two functions and consider their convolution. When there exists a third function h 1 ( τ ) such that g ( τ ) h ( τ ) h 1 ( τ ) = g ( τ ) , we say that the convolution is invertible and that h ( τ ) and h 1 ( τ ) are convolutionally inverse h 1 ( τ ) h ( τ ) = δ ( τ 1 ) , where δ ( . ) is the Dirac impulse.
These relations constitute the basis for inverting the MC. As we will show, it may happen that this inversion (deconvolution) leads to singular solutions. One of our main objectives is to avoid and solve such problems. To achieve this, we follow quite closely the Abel–Sonin-like procedure [27,28] to express the solutions in terms of linear combinations of α –log-exponential functions and other functions resulting from certain modifications of these. To our knowledge, there are no works related to the extension of the Sonin condition to the Mellin convolution case. Another of our main objectives is to systematize the deconvolution process of (2). For this purpose, we rely on an algebraic version of the Mellin convolution [10] and the α –log-exponential functions.
Among the referred applications to scale-invariant system deconvolution, we can cite others like [29,30,31,32,33].
This article is structured as follows. Section 2 contains the preliminary results for the development of our work. In Section 3, we deduce the broader Sonin condition from the concept of being convolutionally inverse and solve some examples. We prove that convolutionally inverse implies a broader Sonin condition. In Section 4, we show how we can find convolutionally inverse pairs of different functions. Section 5 contains some applications of our results to scale-invariant linear systems. Finally, the conclusions are presented in Section 6.

2. Properties of Mellin Convolution

Let g ( τ ) be a piecewise continuous function. We redefine the Mellin transform [9] of g ( τ ) as
G ( ν ) = M g ( τ ) = 0 g ( t ) t ν 1 d t ,
where we make a substitution ν ν for establishing better parallelism with the Laplace transform. If g ( τ ) is a function with bounded variation, locally integrable (in the sense that the function is absolutely integrable in any real interval [ a , b ] , so that a b | g ( τ ) | d τ < , and of polynomial order, then there exists its Mellin transform in a vertical strip in the complex plane (see Remark 1). However, due to the interest in our application, we assume that (4) can be extended into the distributional setup, by assuming that g ( τ ) is a tempered distribution [34], so that we work exclusively with functions having a Mellin transform.
Remark 1.
A function g ( τ ) is of polynomial order if
  • For τ 0 + , there are real constants A, a > 0 , such that | g ( τ ) | < A · τ a when τ is small (say, for τ < τ 1 R + );
  • For τ , there are real constants B, b > 0 , such that | g ( τ ) | < B · τ b , when τ is large (say, for τ > τ 2 R + );
  • It holds that b < a .
Under these conditions, the integral in (4) converges absolutely and uniformly in a vertical strip in the complex plane defined by b < ( ν ) < a , where G ( ν ) is analytic. Therefore, if g ( τ ) and x ( τ ) satisfy the existence conditions of (4), then (2) is well defined and (3) is valid.
We recall the definition of the Mellin convolution (2):
x ( τ ) g ( τ ) = 0 x τ η g ( η ) d η η .
We summarize some of the main properties of the Mellin convolution:
  • The Mellin convolution is commutative and associative, and its unit element is δ ( τ 1 ) .
    x ( τ ) δ ( τ 1 ) = x ( τ ) .
  • For τ R + and ν C , it is true that
    τ ν g ( τ ) = G ( ν ) τ ν ,
    meaning that τ ν is an eigenfunction of the Mellin convolution with an eigenvalue of the Mellin transform of g ( τ ) , G ( ν ) ).
  • For α R + [10]
    M 1 v α ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) , R e ( v ) > 0 .
    This power function has the following property:
    ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) ln m α 1 ( τ ) Γ ( m α ) ε ( τ 1 ) = ln ( n + m ) α 1 ( τ ) Γ ( ( n + m ) α ) ε ( τ 1 ) , n , m Z .
    This property is of great importance because of the structure of α –log-exponential monomials.
  • The Parseval equality holds true:
    0 x τ η g ( η ) d η η = 1 2 π j γ j γ + j X ( s ) G ( s ) τ s d s .
The Mellin convolution serves to define three types of scale-invariant systems according to the impulse response characteristic (2):
  • If g ( τ ) is not identically null for any interval in R + , it defines the bilateral systems represented by (2).
    y ( τ ) = x ( τ ) h ( τ ) = 0 x τ η g ( η ) d η η .
  • The case where g ( τ ) 0 , τ < 1 defines the right systems that output the response y ( τ ) is given by
    y ( τ ) = x ( τ ) h ( τ ) = 1 τ x τ η g ( η ) d η η .
  • When g ( τ ) 0 , τ > 1 , the left systems are defined by
    y ( τ ) = x ( τ ) h ( τ ) = τ 1 x τ η g ( η ) d η η .
Due to the deep relation with scale systems, we focus on the Hadamard right (left) derivative [9].
Definition 1.
Let α R . We define the α-order scale derivative (SD) as the operator D s ± α obeying the rule
D s ± α τ v = v α τ v , τ R + , v C ,
for R e ( v ) > 0 (expansion or stretching case D s + α ) or R e ( v ) < 0 (shrinking case D s α ).
The conditions ( v ) > 0 and ( v ) < 0 lead to the cases τ 1 (right) and 0 < τ 1 (left), respectively. The work developed in this article is focused on the case τ 1 ; the other case is similar. The condition τ 1 leads us to consider right systems (7). Therefore, if h ( τ ) is the impulse response of such a system, then the step response is given by
r ε ( τ ) = h ( τ ) ε ( τ 1 ) = 0 h τ ν ε ( ν 1 ) d ν ν = 1 h τ ν d ν ν .
Based on the derivative presented in Definition 1, we have the following properties.
  • For a function x ( τ ) with a Mellin transform X ( v ) , it follows that
    M D s + α x ( τ ) = v α X ( v ) ,
  • D s + α ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) = ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) , k Z ,
  • D s + 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) = M 1 v ( k α + 1 ) = ln k α ( τ ) Γ ( k α + 1 ) ε ( τ 1 ) .
These relations suggest us to introduce a very important function for the following developments.
Definition 2.
Let us define the α–log-exponential monomials of order n by
E γ , n ( τ ) = k = n + 1 k 1 n γ k n 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) , γ C , n N 0 .
We can show that
M E γ , n ( τ ) = 1 ν α γ n + 1 ,
which is very important in inverting transforms that are expressed as quotients of polynomials.

3. Sonin-like Condition

In 1823, Abel presented the generalization of a tautochrone problem [35] whose solution gave rise to one of the first integral equations
ϕ ( t ) = 0 t s ( t ) ( t τ ) α d τ , t 0 , 0 < α < 1 ,
where s ( t ) is the solution. Interestingly, (12) is the usual shift-invariant convolution
ϕ ( t ) = t α s ( t ) .
Abel’s procedure for solving the integral Equation (12) was essentially an algorithm for inverting a linear convolution, suitable for dealing with a singular kernel (impulse response).
In 1884, Sonin published some result related a Abel’s solution [36]. He noted that many of Abel’s results were supported by the formula
t α 1 Γ ( α ) t α Γ ( α + 1 ) = d d t t α Γ ( α + 1 ) t α Γ ( α + 1 ) = ε ( t ) .
Sonin verified that Abel, by solving (12), had indeed performed a deconvolution. That is, Abel found a function θ ( t ) such that θ ( t ) t α = δ ( t ) . Convolving on both sides (13) by θ ( t ) , we obtain
ϕ ( t ) θ ( t ) = s ( t ) t α θ ( t ) = s ( t ) δ ( t ) = s ( t ) .
It is clear that θ ( t ) = d d t 1 Γ ( α + 1 ) t α 1 Γ ( α ) ε ( t ) since
d d t 1 Γ ( α + 1 ) t α 1 Γ ( α ) ε ( t ) t α = d d t t α 1 Γ ( α ) t α Γ ( α + 1 ) = d d t ε ( t ) = δ ( t ) .
The work of Sonin did not stop there. He observed that by generalizing Formula (14) by means of convolution
κ ( t ) k ( t ) = ε ( t ) ,
it was possible to solve integral equations. For example, the integral equation of the first kind
0 t k ( t s ) u ( s ) d s = k ( t ) u ( t ) = f ( t ) ,
where u ( t ) is a unknown function and k ( t ) , f ( t ) are known functions. This problem is steeped in history and solving it is not easy. It is true that not all functions have a Sonin partner, but suppose that κ ( t ) is the Sonin partner of k ( t ) . Then, the solution of (17) can be expressed as
u ( t ) = d d t κ ( t ) f ( t ) ,
See [37]. One can easily verify this by seeing that
k ( t ) u ( t ) = k ( t ) d d t κ ( t ) f ( t ) = d d t k ( t ) κ ( t ) f ( t ) = d d t ε ( t ) f ( t ) = d d t ε ( t ) f ( t ) = δ ( t ) f ( t ) = f ( t ) .
This is one of the most important reasons for studying the Sonin condition.
For the case of the Mellin convolution, we consider a more general case of Abel’s procedure stated as follows:
g ( τ ) h ( τ ) = δ ( τ 1 ) ,
where h ( τ ) is known and g ( τ ) is unknown. Compute the Mellin transform on both sides to obtain
G ( ν ) · H ( ν ) = 1 ,
for a suitable region R . From this, the problem can be solved by making
G ( ν ) = 1 / H ( ν ) ,
and computing
g ( τ ) = M 1 G ( ν ) .
Example 1.
Consider the function
g ( τ ) = n = 0 2 n ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) , α 0 .
We want to compute its convolutionally inverse. We know that
M ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) = ν n α , α 0 , n N .
and
M ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = 1 .
Hence,
G ( ν ) = n = 0 2 ν α n .
The previous series converges for R e ( ν ) > | ν | > 2 1 / α ; then
G ( ν ) = 1 1 2 ν α = ν α ν α 2 ,
implying that its inverse has a Mellin transform
H ( ν ) = ν α 2 ν α = 1 2 1 ν α .
Therefore,
h ( τ ) = δ ( τ 1 ) 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) ,
which is an almost regular function [28].
The procedure in the previous example may present certain difficulties when one of the functions is singular. Consider a modification in the previous example.
Example 2.
Consider a function with a Mellin transform given by
G ( ν ) = ν α β ν α 2 .
where α , β R + . Therefore, its inverse has a Mellin transform
H ( ν ) = ν α β 2 ν α β = ν β 2 ν β ν α ,
whose inverse transform is an irregular function.
To see how we can avoid the previous difficulty, consider the equation
ν G ( ν ) · ν 1 H ( ν ) = 1 ,
But one of them is singular, which makes it difficult to obtain g ( τ ) . To avoid this type of difficulty, we “transfer” the singular behavior to another place. Consider g ( τ ) in the previous example, which has a singularity of the type τ β , β > 0 . We can proceed as follows. Rewrite (20) to obtain
G ( ν ) · ν 1 H ( ν ) = 1 ν .
Now, ϕ ( τ ) = M 1 ν 1 H ( ν ) is a regular function. In fact, by (8), we have
G ( ν ) · M D s + 1 h ( τ ) = 1 ν ,
which leads us to
g ( τ ) ϕ ( τ ) = M 1 1 ν = ε ( τ 1 ) ,
where
ϕ ( τ ) = D s + 1 h ( τ ) , ( the anti - derivative of h ( τ ) ) .
If the roles are now reversed, h ( τ ) is an unknown function and g ( τ ) is a known function, we proceed in a similar manner to the above and arrive at
ψ ( τ ) h ( τ ) = ε ( τ 1 ) ,
where
ψ ( τ ) = D s + 1 g ( τ ) , ( the anti - derivative of g ( τ ) ) .
The function ψ ( τ ) is the step response of the system. We can invert the roles of the functions and write
ϕ ( τ ) g ( τ ) = ψ ( τ ) h ( τ ) = ε ( τ 1 ) .
This will be called a Sonin-like condition. We have two pairs ( ϕ , g ) and ( h , ψ ) ; see Figure 1. Each member of a pair is called a partner.
Computing the Mellin transform and using the well-known result M ε ( τ 1 ) = 1 ν , see (5), we obtain
Ψ ( ν ) · H ( ν ) = Φ ( ν ) · G ( ν ) = 1 ν , ν R C + ,
which expresses the Sonin-like condition in terms of a Mellin transform. This result can be extended by exchanging ε ( τ 1 ) by ln ( τ ) ε ( τ 1 ) in (21). We obtain
ϕ ( τ ) g ( τ ) = ψ ( τ ) h ( τ ) = ln ( τ ) ε ( τ 1 ) ,
or, in terms of the Mellin transform,
Ψ ( ν ) · H ( ν ) = Φ ( ν ) · G ( ν ) = 1 ν 2 , ν R C + .
So, a wider Sonin-like condition is obtained. It is clear that we can go ahead and generalize this result, but we do not generalize it.
Example 3.
Consider the transfer function of a linear system with simple poles p 1 , p 2 and its multiplicative inverse
G ( ν ) = ( ν + z 1 ) ( ν + z 2 ) ( ν + p 1 ) ( ν + p 2 ) = 1 + c 1 ν + p 𝟤 + c 2 ν + p 𝟣 ,
with c 1 = p 𝟤 2 z 𝟣 p 𝟤 p 𝟤 z 𝟤 + z 𝟣 z 𝟤 p 𝟤 + p 𝟣 , c 2 = p 𝟣 2 + z 𝟣 p 𝟣 + p 𝟣 z 𝟤 z 𝟣 z 𝟤 p 𝟤 + p 𝟣 , and
H ( ν ) = ( ν + p 1 ) ( ν + p 2 ) ( ν + z 1 ) ( ν + z 2 ) = 1 + c 3 ν + z 𝟤 + c 4 ν + z 𝟣 ,
with c 3 = z 𝟤 2 p 𝟣 z 𝟤 z 𝟤 p 𝟤 + p 𝟣 p 𝟤 z 𝟤 + z 𝟣 , c 4 = z 𝟣 2 + p 𝟣 z 𝟣 + z 𝟣 p 𝟤 p 𝟣 p 𝟤 z 𝟤 + z 𝟣 . Hence,
g ( τ ) = δ ( τ 1 ) + c 1 k = 1 ( p 2 ) k 1 ln k 1 ( τ ) Γ ( k ) ε ( τ 1 ) + c 2 k = 1 ( p 1 ) k 1 ln k 1 ( τ ) Γ ( k ) ε ( τ 1 ) ,
and
h ( τ ) = δ ( τ 1 ) + c 3 k = 1 ( z 2 ) k 1 ln k 1 ( τ ) Γ ( k ) ε ( τ 1 ) + c 4 k = 1 ( z 1 ) k 1 ln k 1 ( τ ) Γ ( k ) ε ( τ 1 ) .
We convolve g ( τ ) with ln β 1 ( τ ) Γ ( β ) ε ( τ 1 ) and obtain
g β ( τ ) = g ( τ ) ln β 1 ( τ ) Γ ( β ) ε ( τ 1 ) = ln β 1 ( τ ) Γ ( β ) ε ( τ 1 ) + c 1 k = 1 ( p 2 ) k 1 ln k + β 1 ( τ ) Γ ( k + β ) ε ( τ 1 ) + h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h c 2 k = 1 ( p 1 ) k 1 ln k + β 1 ( τ ) Γ ( k + β ) ε ( τ 1 ) .
This can be rewritten as
g β ( τ ) = ln β 1 ( τ ) ε ( τ 1 ) · 1 Γ ( β ) + c 1 k = 1 ( p 2 ) k 1 ln k ( τ ) Γ ( k + β ) ε ( τ 1 ) + c 2 k = 1 ( p 1 ) k 1 ln k ( τ ) Γ ( k + β ) ε ( τ 1 ) .
Observe that
G β ( ν ) = ν β + c 1 k = 1 ( p 2 ) k 1 ν k β + c 2 k = 1 ( p 1 ) k 1 ν k β ,
From (19) and (23) ( G β ( ν ) = G ( ν ) · ν β ), we obtain
H β ( ν ) = 1 G β ( ν ) = ν β H ( ν ) = ν β 1 + c 3 ν + z 𝟤 + c 4 ν + z 𝟣 .
The convolutionally inverse of g β ( τ ) is given by
h β ( τ ) = ln β 1 ( τ ) Γ ( β ) ε ( τ 1 ) + c 3 k = 1 ( z 2 ) k ln k β ( τ ) Γ ( k β + 1 ) ε ( τ 1 ) + c 4 k = 1 ( z 1 ) k ln k β ( τ ) Γ ( k β + 1 ) ε ( τ 1 ) .
This function is singular. For its Sonin partner, we turn to (22) and obtain
Φ β ( ν ) = ν β 1 H ( ν ) = ν β 1 + c 3 ν β 1 ν + z 𝟤 + c 4 ν β 1 ν + z 𝟣 ,
which leads to
ϕ β ( τ ) = ln β ( τ ) Γ ( β + 1 ) ε ( τ 1 ) + c 3 k = 1 ( z 2 ) k 1 ln k β + 1 ( τ ) Γ ( k β + 2 ) ε ( τ 1 ) + c 4 k = 1 ( z 1 ) k 1 ln k β + 1 ( τ ) Γ ( k β + 2 ) ε ( τ 1 ) .
Remark 2.
It is appropriate at this point to clarify that from (19), we can obtain the broader Sonin condition (21). Hence, we focus on finding the convolutionally inverse of the pair g ( τ ) and h ( τ ) .

4. Mellin Deconvolution Problem

Consider a scale-invariant system with a transfer function H ( ν ) and input signal x ( τ ) . The usual way to find the output signal y ( τ ) (response of a system) is by means of the convolution
y ( τ ) = x ( τ ) h ( τ ) ,
where h ( τ ) = M 1 [ H ( ν ) ] is the impulse response. The procedure of finding the output signal is well systematized; see [19]. Now, consider that we have a system where we know either the input-output signals or the transfer function and output signal. In the first case, we need to find the transfer function H ( ν ) (identification problem), and in the second case we need to find input signal x ( τ ) (deconvolution problem, see Figure 2), respectively. These problems are much more generally in their resolution, and they are not systematized. Here, we deal with the deconvolution problem. The deconvolution problem can be posed as follows: suppose that in (24) we found g ( τ ) such that g ( τ ) h ( τ ) = δ ( τ 1 ) ; then, the input signal x ( τ ) can be described as the convolution
x ( τ ) = y ( τ ) g ( τ ) .
When H ( ν ) is an unfavorable function, the deconvolution problem can be related to the class of so-called ill-posed problems [38].
If we consider that g ( τ ) and h ( τ ) are convolutionally inverse; then,
G ( ν ) · H ( ν ) = 1 .
Definition 3.
Let a k , k = k 0 , k 0 + 1 , , k 0 N 0 , be a discrete-time function of exponential order, for k > K N and α > 0 . We define the α-logarithm power series of order k 0 by
g ( τ ) = k = k 0 a k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
and the ( α , β ) -logarithm power series by
g ( τ ) = k = k 0 a k ln β + k α 1 ( τ ) Γ ( β + k α ) ε ( τ 1 ) , β > 0 .
Their Mellin transforms are
G ( ν ) = k = k 0 a k ν k α ,
and
G ( ν ) = ν β k = k 0 a k ν k α ,
respectively. These series converge when ( ν ) > γ , where γ depends on the sequence a k .
Remark 3.
If, in Definition 3, we allow k 0 Z , then we obtain a α-logarithm Laurent series. We denote by F the vector space generated by an α-logarithm Laurent series using the usual addition and scalar product. Moreover, if we incorporate the multiplication of two series by means of the Cauchy product using the Mellin convolution, then in [39] it is proven that F is a field. This is an important result since it would tell us that any Laurent series in F has its convolutionally inverse in F . The proof of this fact does not explicitly show us the convolutionally inverse partner.
In [10], it is shown that the convolution of two functions of the type (10) can be rewritten as a linear combination of functions of the same type. This is, for γ 1 γ 2 ,
E γ 1 , 0 ( τ ) E γ 2 , 0 ( τ ) = E γ 1 , 0 ( τ ) E γ 2 , 0 ( τ ) γ 1 γ 2 ,
and
E γ 1 , m ( τ ) E γ 2 , n ( τ ) = l = 0 m n + l l ( 1 ) l ( γ 1 γ 2 ) 1 + n + l E γ 1 , m l ( τ ) + k = 0 n m + k k ( 1 ) k ( γ 2 γ 1 ) 1 + m + k E γ 2 , n k ( τ ) .
When γ 1 = γ 2 , we have that
E γ , m ( τ ) E γ , n ( τ ) = E γ , m + n + 1 ( τ ) .
As we already mentioned in Remark 3, finding convolutionally inverse pairs is not simple. Here, we advance on the topic.
We recall that [34]
ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 ) .
Theorem 1.
Let γ C , and α R + . Consider the α–log-exponential monomial of order zero [10]
E γ , 0 ( τ ) = k = 1 γ k 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Hence, the convolutionally inverse of E γ , 0 ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) .
Moreover, the Sonin partner of E γ , 0 ( τ ) is given by
ϕ ( τ ) = D s + 1 h ( τ ) = ln α ( τ ) Γ ( α + 1 ) ε ( τ 1 ) γ ε ( τ 1 ) ,
and the Sonin partner of h ( τ ) is
ψ ( τ ) = D s + 1 E γ , 0 ( τ ) = k = 1 γ k 1 ln k α ( τ ) Γ ( k α + 1 ) ε ( τ 1 ) .
The proof of Theorem 1 is given in Appendix A.
We extend Theorem 1 to the case of α –log-exponential monomials of order n. We no longer stop to find Sonin pairs due to the simplicity of their computation from convolutionally inverses. We denote
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 t i m e s .
Theorem 2.
Let n N 0 , γ C , and α R + . Consider the α–log-exponential monomial of order n [10]:
E γ , n ( τ ) = k = n + 1 k 1 n γ k n 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Hence, the convolutionally inverse of E γ , n ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = k = 0 n + 1 ( 1 ) k n + 1 k γ k ln ( n + 1 k ) α 1 ( τ ) Γ ( ( n + 1 k ) α ) ε ( τ 1 ) .
The proof of Theorem 2 is given in Appendix A.
Remark 4.
Let
g ( τ ) = k = 0 l c k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) , l 1 .
It is not difficult to see that g ( τ ) can be rewritten as
g ( τ ) = c l k = 0 l 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r k ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ,
where r k s are the roots of the polynomial x l + c l 1 c l x l 1 + c 1 c l x + c 0 c l .
We can go even further by finding the convolutionally inverse of a linear combination of α –log-exponential monomials.
Remark 5.
Theorem 3 can be extended to the case of k = 1 N c k E γ k , n k ( τ ) , but because the accounts are very cumbersome, we prefer not to present them here. Instead, we prefer to present some examples.
Theorem 3.
Let
g ( τ ) = c 1 E γ 1 , n 1 ( τ ) + c 2 E γ 2 , n 2 ( τ ) , γ 1 γ 2 ,
be a non-null function with c 1 , c 2 R . Then, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 1 R k = 0 M 1 E r k , 0 ( τ )
where M = max ( n 1 + 1 , n 2 + 1 ) ; r k s are the roots of the monic polynomial 1 R ( c 1 ( x γ 2 ) n 2 + 1 + c 2 ( x γ 1 ) n 1 + 1 ) (we consider that 1 / R makes the polynomial monic).
The proof of Theorem 3 is given in Appendix A.
The convolutionally inverse h ( τ ) presented in Theorem 3 can be simplified using the Formulas (A1), (26), and (27). We illustrate this in the following examples.
Example 4.
Let
g ( τ ) = c 1 E γ 1 , 0 ( τ ) + c 2 E γ 2 , 0 ( τ ) , γ 1 γ 2 ,
with constants c 1 , c 2 and c 1 + c 2 0 . From Theorem 3, we have that
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 1 R E r 0 , 0 ( τ ) ,
where R = c 1 + c 2 and r 0 = c 1 γ 2 + c 2 γ 1 c 1 + c 2 . We can simplify h ( τ ) using (A1). We have that
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) g g g g g g g g g g g g ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = g g g g g g g g g g g g g g g ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) ( γ 1 + γ 2 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + γ 1 γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) .
Hence,
h ( τ ) = ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) 1 R E r 0 , 0 ( τ ) γ 1 + γ 2 R ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 0 , 0 ( τ ) + γ 1 γ 2 R E r 0 , 0 ( τ ) .
We recall that E r 0 , 0 ( τ ) = k = 1 r 0 k 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) . Finally,
h ( τ ) = 1 R k = 1 r 0 k 1 ln ( k 2 ) α 1 ( τ ) Γ ( ( k 2 ) α ) ε ( τ 1 ) γ 1 + γ 2 R k = 1 r 0 k 1 ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) + γ 1 γ 2 R k = 1 r 0 k 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Example 5.
Consider
g ( τ ) = 2 E γ 1 , 0 ( τ ) + E γ 2 , 1 ( τ ) , γ 1 γ 2 .
Applying algebraic manipulation and Theorem 2, we can rewrite g ( τ ) as
g ( τ ) = 2 E γ 1 , 0 ( τ ) E γ 2 , 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 h h h h h h h h h h h h E γ 1 , 0 ( τ ) E γ 2 , 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = E γ 1 , 0 ( τ ) E γ 2 , 1 ( τ ) h h h h h h h h h h h h 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 + h h h h h h h h h h h h h h h h h h h h h h ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 .
Observe that
2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 + ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = 2 ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) ( 4 γ 2 + 1 ) 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( 2 γ 2 2 + γ 1 ) 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 )
Let r 1 , r 2 be the roots of the polynomial x 2 4 γ 2 + 1 2 x + 2 γ 2 2 + γ 1 2 . Hence,
2 ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) ( 4 γ 2 + 1 ) 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( 2 γ 2 2 + γ 1 ) 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) h h h h h h h h h h h h h h h h h h 1 2 E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) = δ ( τ 1 ) .
Finally, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) f f f f f f f ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 1 2 E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) .
We can simplify these convolutions as follows. Observe that
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 = f f f f f f f ln 3 α 1 ( τ ) Γ ( 3 α ) ε ( τ 1 ) ( 2 γ 2 + γ 1 ) ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) + f f f f h h h h h h h f f f ( γ 2 2 + 2 γ 1 γ 2 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 γ 2 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ,
and from (26)
1 2 E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) = E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) 2 ( r 2 r 1 ) .
Therefore,
h ( τ ) = 1 2 ( r 2 r 1 ) ln 3 α 1 ( τ ) Γ ( 3 α ) ε ( τ 1 ) E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) f f f f f ( 2 γ 2 + γ 1 ) ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) f f f f f f f f f + ( γ 2 2 + 2 γ 1 γ 2 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j ln 3 α 1 ( τ ) Γ ( 3 α ) γ 1 γ 2 2 E r 1 , 0 ( τ ) E r 2 , 0 ( τ ) ,
where the last convolutions are easy to calculate.
We now add an impulse to the α –log-exponential monomial E γ , n ( τ ) .
Theorem 4.
Define
g ( τ ) = δ ( τ 1 ) + c 1 E γ , n ( τ ) ,
with the constant c 1 . Then, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 k = 0 n E r k , 0 ( τ ) ,
where r k s are the roots of the polynomial ( x γ ) n + 1 + c 1 .
The proof of Theorem 4 is given in Appendix A.
We solve another example.
Example 6.
Let
g ( τ ) = δ ( τ 1 ) + c 1 E γ , 0 ( τ ) ,
with the constant c 1 . From Theorem 2, we know that
E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 ) .
We recall that δ ( τ 1 ) = ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) . It follows that
g ( τ ) = E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) + c 1 E γ , 0 ( τ ) = E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) ( γ c 1 ) ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) .
In this case, r 0 = γ c 1 is the root of the polynomial x ( γ c 1 ) . So, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E γ c 1 , 0 ( τ ) = k = 1 ( γ c 1 ) k 1 ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) γ E γ c 1 , 0 ( τ ) = δ ( τ 1 ) + ( γ c 1 ) E γ c 1 , 0 ( τ ) γ E γ c 1 , 0 ( τ ) = δ ( τ 1 ) c 1 E γ c 1 , 0 ( τ ) .
Example 7.
Consider
g ( τ ) = δ ( τ 1 ) + E γ , 1 ( τ ) .
Then, from Theorem 2,
E γ , 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) 2 = δ ( τ 1 ) .
It follows that g ( τ ) can be decomposed into the following convolution:
g ( τ ) = E γ , 1 ( τ ) ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( γ 2 + 1 ) ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 )
Suppose that r 0 , r 1 are the roots of the polynomial x 2 2 γ x + γ 2 + 1 . Hence,
ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( γ 2 + 1 ) ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = ln α 1 ( τ ) Γ ( α ) r 0 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) ln α 1 ( τ ) Γ ( α ) r 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) .
We recall that
ln α 1 ( τ ) Γ ( α ) r 0 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E r 0 , 0 ( τ ) = δ ( τ 1 ) ,
and
ln α 1 ( τ ) Γ ( α ) r 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E r 1 , 0 ( τ ) = δ ( τ 1 ) .
This leads us to
ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) h h h h h h h h h h h h h h h h h h h h h h h h h h h h E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) = δ ( τ 1 ) .
Hence, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) .
If we suppose that r 1 r 2 , then, from (26), E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) = E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1 . It follows that
h ( τ ) = 1 r 0 r 1 ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) E r 0 , 0 ( τ ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 0 , 0 ( τ ) + γ 2 E r 0 , 0 ( τ ) g g 1 r 0 r 1 ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) E r 1 , 0 ( τ ) 2 γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 1 , 0 ( τ ) + γ 2 E r 1 , 0 ( τ ) .
Simplifying, we obtain
h ( τ ) = 1 r 0 r 1 k = 1 ( r 0 k 1 r 1 k 1 ) ln ( k 2 ) α 1 ( τ ) Γ ( ( k 2 ) α ) ε ( τ 1 ) g g g g g g g g g g g g g g 2 γ k = 1 ( r 0 k 1 r 1 k 1 ) ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) + g g g g g g g g g g g g g g g g g g g γ 2 k = 1 ( r 0 k 1 r 1 k 1 ) ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
We can also add a linear combination of terms of the type ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) , k Z . The following is an example of how to do this.
Example 8.
Let us consider
g ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + δ ( τ 1 ) + c 1 E γ , 0 ( τ ) ,
where c 1 is a real constant. It is not difficult to see that
E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 ) ,
and
E γ , 0 ( τ ) ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) γ ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) .
Hence,
g ( τ ) = E γ , 0 ( τ ) ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) + ( 1 γ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( c 1 γ ) δ ( τ 1 ) .
Let r 0 , r 1 be the roots of polynomial x 2 + ( 1 + γ ) x + c 1 γ . Hence,
ln 2 α 1 ( τ ) Γ ( 2 α ) ε ( τ 1 ) + ( 1 γ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) + ( c 1 γ ) δ ( τ 1 ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r 0 δ ( τ 1 ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r 1 δ ( τ 1 ) .
Suppose that r 0 r 1 . Therefore,
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1 = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1 γ E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1 = 1 r 0 r 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 0 , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 1 , 0 ( τ ) h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h γ E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1
Observe that
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E r 0 , 0 ( τ ) = δ ( τ 1 ) + r 0 E r 0 , 0 ( τ ) .
Finally, the convolutionally inverse of g ( τ ) is
h ( τ ) = 1 r 0 r 1 r 0 E r 0 , 0 ( τ ) r 1 E r 1 , 0 ( τ ) γ E r 0 , 0 ( τ ) E r 1 , 0 ( τ ) r 0 r 1 = r 0 γ r 0 r 1 E r 0 , 0 ( τ ) r 1 γ r 0 r 1 E r 1 , 0 ( τ ) .
These results can be extended to the case k = 0 M ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) + k = 1 N c k E γ k , n k ( τ ) , but we do not develop it.
In a straightforward way, we can find the convolutionally inverse pairs of any series of the type (25). We present this in the next theorem.
Theorem 5.
Let g ( τ ) be an α-logarithm power series as in (25) and h ( τ ) the α-logarithm Laurent series
h ( τ ) = M 1 H ( ν ) = k = m 0 b k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) , m 0 Z .
These series are convolutionally inverses if and only if
m = 0 n a m + m 0 b n m m 0 = δ n , n 0 ,
where δ n , n Z , is the Kronecker delta.
The proof of Theorem 5 is given in Appendix A. In the proof of Theorem 5, a very important fact is deduced: k 0 = m 0 .
Example 9.
Let N N . We know that for τ > 1 , g ( τ ) satisfies
g ( τ ) = τ N = n = 0 N n n ! ln n ( τ ) ε ( τ 1 ) .
Then,
G ( ν ) = n = 0 N n M ln n ( τ ) n ! ε ( τ 1 ) = n = 0 N n ν n = ν ν N ,
when ( N ν ) < 1 . We can compute the coefficients of convolutionally inverse series of (30) using (A3). In this case, k 0 = 1 and then m 0 = 1 . It follows that h 1 = 1 , h 0 = N , and h n = 0 for n 1 . Therefore,
h ( τ ) = ln 2 ( τ ) Γ ( 1 ) ε ( τ 1 ) N δ ( τ 1 ) .
We conclude with the following theorem whose proof is found in Appendix A.
Theorem 6.
Let
g β ( τ ) = k = 0 a k ln k α + β 1 ( τ ) Γ ( k α + β ) ε ( τ 1 ) , α 0 , 0 < β < 1 .
Then, there exists a regular Sonin partner of g β ( τ ) given by
ϕ β ( τ ) = ln β ( τ ) k = 0 b k ln k α ( τ ) Γ ( k α β ) ε ( τ 1 ) .

5. Scale-Invariant Linear Systems

5.1. Integer-Order Scale-Invariant Linear Systems

Let A ( z ) = k = 0 N a k z k and B ( z ) = k = 0 M b k z k be polynomials with real coefficients of degree N and M, respectively. Suppose that the polynomials have no common roots. The systems described as
A ( D s + ) y ( τ ) = B ( D s + ) x ( τ ) , τ 1 ,
where D s + means the scale-derivative [9], are known as dilation-invariant autoregressive-moving average DI-ARMA( N , M ). The corresponding transfer function is
G ( ν ) = k = 0 M b k ν k k = 0 N a k ν k .
Example 10.
Consider G ( ν ) = b 1 ν a 1 ν + a 0 , with a 1 , a 0 , b 1 R + . Observe that G ( ν ) can be rewritten as
G ( ν ) = b 1 a 1 b 1 a 0 a 1 2 v + a 0 a 1 .
Then, the impulse response is
g ( τ ) = b 1 a 1 δ ( τ 1 ) b 1 a 0 a 1 2 τ a 0 a 1 ε ( τ 1 ) .
The inverse system is represented by H ( ν ) = a 1 ν + a 0 b 1 ν . H ( ν ) can be rewritten as
H ( ν ) = a 1 b 1 + a 0 b 1 1 ν .
So, the impulse response of the inverse system is
h ( τ ) = a 1 b 1 δ ( τ 1 ) + a 0 b 1 ε ( τ 1 ) .
To verify the previous result, we only need to check that g ( τ ) h ( τ ) = δ ( τ 1 ) . For this, it is enough to note that δ ( τ 1 ) is the identity element of the Mellin convolution and
b 1 a 0 a 1 2 τ a 0 a 1 ε ( τ 1 ) a 0 b 1 ε ( τ 1 ) = a 0 a 1 + a 0 a 1 τ a 0 a 1 .

5.2. Non-Integer-Order Commensurate Scale-Invariant Linear Systems

The non-integer-order commensurate case in a DI-ARMA( N , N ) system can be easily treated. We only need to replace ν by ν α with 0 α 1 . The transfer function is
G ( ν ) = k = 0 N b k ν k α k = 0 N a k ν k α = b N a N k = 1 N ν α z k ν α p k ,
where z k and p k are the pseudo-zeroes and -poles [40]. Let N p , N z be the number of pseudo-poles and pseudo-zeros, respectively; and let n k + 1 , m k + 1 be their respective multiplicity. Applying partial fraction decomposition, we have that
G ( ν ) = A 0 + k = 1 N p A k ( ν α p k ) n k ,
where A 0 = b N / a N . The inverse system can be characterized as follows:
H ( ν ) = B 0 + m = 1 N z B m ( ν α z m ) n m .
where B m represents the residues at the pseudo-zeroes z k . The condition A 0 B 0 = 1 is also satisfied.
We invert each partial fraction following a procedure similar to that in the previous subsection. From (11) and (29), we have that
g ( τ ) = A 0 δ ( τ 1 ) + k = 1 N p A k E p k , n k 1 ( τ ) ,
and
h ( τ ) = B 0 δ ( τ 1 ) + m = 1 N z B m E z m , n m 1 ( τ ) .
If we define
S γ , n ( τ ) = E γ , n ( τ ) ε ( τ 1 ) = k = n + 1 k 1 n γ k n 1 ln k α ( τ ) Γ ( k α + 1 ) ε ( τ 1 ) .
then the step response is given by
ψ ( τ ) = A 0 δ ( τ 1 ) + k = 1 N p A k S p k , n k 1 ( τ ) .
The computation of h ( τ ) is similar. The α –log-exponential monomial E γ , n ( τ ) has the same convergence properties of the Mittag–Leffler function [41].
Example 11.
Consider G ( ν ) = b 1 ν α a 1 ν α + a 0 , with a 1 , a 0 , b 1 R + . Observe that G ( ν ) can be rewritten as
G ( ν ) = b 1 a 1 b 1 a 0 a 1 2 v α + a 0 a 1 .
Observe that
1 v α + a 0 a 1 = k = 0 a 0 a 1 k ν ( k + 1 ) α , ( ν ) > a 0 a 1 .
It follows that
g ( τ ) = b 1 a 1 δ ( τ 1 ) b 1 a 0 a 1 2 k = 0 a 0 a 1 k ln ( k + 1 ) α 1 ( τ ) Γ ( ( k + 1 ) α ) ε ( τ 1 ) = b 1 a 1 δ ( τ 1 ) b 1 a 0 a 1 2 E a 0 a 1 , 0 ( τ ) .
The inverse system is represented by H ( ν ) = a 1 ν α + a 0 b 1 ν α . H ( ν ) can be rewritten as
H ( ν ) = a 1 b 1 + a 0 b 1 1 ν α .
So, the impulse response of the inverse system is
h ( τ ) = a 1 b 1 δ ( τ 1 ) + a 0 b 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) .

6. Conclusions

A study of the Mellin convolution is performed by means of its deconvolution. The α –log-exponential monomials serve as the basis for the deconvolution process. The Sonin-like conditions for the Mellin convolution are established, and it is shown that the deconvolution process serves to generate Sonin pairs. Applications to scale-invariant linear systems are then studied.

Author Contributions

Conceptualization, G.B. and M.O.; Methodology, G.B. and M.O.; Formal analysis, G.B., M.O. and F.A.-C.; Writing—original draft, G.B., M.O. and F.A.-C. All authors have read and agreed to the published version of the manuscript.

Funding

The first author was funded by the Autonomous University of Mexico City under project UACM CCYT-CON-03. The second author was partially funded by National Funds through the Foundation for Science and Technology of Portugal under the project UIDB/00066/2020.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proofs

We denote by BL the two-sided Laplace transform.
Theorem A1.
Let n , m Z and α R + . Hence,
ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) ln m α 1 ( τ ) Γ ( m α ) ε ( τ 1 ) = ln ( n + m ) α 1 ( τ ) Γ ( ( n + m ) α ) ε ( τ 1 ) .
Proof. 
It is well known that
M [ f ( τ ) ] = BL [ f ( e τ ) ] ,
and
M [ f ( ln ( τ ) ) ] = BL [ f ( τ ) ] .
Hence,
M ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) ln m α 1 ( τ ) Γ ( m α ) ε ( τ 1 ) = M ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) · M ln m α 1 ( τ ) Γ ( m α ) ε ( τ 1 ) = BL ln n α 1 ( e τ ) Γ ( n α ) ε ( e τ 1 ) · BL ln m α 1 ( e τ ) Γ ( m α ) ε ( e τ 1 ) = BL ( τ ) n α 1 Γ ( n α ) ε ( e τ 1 ) · BL ( τ ) m α 1 Γ ( m α ) ε ( e τ 1 ) = ( 1 ) n α + m α 1 ν ( n + m ) α = ( 1 ) n α + m α BL τ ( n + m ) α 1 Γ ( ( n + m ) α ) ε ( τ 1 ) = ( 1 ) n α + m α M ( ln ( n + m ) α 1 ( τ ) ) Γ ( ( n + m ) α ) ε ( τ 1 ) = M ln ( n + m ) α 1 ( τ ) Γ ( ( n + m ) α ) ε ( τ 1 ) .
Therefore,
ln n α 1 ( τ ) Γ ( n α ) ε ( τ 1 ) ln m α 1 ( τ ) Γ ( m α ) ε ( τ 1 ) = ln ( n + m ) α 1 ( τ ) Γ ( ( n + m ) α ) ε ( τ 1 ) .
Theorem A2.
Let γ C and α R + . Consider the α–log-exponential monomial of order zero [10]
E γ , 0 ( τ ) = k = 1 γ k 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Hence, the convolutionally inverse of E γ , 0 ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) .
Moreover, the Sonin partner of E γ , 0 ( τ ) is given by
ϕ ( τ ) = D s + 1 h ( τ ) = ln α ( τ ) Γ ( α + 1 ) ε ( τ 1 ) γ ε ( τ 1 ) ,
and the Sonin partner of h ( τ ) is
ψ ( τ ) = D s + 1 E γ , 0 ( τ ) = k = 1 γ k 1 ln k α ( τ ) Γ ( k α + 1 ) ε ( τ 1 ) .
Proof. 
Observe that
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E γ , 0 ( τ ) = k = 1 γ k 1 ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) ,
and
γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E γ , 0 ( τ ) = k = 1 γ k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Through algebraic manipulations, we obtain
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E γ , 0 ( τ ) = f f f f f f ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) E γ , 0 ( τ ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) E γ , 0 ( τ ) = f f f f f f f f k = 1 γ k 1 ln ( k 1 ) α 1 ( τ ) Γ ( ( k 1 ) α ) ε ( τ 1 ) k = 1 γ k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) = δ ( τ 1 ) .
Hence, h ( τ ) and E γ , 0 ( τ ) are a convolutionally inverse pair. The remainder of the proof can be easily deduced considering that
D s + 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) = ln k α ( τ ) Γ ( k α + 1 ) ε ( τ 1 ) ,
(see (9)). □
Theorem A3.
Let n N 0 , γ C , and α R + . Consider the α–log-exponential monomial of order n [10]:
E γ , n ( τ ) = k = n + 1 k 1 n γ k n 1 ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) .
Hence, the convolutionally inverse of E γ , n ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = k = 0 n + 1 ( 1 ) k n + 1 k γ k ln ( n + 1 k ) α 1 ( τ ) Γ ( ( n + 1 k ) α ) ε ( τ 1 ) .
Proof. 
The proof is by induction on n. The base step of the induction is proven in Theorem 1. Suppose that theorem is valid for n 1 , then
E γ , n 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n = δ ( τ 1 ) .
By Theorem 1,
E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 )
It follows that
E γ , n 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n E γ , 0 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 ) .
From (28) E γ , n 1 ( τ ) E γ , 0 ( τ ) = E γ , n ( τ ) . Therefore,
E γ , n ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = δ ( τ 1 ) .
Now, from (A1) and algebraic manipulations, we have that
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = k = 0 n + 1 ( 1 ) k n + 1 k γ k ln ( n + 1 k ) α 1 ( τ ) Γ ( ( n + 1 k ) α ) ε ( τ 1 ) .
Theorem A4.
Let
g ( τ ) = c 1 E γ 1 , n 1 ( τ ) + c 2 E γ 2 , n 2 ( τ ) , γ 1 γ 2 ,
be a non-null function with c 1 , c 2 R . Then, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 1 R k = 0 M 1 E r k , 0 ( τ )
where M = max ( n 1 + 1 , n 2 + 1 ) ; r k s are the roots of the monic polynomial 1 R ( c 1 ( x γ 2 ) n 2 + 1 + c 2 ( x γ 1 ) n 1 + 1 ) (we consider that 1 / R makes the polynomial monic).
Proof. 
From (A2), we have that
E γ 1 , n 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1 = δ ( τ 1 ) ,
and
E γ 2 , n 2 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 = δ ( τ 1 ) .
So, we can rewrite g ( τ ) as
g ( τ ) = c 1 E γ 1 , n 1 ( τ ) E γ 2 , n 2 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 + f f f f f f f f f c 2 E γ 2 , n 2 ( τ ) E γ 1 , n 1 ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1
Hence,
g ( τ ) = E γ 1 , n 1 ( τ ) E γ 2 , n 2 ( τ ) c 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 + f f f f f f f f c 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1
Applying algebraic manipulation and Remark 4, we have that
c 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 + c 2 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1 = R k = 0 M 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r k ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 )
where M = max ( n 1 + 1 , n 2 + 1 ) and r k s are the roots of the polynomial 1 R ( c 1 ( x γ 2 ) n 2 + 1 + c 2 ( x γ 1 ) n 1 + 1 ) ( 1 / R makes the polynomial monic). From (A2), we deduce that
1 R k = 0 M 1 E r k , 0 ( τ ) R k = 0 M 1 ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r k ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = δ ( τ 1 ) .
Finally, the convolutionally inverse of g ( τ ) is
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 1 + 1 f f f f f f f f ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ 2 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n 2 + 1 g g g g g g g g g g g g g g g g g g g g g g g 1 R k = 0 M 1 E r k , 0 ( τ ) .
Theorem A5.
Define
g ( τ ) = δ ( τ 1 ) + c 1 E γ , n ( τ ) ,
where c 1 is a constant. Then, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 k = 0 n E r k , 0 ( τ ) ,
where r k s are the roots of the polynomial ( x γ ) n + 1 + c 1 .
Proof. 
From (A2), we have that
E γ , n ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 = δ ( τ 1 ) .
Hence, g ( τ ) can be rewritten as
g ( τ ) = E γ , n ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 + c 1 E γ , n ( τ ) = E γ , n ( τ ) ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 + c 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 )
Let r k be the roots of the polynomial ( x γ ) n + 1 + c 1 . Then,
ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 + c 1 ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) = f f f f f f f f f f f f f f f f f f f f f f f f f k = 0 n ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r k ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 )
Again, from (A2), we have that
k = 0 n ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) r k ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) k = 0 n E r k , 0 ( τ ) = δ ( τ 1 ) .
Finally, the convolutionally inverse of g ( τ ) is given by
h ( τ ) = ln α 1 ( τ ) Γ ( α ) ε ( τ 1 ) γ ln 1 ( τ ) Γ ( 0 ) ε ( τ 1 ) n + 1 k = 0 n E r k , 0 ( τ ) .
Theorem A6.
Let g ( τ ) be an α-logarithm power series as in (25) and h ( τ ) the α-logarithm Laurent series
h ( τ ) = M 1 H ( ν ) = k = m 0 b k ln k α 1 ( τ ) Γ ( k α ) ε ( τ 1 ) , m 0 Z .
These series are convolutionally inverses if and only if
m = 0 n a m + m 0 b n m m 0 = δ n , n 0 ,
where δ n , n Z , is the Kronecker delta.
Proof. 
From (A1), we have that
ln a 1 ( τ ) Γ ( a ) ε ( τ 1 ) ln b 1 ( τ ) Γ ( b ) ε ( τ 1 ) = ln a + b 1 ( τ ) Γ ( a + b ) ε ( τ 1 ) .
From this, we can compute the convolution
g ( τ ) h ( τ ) = k = k 0 m = m 0 a k b m ln ( k + m ) α 1 ( τ ) Γ ( ( k + m ) α ) ε ( τ 1 ) = l = k 0 + m 0 m = m 0 l k 0 a m b l m ln l α 1 ( τ ) Γ ( l α ) ε ( τ 1 ) .
Due to ln 1 ( τ ) Γ ( 0 ) = δ ( τ 1 ) and the fact that we require g ( τ ) h ( τ ) = δ ( τ 1 ) , the exterior sum must begin at the index l = 0 , which leads us to k 0 + m 0 = 0 . All the coefficients inside the brackets must be zero:
m = m 0 m 0 a m b m = a m 0 b m 0 = 1 ,
and
m = m 0 l k 0 a m b l m = 0 , l 1 .
This justifies (A3). □
Theorem A7.
Let
g β ( τ ) = k = 0 a k ln k α + β 1 ( τ ) Γ ( k α + β ) ε ( τ 1 ) , α 0 , 0 < β < 1 .
Then, there exists a regular Sonin partner of g β ( τ ) given by
ϕ β ( τ ) = ln β ( τ ) k = 0 b k ln k α ( τ ) Γ ( k α β ) ε ( τ 1 )
Proof. 
The Mellin transform of g β ( τ ) is
G β ( ν ) = k = 0 a k ν k α β , ( ν ) > 0 .
From Theorem 2, we can suppose that g ( τ ) has a convolutionally inverse, say h ( τ ) . From (22), we have that
Φ β ( ν ) G β ( ν ) = 1 ν .
Since
g β ( τ ) = g ( τ ) ln β 1 ( τ ) Γ ( β ) ε ( τ 1 ) ,
then G β ( ν ) = G ( ν ) ν β . From (19), it follows that
G β ( ν ) = 1 ν β H ( ν ) .
Therefore,
Φ β ( ν ) = ν β 1 H ( ν ) = k = 0 b k 1 ν k α β + 1 .
Finally, calculating the Mellin inverse transform, we obtain (A4). □

References

  1. Hirschman, I.; Widder, D. The Convolution Transform; Courier Corporation: North Chelmsford, MA, USA, 2012. [Google Scholar]
  2. Domínguez, A. A History of the Convolution Operation [Retrospectroscope]. IEEE Pulse 2015, 6, 38–49. [Google Scholar] [CrossRef] [PubMed]
  3. Roberts, M.J. Signals and Systems: Analysis Using Transform Methods and Matlab; McGraw-Hill: New York, NY, USA, 2003. [Google Scholar]
  4. Ortigueira, M.D.; Machado, J.T. The 21st century systems: An updated vision of continuous-time fractional models. IEEE Circuits Syst. Mag. 2022, 22, 36–56. [Google Scholar] [CrossRef]
  5. Braccini, C.; Gambardella, G. Form-invariant linear filtering: Theory and applications. IEEE Trans. Acoust. Speech Signal Process. 1986, 34, 1612–1628. [Google Scholar] [CrossRef]
  6. Yazici, B.; Kashyap, R.L. A class of second-order stationary self-similar processes for 1/f phenomena. IEEE Trans. Signal Process. 1997, 45, 396–410. [Google Scholar] [CrossRef]
  7. Cohen, L. The scale representation. IEEE Trans. Signal Process. 1993, 41, 3275–3292. [Google Scholar] [CrossRef]
  8. Ortigueira, M.D. On the fractional linear scale invariant systems. IEEE Trans. Signal Process. 2010, 58, 6406–6410. [Google Scholar] [CrossRef]
  9. Ortigueira, M.; Bohannan, G. Fractional scale calculus: Hadamard vs. Liouville. Fractal Fract. 2023, 7, 296. [Google Scholar] [CrossRef]
  10. Bengochea, G.; Ortigueira, M. An Operational Approach to Fractional Scale-Invariant Linear Systems. Fractal Fract. 2023, 7, 524. [Google Scholar] [CrossRef]
  11. Gupta, A.; Singh, P.; Aggarwal, P.; Joshi, S.D. Unified framework for linear scale invariant signals, systems, and transforms: A tutorial. Digit. Signal Process. 2025, 157, 104880. [Google Scholar] [CrossRef]
  12. Grossmann, A.; Morlet, J. Decomposition of Hardy functions into square integrable wavelets of constant shape. SIAM J. Math. Anal. 1984, 15, 723–736. [Google Scholar] [CrossRef]
  13. Mallat, S.G. Multiresolution Representations and Wavelets; University of Pennsylvania: Philadelphia, PA, USA, 1988. [Google Scholar]
  14. Heil, C.E.; Walnut, D.F. Continuous and discrete wavelet transforms. SIAM Rev. 1989, 31, 628–666. [Google Scholar] [CrossRef]
  15. Nottale, L. The theory of scale relativity. Int. J. Mod. Phys. A 1992, 7, 4899–4936. [Google Scholar] [CrossRef]
  16. Nottale, L. Non-differentiable space-time and scale relativity. In Proceedings of the International Colloquium Geometrie au XXe Siecle, Paris, France, 24–29 September 2001. [Google Scholar]
  17. Borgnat, P.; Amblard, P.O.; Flandrin, P. Scale invariances and Lamperti transformations for stochastic processes. J. Phys. A Math. Gen. 2005, 38, 2081. [Google Scholar] [CrossRef]
  18. Butzer, P.; Jansche, S. A direct approach to the Mellin transform. J. Fourier Anal. Appl. 1997, 3, 325–376. [Google Scholar] [CrossRef]
  19. Bertrand, J.; Bertrand, P.; Ovarlez, J. The Mellin transform. In The Transforms and Applications Handbook; CRC Press: Boca Raton, FL, USA, 1995. [Google Scholar]
  20. Kim, H.; Cao, J.; Kim, J.; Zhang, W. A Mellin transform approach to pricing barrier options under stochastic elasticity of variance. Appl. Stoch. Models Bus. Ind. 2023, 39, 160–176. [Google Scholar] [CrossRef]
  21. Fikioris, G. Mellin-Transform Method for Integral Evaluation: Introduction and Applications to Electromagnetics; Springer Nature: New York, NY, USA, 2022. [Google Scholar]
  22. Shen, X.; Gamboa, J.; Hamidfar, T.; Shahriar, S. Investigation of frequency invariance in automated event recognition using resonant atomic media. In Proceedings of the Practical Holography XXXVIII: Displays, Materials, and Applications, San Francisco, CA, USA, 27 January–1 February 2024; Blanche, P.A.J., Lee, S.H., Eds.; International Society for Optics and Photonics. SPIE: Bellingham, WA, USA, 2024; Volume 12910, p. 129100E. [Google Scholar] [CrossRef]
  23. Vashisth, S.; Singh, H.; Yadav, A.; Singh, K. Image encryption using fractional Mellin transform, structured phase filters, and phase retrieval. Optik 2014, 125, 5309–5315. [Google Scholar] [CrossRef]
  24. Luchko, Y.; Kiryakova, V. The Mellin integral transform in fractional calculus. Fract. Calc. Appl. Anal. 2013, 16, 405–430. [Google Scholar] [CrossRef]
  25. Aziz, T.; Rehman, M. Generalized Mellin transform and its applications in fractional calculus. Comput. Appl. Math. 2022, 41, 88. [Google Scholar] [CrossRef]
  26. Tarasov, V.E. Scale-invariant general fractional calculus: Mellin convolution operators. Fractal Fract. 2023, 7, 481. [Google Scholar] [CrossRef]
  27. Luchko, Y.; Yamamoto, M. The general fractional derivative and related fractional differential equations. Mathematics 2020, 8, 2115. [Google Scholar] [CrossRef]
  28. Ortigueira, M. Searching for Sonine kernels. Fract. Calc. Appl. Anal. 2024; submitted. [Google Scholar] [CrossRef]
  29. Prost, R.; Goutte, R. Linear systems identification by Mellin deconvolution. Int. J. Control 1976, 23, 713–720. [Google Scholar] [CrossRef]
  30. Prost, R.; Goutte, B. Performances of the method of linear systems identification by Mellin deconvolution. Int. J. Control 1977, 25, 39–51. [Google Scholar] [CrossRef]
  31. Shtrauss, V. Decomposition of multi-exponential and related signals–Functional filtering approach. WSEAS Trans. Signal Process. 2008, 4, 44–52. [Google Scholar]
  32. Kaiser, H. Applications of Mellin-Barnes Integrals to Deconvolution Problems. Ph.D. Thesis, Justus-Liebig-University of Giessen, Giessen, Germany, 2023. [Google Scholar]
  33. Brenner, S.; Johannes, J.; Siebel, M. Multiplicative deconvolution under unknown error distribution. Electron. J. Stat. 2024, 18, 4795–4850. [Google Scholar] [CrossRef]
  34. Gel’fand, I.; Shilov, G. Generalized Functions: Properties and Operations; Academic Press: Cambridge, MA, USA, 1964. [Google Scholar]
  35. Abel, N. Oplösning af et par opgaver ved hjelp af bestemte integraler. Mag. Naturvidenskaberne 1823, 2. [Google Scholar]
  36. Sonine, N. Sur la généralisation d’une formule d’Abel. Acta Math. 1884, 4, 171–176. [Google Scholar] [CrossRef]
  37. Zheng, X. An equivalent formulation of Sonine condition. Appl. Math. Lett. 2024, 153, 109069. [Google Scholar] [CrossRef]
  38. Fanton, J. Convolution and deconvolution: Two mathematical tools to help performing tests in research and industry. Int. J. Metrol. Qual. Eng. 2021, 12, 6. [Google Scholar] [CrossRef]
  39. Bengochea, G.; Verde-Star, L. Linear algebraic foundations of the operational calculi. Adv. Appl. Math. 2011, 47, 330–351. [Google Scholar] [CrossRef]
  40. Ortigueira, M.; Machado, J. The 21st century systems: An updated vision of discrete-time fractional models. IEEE Circuits Syst. Mag. 2022, 22, 6–21. [Google Scholar] [CrossRef]
  41. Gorenflo, R.; Kilbas, A.; Mainardi, F.; Rogosin, S. Mittag-Leffler Functions, Related Topics and Applications; Springer: New York, NY, USA, 2020. [Google Scholar]
Figure 1. Diagram of Sonin-like condition.
Figure 1. Diagram of Sonin-like condition.
Mathematics 13 00432 g001
Figure 2. Diagram of deconvolution problem.
Figure 2. Diagram of deconvolution problem.
Mathematics 13 00432 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Bengochea, G.; Ortigueira, M.; Arroyo-Cabañas, F. On the Inversion of the Mellin Convolution. Mathematics 2025, 13, 432. https://doi.org/10.3390/math13030432

AMA Style

Bengochea G, Ortigueira M, Arroyo-Cabañas F. On the Inversion of the Mellin Convolution. Mathematics. 2025; 13(3):432. https://doi.org/10.3390/math13030432

Chicago/Turabian Style

Bengochea, Gabriel, Manuel Ortigueira, and Fernando Arroyo-Cabañas. 2025. "On the Inversion of the Mellin Convolution" Mathematics 13, no. 3: 432. https://doi.org/10.3390/math13030432

APA Style

Bengochea, G., Ortigueira, M., & Arroyo-Cabañas, F. (2025). On the Inversion of the Mellin Convolution. Mathematics, 13(3), 432. https://doi.org/10.3390/math13030432

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop