Next Article in Journal
Density of Some Special Sequences Modulo 1
Previous Article in Journal
Generalized Solutions of Ordinary Differential Equations Related to the Chebyshev Polynomial of the Second Kind
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Kernel General Fractional Calculus of Arbitrary Order

by
Vasily E. Tarasov
1,2
1
Skobeltsyn Institute of Nuclear Physics, Lomonosov Moscow State University, Moscow 119991, Russia
2
Department of Physics, 915, Moscow Aviation Institute (National Research University), Moscow 125993, Russia
Mathematics 2023, 11(7), 1726; https://doi.org/10.3390/math11071726
Submission received: 19 February 2023 / Revised: 28 March 2023 / Accepted: 2 April 2023 / Published: 4 April 2023

Abstract

:
An extension of the general fractional calculus (GFC) of an arbitrary order, proposed by Luchko, is formulated. This extension is also based on a multi-kernel approach, in which the Laplace convolutions of different Sonin kernels are used. The proposed multi-kernel GFC of an arbitrary order is also considered for the case of intervals ( a , b ) where < a < b . Examples of multi-kernel general fractional operators of arbitrary orders are proposed.

1. Introduction

Fractional calculus is a mathematical theory of integral and integro-differential operators, which are interpreted as integrals and derivatives of arbitrary orders [1,2,3,4,5,6,7]. This interpretation is based on the fulfillment of generalized analogs of the first and second fundamental theorems of the standard mathematical calculus, which pertain to derivatives and integrals of the integer order. Fractional calculus is widely used to describe various phenomena and processes with nonlocality in space and time (see books [8,9,10,11,12,13,14,15,16,17] and handbooks [18,19]). However, fractional calculus mainly uses operator kernels of the power-law type.
To describe a wider range of nonlocalities, it is important to expand the class of integral and integro-differential operators, for which analogs of the first and second fundamental theorems of the standard mathematical calculus can be realized. One of the most interesting and urgent directions is the so-called general fractional calculus, which is based on the development and generalization of Sonin’s approach [20,21]. The basic concepts of new mathematical calculus were proposed by Sonin in his 1884 paper [20] (see also [21]). The terms “general fractional calculus”, “general fractional integrals”, and “general fractional derivatives” were suggested by Kochubei in 2011 [22].
Following work [23], one can conditionally distinguish three types of general fractional calculus (GFC), which are based on the three classes of Sonin kernels: (K) Kochubei’s GFC, proposed in 2011 [22] (see also [24,25]); (H) Hanyga’s GFC, proposed in 2020 [26]; and (L) Luchko’s GFC, proposed in 2021 [23].
During the past two years, Luchko’s general fractional (GF) calculus has been developed very actively in works [23,27,28,29,30,31,32,33,34]. The n-fold GF integrals and GF derivatives of the first order were proposed in [23]. The general fractional calculus of an arbitrary order was first proposed in Luchko’s works [27,31] (see also [29,30]). A composition of GF integrals with identical kernels and n-fold sequential GF derivatives with identical kernels were defined in [29,30], where solutions to equations with these operators were derived. For GF differential and GF integral operators of arbitrary orders, the fundamental theorems of the general fractional calculus were proved. A convolution series in GFC [29,30] and a general fractional generalization of the Taylor series were proposed in [30]. Generalization of the operational calculus for equations with general fractional derivatives was suggested [28,33]. Note that an attempt to generalize Luchko’s GFC to the multi-kernel case was made in work [35]. The general fractional calculus with functions of a several variable (the multivariable) GFC and the general fractional vector calculus (GFVC) were realized in work [36]. Trends in the development and applications of GFC and some open problems of GFC are described in Section 2 and Section 4 of the review paper [37].
The applications and development of general fractional calculus can be divided conditionally into applications in mathematics, which will include both the development of the calculus itself and its applications in other sciences.
Among the considered applications and development of GFC in mathematics, one can note results in the following directions: the theory of integral equations of the first kind [38,39]; subordinators and their inverse processes (hitting times) that are presented by governing equations with convolution-type integro-differential operators [40]; uniqueness and the existence of solutions in the initial boundary value problems for a general time-fractional diffusion equation [41] and other types of fractional partial differential equations [42]; fractional ordinary differential equations with the GFD [42]; the well-posedness of general Caputo-type fractional differential equations [43]; abstract Cauchy problems for generalized fractional differential equations and a generalized Gronwall inequality [44]; the Prabhakar (three-parameter Mittag–Leffler) function in the general fractional calculus [45]; a general fractional relaxation equation and its application to an inverse source problem [46]; identification of the source term in a nonlocal problem for the general time-fractional diffusion equation [47]; and the nonlocal (general fractional) probability theory [48].
Among the considered applications of GFC in physics and other sciences, one can note the following areas: fractional statistical dynamics of continuously interacting particle systems [49]; the fractional relaxation process [42,49]; the fractional growth process [42,50]; general fractional dynamics as an interdisciplinary science, in which the nonlocal properties of dynamical systems are studied by using general fractional calculus and general nonlocal maps [51]; the asymptotic behavior of random time changes of general fractional dynamical systems and Cesaro limits [52]; inverse problems for generalized subdiffusion processes [53,54] thermodynamic restrictions for a general Zener model [55]; a two-compartment pharmacokinetic model [56]; general non-Markovian quantum dynamics of open and dissipative systems [57]; general nonlocal continuum mechanics with nonlocal balance laws [58], which are based on the general fractional vector calculus proposed in [36]; general nonlocal electrodynamics with general fractional Maxwell equations and nonlocal effects [59]; the nonlocal classical field theory of gravity with the effects of massiveness of the nonlocality and mass shielding by nonlocality [60]; and nonlocal statistical mechanics with general fractional Liouville equations [61], which are based on the nonlocal probability theory proposed in [48].
The following are the mathematical motivations for this article: extensions of the GFC of an arbitrary order on a multi-kernel case, the finite intervals of the real line as generalizations of Luchko’s m-fold GFC of an arbitrary order [27], and a multi-kernel approach to GFC [35]. Let us describe these mathematical motivations in some detail.
Let us first describe in more detail the motivation for the multi-kernel expansion of general fractional calculus (GFC). Luchko’s form of the GFC, described in works [23,27,28,29,30,31,32,33,34], can be called a single-kernel GFC. Let us briefly list those general fractional operators whose definitions are given and whose properties are described in these works by Luchko. The general fractional integrals (GFIs) and general fractional derivatives (GFDs) of arbitrary orders are defined by Luchko in paper [27]. The main basic properties of GFIs and GFDs of arbitrary orders are described by the two fundamental theorems of GFC, which are proved in [27]. The m-fold GFI and GFDs with the kernel pairs ( M , K ) L 1 are proposed by Luchko in [29,30]. Then, these operators are generalized for the kernel pairs ( M , K ) L n with n N in Luchko’s work [31]. The following GF operators are constructed as convolutional powers of the same kernel: (a) The m-fold GFIs of arbitrary orders can be represented as the GFI with the kernel M < m > ( x ) = ( M 1 M m ) ( x ) . (b) The m-fold GFDs of arbitrary orders can be represented as the GFI with the kernel K < m > ( x ) = ( K 1 K m ) ( x ) , where M j ( x ) = M ( x ) and K j ( x ) = K ( x ) for all j = 1 , , m , and ( M , K ) L n .
It is important to extend the general fractional calculus by using the convolutional product of different kernels instead of the convolutional degree. Therefore, one can consider kernels in the forms ( M 1 M m ) ( x ) and ( K 1 K m ) ( x ) , where the conditions M j ( x ) = M ( x ) and K j ( x ) = K ( x ) for all j = 1 , , m are not used. The first attempt to construct such multi-kernel fractional calculus was made in paper [35] in 2021. However, the proposed subsets of multi-kernel general fractional operators have drawbacks. For example, it should be noted that the operators, which are defined by Equations (53) and (55) in [35], cannot be considered fractional derivatives in the general case (for all values of parameters). For some values of the parameters, these operators are described by sequential actions of the general fractional derivative and integral of the integer order.
Therefore, it is important to remove these drawbacks to derive the correct formulation of the multi-kernel GFC. This can be realized by taking into account the results of Luchko’s works [27,31] and [29,30]. For the correct formulation of the multi-kernel approach to general fractional calculus, one can generalize Luchko’s results, which are derived in [31], for a set of kernel pairs ( M j , K j ) L n with n N , where j = 1 , , m .
Because of this, the motivation of this paper is the correct formulation of the multi-kernel GFC of an arbitrary order, including the definitions of the multi-kernel general fractional operators of arbitrary orders and the proof of the fundamental theorems of the multi-kernel GFC of an arbitrary order. Then, the single-kernel m-fold sequential GFC of an arbitrary order, which is proposed by Luchko for the case M j ( x ) = M ( x ) and K j ( x ) = K ( x ) for j = 1 , , m , can be considered a special case of the multi-kernel GFC.
Let us briefly describe the content of this article.
In Section 2 (preliminaries), Luchko’s results for the single-kernel GFC of an arbitrary order are described to simplify further consideration. In Section 3, the multi-kernel GFC of an arbitrary order is proposed for the interval ( 0 , ) . In Section 4, the multi-kernel GF operators of arbitrary orders for the finite intervals [ a , b ] are proposed. In Section 5, examples of the multi-kernel GF operators of arbitrary orders are considered. A brief conclusion is given in Section 6.

2. Preliminaries: Single-Kernel GFC of Arbitrary Order

In this section, some basic definitions and properties of the GFIs and GFDs are described as in [23].

2.1. Spaces and Sub-Spaces of Functions

Let us define the function spaces C 1 ( 0 , ) and C 1 , 0 ( 0 , ) [23,62].
Definition 1.
Let the function f ( x ) be represented in the form
f ( x ) = x p g ( x ) , ( p > 1 )
for all x > 0 , where g ( x ) C [ 0 , ) .
This set of functions is denoted as C 1 ( 0 , ) .
Definition 2.
Let the function K ( x ) be represented in the form
K ( x ) = x q k ( x ) , ( 1 < q < 0 )
for all x > 0 , where k ( x ) C [ 0 , ) .
This set of functions is denoted as C 1 , 0 ( 0 , ) .
Note that the inclusion C 1 , 0 ( 0 , ) C 1 ( 0 , ) holds true. Note also that the inclusion C ( 0 , ) C 1 ( 0 , ) holds true since C ( 0 , ) = C 0 ( 0 , ) [62].
One can also consider the spaces C 1 n ( 0 , ) with n N 0 = N { 0 } .
Definition 3.
Let the derivative f ( n ) ( x ) = d n f ( x ) / d x n of the integer order n N 0 = N { 0 } of the function f ( x ) belong to the space C 1 ( 0 , ) , i.e., f ( n ) ( x ) C 1 ( 0 , ) .
This set of functions is denoted as C 1 n ( 0 , ) , where C 1 0 ( 0 , ) C 1 ( 0 , ) .
The following theorem describes properties of the space C 1 n ( 0 , ) .
Theorem 1
(Theorem Luchko–Gorenflo). The set
C 1 n ( 0 , ) : = { f ( x ) : f ( n ) ( x ) C 1 ( 0 , ) }
satisfies the following properties.
1. 
C 1 n ( 0 , ) with n N 0 is a vector space over the field R .
2. 
If F ( x ) C 1 n ( 0 , ) with n 1 , then
F ( k ) ( 0 + ) : = lim t 0 + F ( k ) ( x ) < , ( 0 k n 1 , k N 0 ) .
3. 
If F ( x ) C 1 n ( 0 , ) with n 1 , then
F ( x ) = F ( x ) , x > 0 , F ( 0 + ) , x = 0
belongs to the space C n 1 [ 0 , ) .
4. 
If F ( x ) C 1 n ( 0 , ) with n 1 , then F ( x ) C n ( 0 , ) C n 1 [ 0 , ) .
5. 
In order for F ( x ) C 1 n ( 0 , ) with n 1 , it is necessary and sufficient that F ( x ) can be represented in the form
F ( x ) = ( I 0 + n φ ) ( x ) + k = 0 n 1 F ( k ) ( 0 ) x k k ! ,
for all x 0 , where φ C 1 ( 0 , ) and where I 0 + n is the standard integral of the integer order n N in the form
( I 0 + n φ ) ( x ) = 1 ( n 1 ) ! 0 x ( x u ) n 1 φ ( u ) d u .
Therefore, one can write
F ( x ) C 1 n ( 0 , ) n 1 F ( x ) = ( I 0 + n φ ) ( x ) + k = 0 n 1 F ( k ) ( 0 ) x k k ! .
6. 
Let F ( x ) C 1 n ( 0 , ) with n N 0 , K ( x ) C 1 1 ( 0 , ) , and
F ( k ) ( 0 ) = 0 ( k = 0 , , n 1 ) .
Then, the Laplace convolution z ( x ) = ( K F ) ( x ) belongs to the space C 1 n + 1 ( 0 , ) , and z ( k ) ( 0 ) = 0 for k = 0 , , n 1 .
Theorem 1 is proved in paper [62] (see also [23]).

2.2. General Fractional Integrals and Derivatives of Arbitrary Orders

The general fractional integrals (GFIs) and general fractional derivatives (GFDs) of arbitrary orders are defined by Luchko in his paper [27]. To define the GFIs and the GFDs of arbitrary orders, the following condition on their kernels M ( x ) and K ( x ) should be satisfied [27] in the form
( M K ) ( x ) = { 1 } n ( x ) for all x > 0 ,
where n N and
{ 1 } n ( x ) : = ( g 1 g n ) ( x ) = h n ( x ) = x n 1 ( n 1 ) ! ,
where g j ( x ) = h ( x ) = { 1 } are the Heaviside step functions for all j = 1 , , n . Condition (10), proposed in [27], is called the Luchko condition. Note that the Luchko condition (10) generalizes the Sonin condition ( M K ) ( x ) = { 1 } , which holds for all x > 0 where h ( x ) = { 1 } is the Heaviside step function. The Sonin condition corresponds to the case n = 1 .
Let us define a set of the kernels that satisfies condition (10) and belongs to the special spaces of functions.
Definition 4.
Let the functions M ( x ) and K ( x ) satisfy the following conditions.
(1) M ( x ) and K ( x ) satisfy the Luchko condition (10).
(2) The kernel M ( x ) of the GFI belongs to the space C 1 ( 0 , ) .
(3) The kernel K ( x ) of the GFD belongs to the space C 1 , 0 ( 0 , ) .
A set of the pair ( M , K ) of such kernels is called the Luchko set, which is denoted by L n .
Example 1.
The pair of kernels
M ( x ) = h α ( x ) = x α 1 Γ ( α ) , K ( x ) = h n α ( x ) = x n α 1 Γ ( n α )
with α ( n 1 , n ) and n N belongs to the Luchko set L n .
Let us consider the pair ( M n , K n ) of kernels from the Luchko set L n with n > 1 , which are built from the Sonin kernels ( M , K ) from the Luchko set L 1 .
Theorem 2.
Let ( M , K ) be a pair of Sonin kernels from the Luchko set L 1 .
Then, the pair ( M n , K n ) of kernels, given by the equations
M n ( x ) = ( { 1 } n 1 M ) ( x ) , K n ( x ) = K ( x ) ,
belongs to the Luchko set L n .
Proof. 
Theorem 2 is proved in [27]. □
Note that the transformations proving the fulfillment of the Luchko condition (10) for kernels (11) have the form
( M n K n ) ( x ) = ( { 1 } n 1 M K ) ( x ) = ( { 1 } n 1 { 1 } ) ( x ) = { 1 } n ( x ) .
Let us define the GF integrals and GF derivatives of an arbitrary order and describe their basic properties.
Definition 5.
Let ( M , K ) be a pair of kernels from the Luchko set L n , and let the function f ( x ) belong to the set C 1 ( 0 , ) .
The GFI with the kernel M ( x ) is defined by the equation
I ( M ) x [ u ] f ( u ) : = 0 x M ( x u ) f ( u ) d u ,
where x > 0 .
Definition 6.
Let ( M , K ) be a pair of kernels from the Luchko set L n .
The GFD of the Riemann–Liouville type with the kernel K ( x ) for the function f ( x ) C 1 ( 0 , ) is defined as follows:
D ( K ) x [ u ] f ( u ) : = d n d x n 0 x K ( x u ) f ( u ) d u ,
where x > 0 .
The GFD of the Caputo type with the kernel K ( x ) for the function f ( n ) ( x ) C 1 ( 0 , ) is defined as
D ( K ) x , [ u ] f ( u ) : = I ( K ) x [ u ] f ( n ) ( u ) = 0 x K ( x u ) f ( n ) ( u ) d u ,
where x > 0 .
In [27], the GFD of the Caputo type (15) is defined by the equation
D ( K ) x , [ u ] f ( u ) : = D ( K ) x [ u ] f ( u ) k = 0 n 1 f ( k ) ( 0 ) h k + 1 ( u ) ,
where x > 0 . Using Equation (16), the GFD of the Caputo type (16) can be represented [27] in the form
D ( K ) x , [ u ] f ( u ) = D ( K ) x [ u ] f ( u ) k = 0 n 1 f ( k ) ( 0 ) K ( n k 1 ) ( x ) ,
where x > 0 and K ( m ) ( x ) = d m K ( x ) / d x m .
Example 2.
The GFI (13) with the kernel M ( x ) = h α ( x ) , α > 0 is the Riemann–Liouville fractional integral [4].
The GFDs (14) and (15) with the kernel K ( x ) = h n α ( x ) are the Riemann–Liouville and Caputo fractional derivatives of the order α ( n 1 , n ) , where n N [4].
Let us give some important properties of the GFIs of arbitrary orders.
  • If the function f ( x ) belongs to the set C 1 ( 0 , ) , then the GFI of this function also belongs to the set, i.e., I ( M ) x [ u ] f ( u ) C 1 ( 0 , ) ,
    I ( M ) x : C 1 ( 0 , ) C 1 ( 0 , ) ,
  • For f ( x ) C 1 ( 0 , ) , the following semi-group property is satisfactory
    I ( M 1 ) x [ u ] I ( M 2 ) u [ w ] f ( w ) : = I ( M 1 M 2 ) x [ u ] f ( u ) .
Remark 1.
Let ( M 1 , K 1 ) be a pair of kernels from the Luchko set L 1 . Then, the GFI with the kernel M n = ( { 1 } n 1 M 1 ) ( x ) can be written in the form
( I ( M n ) x f ) ( x ) = I 0 + n 1 I ( M 1 ) x [ u ] f ( u )
for x > 0 . The GFDs of the Riemann–Liouville and Caputo types with the kernel K n ( x ) = K 1 ( x ) can be represented as
D ( K n ) x [ u ] f ( u ) = d n d x n I ( K 1 ) x [ u ] f ( u ) ,
D ( K n ) x , [ u ] f ( u ) = I ( K 1 ) x [ u ] f ( n ) ( u ) = d n d x n I ( K 1 ) x [ u ] f ( u ) k = 0 n 1 f ( k ) ( 0 ) h k + 1 ( u )
for x > 0 .

2.3. Fundamental Theorems of General Fractional Calculus of Arbitrary Order

The main basic properties of GFIs and GFDs of arbitrary orders are described by the two fundamental theorems of GFC, which are proved by Luchko in his paper [27].
The first fundamental theorem of GFC is formulated for the space C 1 , ( K ) ( 0 , ) , which is defined by the following definition.
Definition 7.
Let the function K ( x ) belong to the space C 1 ( 0 , ) , and let the function f ( x ) be represented in the form
f ( x ) = I ( K ) x [ u ] φ ( u ) ,
for all x > 0 , where φ ( x ) C 1 ( 0 , ) .
Then, this set of functions, f ( x ) , is denoted as C 1 , ( K ) ( 0 , ) .
Note that if K ( x ) C 1 , 0 ( 0 , ) , then K ( x ) C 1 ( 0 , ) since C 1 , 0 ( 0 , ) C 1 ( 0 , ) .
If K ( x ) C 1 ( 0 , ) and φ ( x ) C 1 ( 0 , ) , then f ( x ) = I ( K ) x [ u ] φ ( u ) C 1 ( 0 , ) .
Theorem 3
(First Fundamental Theorem of GFD of Arbitrary Order). Let ( M , K ) be a pair of kernels from the Luchko set L n .
The GFD of the Riemann–Liouville type is a left inverse operator to the GFI, and the equation
D ( K ) x [ u ] I ( M ) u [ w ] f ( w ) = f ( x )
holds for all x > 0 , if the function f ( x ) belongs to the space C 1 ( 0 , ) .
The GFD of the Caputo type is a left inverse operator to the GFI, and the equation
D ( K ) x , [ u ] I ( M ) u [ w ] f ( w ) = f ( x ) ,
holds for all x > 0 , if the function f ( x ) belongs to the space C 1 , ( K ) ( 0 , ) .
Proof. 
Theorem 3 is proved in the same way as Theorem 4 in [27], pp. 11–12.
For the GFD of the Riemann–Liouville type, the following transformations can be used
D ( K ) x [ u ] I ( M ) u [ w ] f ( u ) = d n d x n ( K ( M f ) ) ( x ) = d n d x n ( ( K M ) f ) ( x ) =
d n d x n ( { 1 } n f ) ( x ) = d n d x n ( I 0 + n f ) ( x ) = f ( x ) ,
where I 0 + n is the standard integral of the integer order n N that has the form (7).
For the GFD of the Caputo type, the following properties and transformations are used. A function f ( x ) C 1 , ( K ) ( 0 , ) can be represented in the form f ( x ) = I ( K ) x [ u ] φ ( u ) , where φ ( x ) C 1 ( 0 , ) . Therefore, the following transformations are valid:
I ( M ) x [ u ] f ( u ) = I ( M ) x [ u ] I ( K ) u [ w ] φ ( w ) = ( ( M K ) φ ) ( x ) = ( { 1 } n φ ) ( x ) = ( I 0 + n φ ) ( x ) .
As a result, one can see that I ( M ) x [ u ] f ( u ) C 1 n ( 0 , ) , and the property
( d k d x k I ( M ) x [ u ] f ( u ) ) x = 0 = ( I 0 + n k φ ) ( x ) x = 0 = 0
is satisfied for all k = 0 , , n 1 . Equation (26) is given as Equation (63) in [27], p. 11.
Here, we use the property according to which, for a non-negative continuous function φ ( x ) on an open interval ( 0 , b ) with b > 0 , the following limit exists and is equal to zero
lim x 0 + 0 x g k ( u ) d u = 0 ,
where g k ( u ) = I 0 + n k 1 [ w ] φ ( w ) and k = 0 , , n 1 .
Using (17) of the GFD of the Caputo type, Equations (26) and (24) give
D ( K ) x , [ u ] I ( M ) u [ w ] f ( w ) = D ( K ) x [ u ] I ( M ) u [ w ] f ( w ) k = 0 n 1 d k d x k I ( M ) x [ u ] f ( u ) x = 0 d n k 1 d x n k 1 K ( x ) = f ( x )
for all x > 0 . □
The second fundamental theorem of the GFC can be formulated for the spaces C 1 n ( 0 , ) and C 1 , ( M ) ( 0 , ) for the GFDs of the Caputo and Riemann–Liouville types, respectively.
Theorem 4
(Second Fundamental Theorem of Caputo-Type GFD of Arbitrary Order). Let ( M , K ) be a pair of kernels from the Luchko set L n , and let the function F ( x ) belong to the space C 1 n ( 0 , ) , i.e., F ( n ) ( x ) C 1 ( 0 , ) for all x > 0 .
Then, for the GFD of the Caputo type, the equation
I ( M ) x [ u ] D ( K ) u , [ w ] F ( w ) = F ( x ) k = 0 n 1 F ( k ) ( 0 ) h k + 1 ( x )
holds for all x > 0 , where F ( k ) ( x ) = d k F ( x ) / d x k .
Proof. 
Theorem 4 is proved in the same manner as Theorem 5 in [27], p. 12.
Using the premise that any function F ( x ) from the space C 1 n ( 0 , ) can be represented (see Equation (6) of Theorem 1 and [62]) in the form
F ( x ) = ( I 0 + n φ ) ( x ) + k = 0 n 1 F ( k ) ( 0 ) h k + 1 ( x )
for all x 0 , where φ ( x ) C 1 ( 0 , ) .
Then, using Equation (16) and the definition of the GFD of the Caputo type in the form (29), one can realize the following transformations
D ( K ) x , [ u ] F ( u ) = D ( K ) x [ u ] F ( u ) k = 0 n 1 F ( k ) ( 0 ) h k + 1 ( u ) = D ( K ) x [ u ] I 0 + n φ ( u ) =
d n d x n ( K { 1 } n φ ) ( x ) = d n d x n ( { 1 } n ( K φ ) ) ( x ) = ( K φ ) ( x ) .
Using representation (29), one can implement transformations
I ( M ) x [ u ] D ( K ) u , [ w ] F ( w ) = I ( M ) x [ u ] ( K φ ) ( u ) = ( ( M K ) φ ) ( x ) =
( { 1 } n φ ) ( x ) = ( I 0 + n φ ) ( x ) = F ( x ) k = 0 n 1 F ( k ) ( 0 ) h k + 1 ( x ) .
This proves equality (28). □
Theorem 5
(Second Fundamental Theorem of RL-Type GFD of Arbitrary Order). Let ( M , K ) be a pair of kernels from the Luchko set L n , and let the function F ( x ) belong to the set C 1 , ( M ) ( 0 , ) .
Then, for the GFD of the Riemann–Liouville type, the equation
I ( M ) x [ u ] D ( K ) u [ w ] F ( u ) = F ( x )
holds for all x > 0 .
Proof. 
Theorem 4 is proved in [27], p. 12.
The function F ( x ) C 1 , ( M ) ( 0 , ) can be represented in the form F ( x ) = I ( M ) x [ u ] f ( u ) , where f ( x ) C 1 ( 0 , ) . Then, the following transformations can be realized
I ( M ) x [ u ] D ( K ) u [ w ] F ( w ) = I ( M ) x [ u ] d n d u n ( K F ) ( u ) = I ( M ) x [ u ] d n d u n ( K ( M f ) ) ( u ) =
I ( M ) x [ u ] d n d u n ( { 1 } n f ) ( u ) = I ( M ) x [ u ] f ( u ) = F ( x ) .
This proves equality (30). □

2.4. Sequential n-Fold General Fractional Integrals and Derivatives

Let us consider sequential general fractional integrals and derivatives. The m-fold GFI and GFDs with the kernels ( M , K ) L 1 are proposed by Luchko in [29,30]. Then, these operators are generalized for the kernels ( M , K ) L n with n N in Luchko’s work [31].
Let us define the convolution power f < m > ( x ) with m N of the function f ( x ) C 1 ( 0 , ) by the equation
f < m > ( x ) : = ( f 1 f m ) ( x ) ,
where f j ( x ) = f ( x ) for all j = 1 , , m .
Let us define the m-fold sequential GFI and GFD of the Riemann–Liouville type.
Definition 8.
Let the kernel pairs ( M , K ) belong to the Luchko set L n with n N .
The m-fold sequential GFI is defined as a composition of m GFIs with the kernel M ( x ) in the form
I ( M ) < m > , x [ u ] f ( u ) : = I ( M ) x [ x 1 ] I ( M ) x m 1 [ x m ] f ( x m )
with x > 0 , where I ( M ) < 1 > , x [ u ] f ( u ) = I ( M ) x [ u ] f ( u ) .
The m-fold sequential GFD of the Riemann–Liouville type is defined as a composition of m GFDs with the kernel K ( x ) in the form
D ( K ) < m > , x [ u ] f ( u ) : = D ( K ) x [ x 1 ] D ( K ) x m 1 [ x m ] f ( x m )
with x > 0 , where D ( K ) < 1 > , x [ u ] f ( u ) = D ( K ) x [ u ] f ( u ) .
Theorem 6.
The triple R 1 = ( C 1 ( 0 , ) , + , ) with standard addition + and multiplication * in form of the Laplace convolution is a commutative ring without divisors of zero.
Proof. 
Theorem 6 is proved in [62]. □
As a corollary of Theorem 6, one can state that the kernel M < m > ( x ) with m N belongs to the space C 1 ( 0 , ) since the kernel M ( x ) belongs to the space C 1 ( 0 , ) . Then, the m-fold sequential GFI can be represented as a GFI with the kernel M < m > ( x ) in the form
I ( M ) < m > , x [ u ] f ( u ) = ( M < m > f ) ( x ) = I ( M < m > ) x [ u ] f ( u ) ,
where x > 0 .
The m-fold sequential GFD (33) is a generalization of the sequential GFD to the case of kernels that belong to the Luchko set L n .
Theorem 7
(First Fundamental Theorem of GFC for m-Fold Sequential GFD of Arbitrary Order). Let a kernel pair ( M , K ) belong to the Luchko set L n with n N .
Then, the m-fold sequential GFD (33) of the Riemann–Liouville type is a left inverse operator to the m-fold sequential GFI (32) in the form
D ( K ) < m > , x [ u ] I ( M ) < m > , u [ w ] f ( w ) = f ( x )
for all x > 0 , if f ( x ) C 1 ( 0 , ) and x > 0 .
Proof. 
Theorem 7 is proved in the same manner as Theorem 4 in [31], p. 10. By repeated application of the first fundamental theorem of the GFD of an arbitrary order in the form of Theorem 3 for the GFI (13) and the GFD (14), one can obtain (35). □
Let us define the space C 1 , ( M ) m ( 0 , ) .
Definition 9.
Let the kernel pair ( M , K ) belong to the Luchko set L n with n N , and let the function F ( x ) be represented in the form
F ( x ) = I ( M ) < m > , x [ u ] f ( u ) ,
for all x > 0 , where f ( x ) C 1 ( 0 , ) .
Then, this set of functions, F ( x ) , is denoted as C 1 , ( M ) m ( 0 , ) .
For the space C 1 , ( M ) m ( 0 , ) , the m-fold sequential GFD (33) of an arbitrary order is a right inverse operator to the m-fold GFI (32).
Theorem 8
(Second Fundamental Theorem of GFC for m-Fold Sequential GFD of Arbitrary Order for C 1 , ( M ) m ( 0 , ) ). Let the kernel pair ( M , K ) belong to the Luchko set L n with n N .
Then, the m-fold sequential GFD (33) of the Riemann–Liouville type is a right inverse operator to the m-fold GFI (32) in the form
I ( M ) < m > , x [ u ] D ( K ) < m > , u [ w ] F ( w ) = F ( x ) ,
for all x > 0 , if F ( x ) C 1 , ( M ) m ( 0 , ) .
Proof. 
Theorem 8 is proved in the same manner as Theorem 5 in [31], p. 10. □
Theorem 9.
Let the kernel pair ( M , K ) belong to the Luchko set L n with n N .
Then, the m-fold sequential GFD (33) of the Riemann–Liouville type can be represented as a GFD with the kernel K < m > ( x ) in the form
D ( K ) < m > , x [ u ] F ( u ) = D ( K < m > ) x [ u ] F ( u )
for x > 0 , if F C 1 , ( M ) m ( 0 , ) .
Proof. 
Theorem 9 is proved in [31], (see Theorem 5, p. 10). □
Remark 2.
Note that Equation (37) is not satisfied for the m-fold sequential GFD (33) defined on its domain
C 1 , ( K ) ( m ) ( 0 , ) = { F ( x ) C 1 ( 0 , ) : D ( K ) < k > , x [ u ] F ( u ) C 1 ( 0 , ) , k = 1 , , m } .
For the pair of the kernels ( M , K ) L n , n N , the space C 1 , ( M ) m ( 0 , ) , which is defined by Definition 9, is a subspace of the space C 1 , ( K ) ( m ) ( 0 , ) due to Theorem 7.
For the space C 1 , ( K ) ( m ) ( 0 , ) , a generalization of Equation (38) is considered to be the same as Theorem 6 in [31], p. 11, where a projector operator is used to prove the second fundamental theorem of the GFC of an m-fold sequential GFD of an arbitrary order.

3. Multi-Kernel GFC of Arbitrary Order

In this section, a multi-kernel approach, which is proposed in [35], is used to generalize the GFC of the sequential n-fold GF integrals and GF derivatives. The multi-kernel approach is used to expand the general fractional calculus due to its simultaneous use of different operator kernels. The multi-kernel approach is presented as a generalization of the Luchko results, which are derived in [31], for a set of kernel pairs ( M j , K j ) L n with n N , where j = 1 , , m . The multi-kernel general fractional operators of an arbitrary order are defined. The fundamental theorems of the multi-kernel GFC of an arbitrary order are proved.
Let us define the convolutional product f < 1 | m > ( x ) with m N by the equation
( f 1 f m ) ( x ) ,
where f j ( x ) C 1 ( 0 , ) for all j = 1 , , m .
Using Theorem 6, one can state that if f j ( x ) C 1 ( 0 , ) for all j = 1 , , m , then the convolutional product f < 1 | m > ( x ) with m N , which is defined by Equation (40), also belongs to the space, i.e., f < 1 | m > ( x ) C 1 ( 0 , ) .
Let us define the multi-kernel m-fold sequential GFI.
Definition 10.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
The multi-kernel m-fold sequential GFI is defined as a sequential action of the GFIs I ( M j ) x [ u j ] of an arbitrary order n with the kernels M j ( x ) and j = 1 , , m , in the form
I ( M ) < 1 | m > , x [ u ] f ( u ) : = I ( M 1 ) x [ x 2 ] I ( M m ) x m [ u ] f ( u )
with x > 0 and I ( M ) < 1 | 1 > , x [ u ] f ( u ) = I ( M 1 ) x [ u ] f ( u ) , where the GFIs I ( M j ) x [ u j ] are defined by Equation (13).
For the reverse order of kernels, the multi-kernel m-fold sequential GFI is defined as a composition of the GFIs I ( M j ) x [ u j ] of an arbitrary order n with the kernels M j ( x ) and j = 1 , , m , in the form
I ( M ) < m | 1 > , x [ u ] f ( u ) : = I ( M m ) x [ x m 1 ] I ( M 1 ) x 1 [ u ] f ( u )
with x > 0 , where the GFIs I ( M j ) x [ u j ] are defined by Equation (13).
The following statement describes the property of the m-fold sequential GFI for the multi-kernel case.
Theorem 10.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the multi-kernel GFI (41) of an arbitrary order can be represented as a GFI with the kernel M < 1 | m > ( x ) in the form
I ( M ) < 1 | m > , x [ u ] f ( u ) = I ( M < 1 | m > ) x [ u ] f ( u ) ,
for x > 0 , if f ( x ) C 1 ( 0 , ) .
Proof. 
Theorem 6, which is proved in [62], states that the triple R 1 = ( C 1 ( 0 , ) , + , ) is a commutative ring without divisors of zero. As a corollary of Theorem 6, one can state that the kernel M < 1 | m > ( x ) with m N belongs to the space C 1 ( 0 , ) since M j ( x ) belongs to the space C 1 ( 0 , ) for all j = 1 , , m , where M j ( x ) are the kernels of the GFIs of arbitrary orders. Then, the m-fold sequential GFI can be represented as a GFI with the kernel M < 1 | m > ( x ) in the form
I ( M ) < 1 | m > , x [ u ] f ( u ) = ( M < 1 | m > f ) ( x ) = I ( M < 1 | m > ) x [ u ] f ( u ) ,
where x > 0 . □
As a result, using the commutative and associative properties of the Laplace convolution, one can obtain that, for general fractional integrals, the following equality is satisfied
I ( M ) < m | 1 > , x [ u ] f ( u ) = I ( M ) < 1 | m > , x [ u ] f ( u ) .
For the case m = 3 , equality (45) means
I ( M 3 ) x [ x 2 ] I ( M 2 ) x 2 [ x 1 ] I ( M 1 ) x 1 [ u ] f ( u ) = I ( M 1 ) x [ x 2 ] I ( M 2 ) x 2 [ x 3 ] I ( M 3 ) x 3 [ u ] f ( u ) .
The m-fold sequential GFD (33) is a generalization of the sequential GFD to the case of the kernels that belong to the Luchko set L n .
Let us define the multi-kernel m-fold sequential GFD of the Riemann–Liouville type.
Definition 11.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
The multi-kernel m-fold sequential GFD of the Riemann–Liouville type is defined as a composition of the GFIs D ( K j ) x [ u j ] of an arbitrary order n with the kernels K j ( x ) and j = 1 , , m , in the form
D ( K ) < 1 | m > , x [ u ] f ( u ) : = D ( K 1 ) x [ x 2 ] D ( K m ) x m [ u ] f ( u )
with x > 0 and D ( K ) < 1 | 1 > , x [ u ] f ( u ) = D ( K 1 ) x [ u ] f ( u ) , where the GFDs D ( K j ) x [ u j ] are defined by Equation (14).
For the reverse order of kernels, the multi-kernel m-fold sequential GFD of the Riemann–Liouville type is defined as a composition of the GFIs D ( K j ) x [ u j ] of an arbitrary order n with the kernels K j ( x ) and j = 1 , , m , in the form
D ( K ) < m | 1 > , x [ u ] f ( u ) : = D ( K m ) x [ x m 1 ] D ( K 1 ) x 1 [ u ] f ( u )
with x > 0 , where the GFDs D ( K j ) x [ u j ] are defined by Equation (14).
Remark 3.
The multi-kernel m-fold sequential GFD of the Caputo type is defined similarly by using the GFD (15) of the Caputo type with the kernel K j ( x ) and j = 1 , , m .
For example, Equations (47) and (48) with m = 3 have the form
D ( K ) < 1 | 3 > , x [ u ] f ( u ) = D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ x 3 ] D ( K 3 ) x 3 [ u ] f ( u ) ,
D ( K ) < 3 | 1 > , x [ u ] f ( u ) = D ( K 3 ) x [ x 2 ] D ( K 2 ) x 2 [ x 1 ] D ( K 1 ) x 1 [ u ] f ( u ) .
Remark 4.
It should be emphasized that, in contrast to general fractional integrals, for general fractional derivatives, the following inequality is satisfied
D ( K ) < m | 1 > , x [ u ] f ( u ) D ( K ) < 1 | m > , x [ u ] f ( u ) ,
in the general case. For the case m = 2 , inequality (51) means
D ( K ) < 1 | 2 > , x [ u ] f ( u ) = D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ u ] f ( u ) D ( K 3 ) x [ x 2 ] D ( K 2 ) x 2 [ u ] f ( u ) = D ( K ) < 2 | 1 > , x [ u ] f ( u ) .
For the case m = 3 , equality (51) means
D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ x 3 ] D ( K 3 ) x 3 [ u ] f ( u ) D ( K 3 ) x [ x 2 ] D ( K 2 ) x 2 [ x 1 ] D ( K 1 ) x 1 [ u ] f ( u ) .
Let us prove the following fundamental theorem of the multi-kernel GFC.
Theorem 11
(First Fundamental Theorem of Multi-Kernel GFC of Arbitrary Order). Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the m-fold sequential GFD (47) of the Riemann–Liouville type is a left inverse operator to the m-fold sequential GFI (41) in the form
D ( K ) < 1 | m > , x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) = f ( x )
for all x > 0 , if the function f ( x ) belongs to the space C 1 ( 0 , ) .
Proof. 
By repeated application of the first fundamental theorem of the GFD of an arbitrary order in the form of Theorem 3 for the GFI (41) and the GFD (47), one can obtain (54).
In order to explain further transformations of the general case, we first consider the transformation of the right-hand side of Equation (54) for the case m = 3 :
D ( K ) < 1 | 3 > , x [ u ] I ( M ) < 1 | 3 > , u [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ x 3 ] D ( K 3 ) x 3 [ u ] I ( M 1 ) u [ x 2 ] I ( M 2 ) x 2 [ x 3 ] I ( M 3 ) x 3 [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ x 3 ] D ( K 3 ) x 3 [ u ] I ( M 3 ) u [ x 2 ] I ( M 2 ) x 2 [ x 1 ] I ( M 1 ) x 1 [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K 2 ) x 2 [ x 3 ] I ( M 2 ) x 3 [ x 1 ] I ( M 1 ) x 1 [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] I ( M 1 ) x 2 [ w ] f ( w ) = f ( x ) .
Here, Theorem 3, which is the first fundamental theorem of GFC, is used by taking into account that f ( x ) C 1 ( 0 , ) .
Let us consider the expression D ( K ) < 1 | m > , x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) with m N in the general form
D ( K ) < 1 | m > , x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K m 1 ) x m 1 [ x m ] D ( K m ) x m [ u ] I ( M 1 ) u [ x 2 ] I ( M 2 ) x 2 [ x 3 ] I ( M m ) x m [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K m 1 ) x m 1 [ x m ] D ( K m ) x m [ u ] I ( M m ) u [ x m 1 ] I ( M m 1 ) x m 1 [ x m 2 ] I ( M 1 ) x 1 [ w ] f ( w ) =
D ( K 1 ) x [ x 2 ] D ( K m 1 ) x m 1 [ x m ] I ( M m 1 ) x m [ x m 2 ] I ( M 1 ) x 1 [ w ] f ( w ) = =
D ( K 1 ) x [ x 2 ] I x 2 ( M 1 ) [ w ] f ( w ) = f ( x ) .
As a result, one can obtain
D ( K ) < 1 | m > , x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) = f ( x ) .
To consider the second fundamental theorem of the multi-kernel GFC of an arbitrary order, one should define the set C 1 , ( M ) < 1 | m > ( 0 , ) .
Definition 12.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N , and let the function F ( x ) be represented in the form
F ( x ) = I ( M ) < 1 | m > , x [ u ] f ( u )
for all x > 0 , where f ( x ) C 1 ( 0 , ) .
Then, this set of functions, F ( x ) , is denoted as C 1 , ( M ) < 1 | m > ( 0 , ) .
Equation (57) means that
F ( x ) = I ( M ) < 1 | m > , x [ u ] f ( u ) = I ( M 1 ) x [ x 1 ] I ( M m ) x m 1 [ u ] f ( u ) .
Using property (45) in the form
I ( M 1 ) x [ x 2 ] I ( M m ) x m [ u ] f ( u ) = I ( M m ) x [ x m 1 ] I ( M 1 ) x 1 [ u ] f ( u )
Equation (58) can also be written as
F ( x ) = I ( M m ) x [ x m 1 ] I ( M 1 ) x 1 [ u ] f ( u ) = I ( M ) < m | 1 > , x [ u ] f ( u ) .
For the set C 1 , ( M ) < 1 | m > ( 0 , ) , the m-fold sequential GFD (47) of an arbitrary order is also a right inverse operator to the m-fold GFI (41).
Theorem 12
(Second Fundamental Theorem of Multi-Kernel GFC of Arbitrary Order for C 1 , ( M ) < 1 | m > ( 0 , ) ). Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the m-fold sequential GFD (47) of the Riemann–Liouville type is a right inverse operator to the m-fold GFI (32) in the form
I ( M ) < 1 | m > , x [ u ] D ( K ) < 1 | m > , u [ w ] F ( w ) = F ( x )
for all x > 0 , if the function F ( x ) belongs to the set C 1 , ( M ) < 1 | m > ( 0 , ) .
Proof. 
For the case M j ( x ) = M ( x ) for all j = 1 , , m , Theorem 8 is proved in [31]. Let us consider the multi-kernel case.
Using the premise that F ( x ) belongs to the set C 1 , ( M ) < 1 | m > ( 0 , ) , one can obtain
I ( M ) < 1 | m > , x [ u ] D ( K ) < 1 | m > , u [ w ] F ( w ) = I ( M ) < 1 | m > , x [ u ] D ( K ) < 1 | m > , u [ w ] I ( M ) < 1 | m > , w [ s ] f ( s ) .
Let us consider the expression D ( K ) < 1 | m > , u [ w ] I ( M ) < 1 | m > , w [ s ] f ( s ) in the general form
D ( K ) < 1 | m > , u [ w ] I ( M ) < 1 | m > , w [ s ] f ( s ) =
D ( K 1 ) u [ x 2 ] D ( K m 1 ) x m 1 [ x m ] D ( K m ) x m [ w ] I ( M 1 ) w [ x 2 ] I ( M 2 ) x 2 [ x 3 ] I ( M m ) x m [ s ] f ( s ) =
D ( K 1 ) u [ x 2 ] D ( K m 1 ) x m 1 [ x m ] D ( K m ) x m [ w ] I ( M m ) w [ x m 1 ] I ( M m 1 ) x m 1 [ x m 2 ] I ( M 1 ) x 1 [ s ] f ( s ) =
D ( K 1 ) u [ x 2 ] D ( K m 1 ) x m 1 [ x m ] I ( M m 1 ) x m [ x m 2 ] I ( M 1 ) x 1 [ s ] f ( s ) = =
D ( K 1 ) u [ x 2 ] I ( M 1 ) x 2 [ s ] f ( s ) = f ( u ) .
Here, the following property of the GFIs is used
I ( M ) < m | 1 > , x [ u ] F ( u ) = I ( M ) < 1 | m > , x [ u ] F ( u ) .
As a result, Equation (64) has the form
D ( K ) < 1 | m > , u [ w ] I ( M ) < 1 | m > , w [ s ] f ( s ) = f ( u ) .
Using equality (65), Equation (62) gives
I ( M ) < 1 | m > , x [ u ] D ( K ) < 1 | m > , u [ w ] F ( w ) = I ( M ) < 1 | m > , x [ u ] f ( u ) .
Then, using the premise that the function f ( x ) belongs to the space C 1 , ( M ) < 1 | m > ( 0 , ) and it is represented as (57), Equation (66) gives
I ( M ) < 1 | m > , x [ u ] D ( K ) < 1 | m > , u [ w ] F ( w ) = F ( x ) .
This proves the equality. □
The following statement describes the property of the m-fold sequential GFD for the multi-kernel case.
Theorem 13.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the multi-kernel GFD (47) of an arbitrary order can be represented as a GFD with the kernel K < 1 | m > ( x ) in the form
D ( K ) < 1 | m > , x [ u ] F ( u ) = D ( K < 1 | m > ) x [ u ] F ( u ) ,
for x > 0 , if F ( x ) C 1 , ( M ) < 1 | m > ( 0 , ) .
Proof. 
For the function F ( x ) from C 1 , ( M ) < 1 | m > ( 0 , ) , using the first fundamental theorem of a multi-kernel GFD of arbitrary order, one can obtain
D ( K ) < 1 | m > , x [ u ] F ( u ) = D ( K ) < 1 | m > , x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) = D ( K ) < 1 | m > , x [ u ] I ( M ) < m | 1 > , u [ w ] f ( w ) = f ( x ) =
D ( K < 1 | m > ) x [ u ] I ( M < m | 1 > ) u [ w ] f ( w ) = D ( K < 1 | m > ) x [ u ] I ( M < 1 | m > ) u [ w ] f ( w ) =
D ( K < 1 | m > ) x [ u ] I ( M ) < 1 | m > , u [ w ] f ( w ) = D ( K < m > ) x [ u ] F ( u ) ,
where x > 0 . □

4. General Fractional Calculus on Finite Interval [a, b]

The formulation of the GFC of an arbitrary order, which was proposed in the previous section for the positive semi-axis ( 0 , ) , can be generalized to intervals including the negative part of the real axis.
Let us first give some comments about fractional integral with a power-law kernel for finite intervals. In this case, the fractional calculus is based on the Riemann–Liouville fractional integrals and the Riemann–Liouville and Caputo fractional derivatives. The Riemann–Liouville fractional integral on the finite interval ( a , b ) is defined by the equation
( I a + α g ) ( x ) = a x ( x u ) α 1 Γ ( α ) g ( u ) d u ,
where a < x < b and α > 0 . The fractional integral (69) is defined for the functions g ( x ) L 1 ( a , b ) .
Using Table 9.1 of [1], p. 173, one can see that the Riemann–Liouville fractional integrals on the finite interval ( a , b ) are considered for functions of the form
g ( x ) = f ( x a ) .
Almost all equations in Table 9.1 in [1] have the form
a x ( x u ) α 1 Γ ( α ) f ( u a ) d u = G ( x a ) .
For example, the first equation in Table 9.1 in [1], p. 173, has the form
a x ( x u ) α 1 Γ ( α ) ( u a ) β 1 d u = Γ ( β ) Γ ( α + β ) ( x a ) β 1 .
For another example, Equation (23) in Table 9.1 in [1], p. 173, has the form
a x ( x u ) α 1 Γ ( α ) ( u a ) β 1 E μ , β [ ( u a ) μ ] d u = ( x a ) α + β 1 E μ , α + β [ ( x a ) μ ] ,
where α > 0 , β > 0 , μ > 0 .
As a result, to consider the Riemann–Liouville fractional integrals (69) on the finite interval ( a , b ) , one can use the equation
( I a + α f ) ( x ) = a x ( x u ) α 1 Γ ( α ) f ( u a ) d u .
The representations of type (74) can be used to extend the applications of the general fractional calculus, in which an interval [ 0 , ) is considered. In this extension of the GFC, one can consider finite intervals [ a , b ] , where < a < b < , or infinite intervals [ a , b ) , where < a < b = .
Definition 13.
Let the kernel pair ( M , K ) belong to the Luchko set L n , and let the function f ( x ) belong to the space C 1 ( 0 , ) . Let < a < b .
Then, the GFI I ( M ) , a + x on the interval ( a , b ) is defined by the equation
I ( M ) , a + x [ t ] f ( t a ) : = a x M ( x t ) f ( t a ) d t ,
where x t > a .
Then, the GFD D ( K ) , a + x on the interval ( a , b ) is defined by the equation
D ( K ) , a + x [ t ] f ( t a ) : = d n d x n a x K ( x t ) f ( t a ) d t ,
where x t > a .
Let us prove the following property.
Proposition 1.
Let the kernel pair ( M , K ) belong to the Luchko set L n , and let the function f ( x ) belong to the space C 1 ( 0 , ) . Let < a < b .
Then, the GFI I ( M ) , a + x on the interval ( a , b ) can be represented as
I ( M ) , a + x [ t ] f ( t a ) = I ( M ) x a [ u ] f ( u ) ,
where x t > a and x a u > 0 .
Then, the GFD D ( M ) , a + x on the interval ( a , b ) can be represented as
D ( M ) , a + x [ t ] f ( t a ) = D ( M ) x a [ u ] f ( u ) ,
where x t > a and x a u > 0 .
Proof. 
Let us consider the GF integral
I ( M ) , a + x [ t ] g ( t ) : = a x M ( x t ) g ( t ) d t ,
where x t > a . Then, Equation (79) with g ( t ) = f ( t a ) has the form
I ( M ) , a + x [ t ] f ( t a ) = a x M ( x t ) f ( t a ) d t .
Using the variable u = t a , one can obtain
I ( M ) , a + x [ t ] f ( t a ) = 0 x a M ( x ( u + a ) ) f ( u ) d u = 0 x a M ( ( x a ) u ) f ( u ) d u .
Therefore, Equation (81) can be written as
I ( M ) , a + x [ t ] f ( t a ) = I ( M ) , 0 + x a [ u ] f ( u ) = I ( M ) x a [ u ] f ( u ) ,
where x t > a and x a u > 0 . Here, f ( x ) C 1 ( 0 , ) is defined on the interval [ 0 , ) or [ 0 , b a ] with < a < b . As a result, Equation (77) was proved.
For the GFD D ( M ) , a + x , Equation (78) is proved similarly. □
Equation (77) expresses the GF integral I ( M ) , a + x on the interval ( a , b ) in terms of the GF integral I ( M ) x by Equation (77), where the function f ( x ) C 1 ( 0 , ) can be considered for [ 0 , b a ] .
Similarly, one can define multi-kernel GF integrals on the finite interval ( a , b ) .
Definition 14.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with n N . Let the function f ( x ) belong to the space C 1 ( 0 , ) , and let < a < b .
The multi-kernel m-fold sequential GFI on the interval ( a , b ) is defined as a composition of m GFIs with the kernels M j ( x ) , j = 1 , , m , in the form
( I ( M ) , a + < 1 | m > f ) ( x ) = I ( M ) , a + < 1 | m > , x [ u ] f ( u a ) : = I ( M 1 ) , a + x [ x 2 ] I ( M m ) , a + x m [ u ] f ( u a ) ,
where x t > a and I ( M ) , a + < 1 | 1 > , x [ u ] f ( u a ) = I ( M 1 ) , a + x [ u ] f ( u a ) .
The multi-kernel m-fold sequential GFD on the interval ( a , b ) is defined as a composition of m GFDs with the kernels K j ( x ) , j = 1 , , m , in the form
( D ( K ) , a + < 1 | m > f ) ( x ) = D ( K ) , a + < 1 | m > , x [ u ] f ( u a ) : = D ( K 1 ) , a + x [ x 2 ] D ( K m ) , a + x m [ u ] f ( u a ) ,
where x t > a and D ( K ) , a + < 1 | 1 > , x [ u ] f ( u a ) = D ( K 1 ) , a + x [ u ] f ( u a ) .
Using Proposition 1, one can prove the following statement.
Theorem 14.
Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with n N . Let the function f ( x ) belong to the space C 1 ( 0 , ) , and let < a < b .
The multi-kernel m-fold sequential GFI on the interval ( a , b ) can be represented as
I ( M ) , a + < 1 | m > , x [ u ] f ( u a ) = I ( M ) < 1 | m > , x a [ w ] f ( w )
with x > a and I ( M ) , a + < 1 | 1 > , x [ u ] f ( u a ) = I ( M 1 ) , a + x [ u ] f ( u a ) , where x t > a and x a u > 0 .
The multi-kernel m-fold sequential GFD on the interval ( a , b ) can be represented as
D ( K ) , a + < 1 | m > , x [ u ] f ( u a ) = D ( K ) < 1 | m > , x a [ w ] f ( w ) .
with x > a and D ( K ) , a + < 1 | 1 > , x [ u ] f ( u a ) = D ( K 1 ) , a + x [ u ] f ( u a ) , where x t > a and x a u > 0 .
Proof. 
By repeated application of Proposition 1 to Equation (83), one can obtain
I ( M ) , a + < 1 | m > , x [ u ] f ( u a ) : = I ( M 1 ) , a + x [ x 2 ] I ( M 2 ) , a + x 2 [ x 3 ] I ( M m 1 ) , a + x m 1 [ x m ] I ( M m ) , a + x m [ u ] f ( u a ) =
I ( M 1 ) , a + x [ x 2 ] I ( M 2 ) , a + x 2 [ x 3 ] I ( M m 1 ) , a + x m 1 [ x m ] I ( M m ) , 0 + x m a [ w ] f ( w ) =
I ( M 1 ) , a + x [ x 2 ] I ( M 2 ) , a + x 2 [ x 3 ] I ( M m 1 ) , 0 + x m 1 a [ w m ] I ( M m ) , 0 + w m [ w ] f ( w ) =
I ( M 1 ) , a + x [ x 2 ] I ( M 2 ) , a + x 2 [ x 3 ] I ( M m 1 ) , 0 + w m 1 [ w m ] I ( M m ) , 0 + w m [ w ] f ( w ) =
I ( M 1 ) , a + x [ x 2 ] I ( M 2 ) , 0 + x 2 a [ w 3 ] I ( M m 1 ) , 0 + w m 1 [ w m ] I ( M m ) , 0 + w m [ w ] f ( w ) =
I ( M 1 ) , 0 + x a [ w 2 ] I ( M 2 ) , 0 + w 2 [ w 3 ] I ( M m 1 ) , 0 + w m 1 [ w m ] I ( M m ) , 0 + w m [ w ] f ( w ) =
I ( M ) , 0 + < 1 | m > , x a [ w ] f ( w ) = I ( M ) < 1 | m > , x a [ w ] f ( w ) .
This proves the equality. □
As a result, to consider the general fractional calculus on a finite interval ( a , b ) , where < a < b , one can use the already existing general fractional calculus in the Luchko form.
Theorem 15
(First Fundamental Theorem of Multi-Kernel GFC for ( a , ). Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the m-fold sequential GFD (47) of the Riemann–Liouville type is a left inverse operator to the m-fold sequential GFI (41) in the form
D ( K ) , a + < 1 | m > , x [ u ] I ( M ) , a + < 1 | m > , u [ t ] f ( t a ) = f ( x a )
for all x > a , if the function f ( x ) belongs to the space C 1 ( 0 , ) .
Proof. 
The proof of Theorem 15 is reduced to the proof of Theorem 11 by the following transformations
D ( K ) , a + < 1 | m > , x [ u ] I ( M ) , a + < 1 | m > , u [ w ] f ( t a ) = D ( K ) , a + < 1 | m > , x [ u ] I ( M ) , 0 + < 1 | m > , u a [ w ] f ( w ) =
D ( K ) , 0 + < 1 | m > , x a [ s ] I ( M ) , 0 + < 1 | m > , s [ w ] f ( w ) .
Theorem 16
(Second Fundamental Theorem of Multi-Kernel GFC for ( a , ) and C 1 , ( M ) < 1 | m > ( 0 , ) ). Let the kernel pairs ( M j , K j ) with j = 1 , , m belong to the Luchko set L n with m , n N .
Then, the m-fold sequential GFD (47) of the Riemann–Liouville type is a right inverse operator to the m-fold GFI (32) in the form
I ( M , a + ) < 1 | m > , x [ u ] D ( K ) , a + < 1 | m > , u [ t ] F ( t a ) = F ( x a )
for all x > a , if the function F ( x ) belongs to the set C 1 , ( M ) < 1 | m > ( 0 , ) .
Proof. 
The proof of Theorem 16 is reduced to the proof of Theorem 12 by the following transformations
I ( M , a + ) < 1 | m > , x [ u ] D ( K ) , a + < 1 | m > , u [ t ] F ( t a ) = I ( M , a + ) < 1 | m > , x [ u ] D ( K ) , 0 + < 1 | m > , u a [ w ] F ( w ) =
I ( M , 0 + ) < 1 | m > , x a [ s ] D ( K ) , 0 + < 1 | m > , s [ w ] F ( w ) .

5. Examples of Multi-Kernel GF Operators of Arbitrary Order

In this section, some examples of multi-kernel GF operators are considered.

5.1. Equations of Multi-Kernel GF Operators

Let us give some statements about the multi-kernel GFI and GFD.
Proposition 2.
Let the kernel pairs ( M j , K j ) belong to the Luchko set L 1 for all j = 1 , , m with m N .
Then, the kernel pairs ( h n 1 M j , K j ) belong to the Luchko set L n for all j = 1 , , m with m N and all n > 1 , n N . where
h n ( x ) = x n 1 ( n 1 ) ! .
and x > 0 .
Proof. 
The statement of Proposition 2 follows directly from Definitions 10 and 11 of the Luchko set L n . □
Note that function (92) is also denoted as { 1 } n .
Proposition 3.
Let the kernel pairs ( M j , K j ) belong to the Luchko set L 1 for all j = 1 , , m with m N .
Then, the kernels K < 1 | m > ( x ) and M < 1 | m > ( x ) can be represented in the following forms. For all n N , the kernel K < 1 | m > ( x ) is
K < 1 | m > ( x ) = ( K 1 K m ) ( x ) .
For n N , the kernel M < 1 | m > ( x ) is
M < 1 | m > ( x ) = , ( M 1 M m ) ( x ) n = 1 , ( h m ( n 1 ) M 1 M m ) ( x ) n 1 .
Proof. 
The statement of Proposition 3 follows directly from Proposition 2, Definitions 10 and 11 of the multi-kernel GFI and GFD of an arbitrary order, and Theorems 10 and 13. □
Let us define a set of kernel pairs for the multi-kernel GFI and GFD of an arbitrary order.
Definition 15.
Let the kernel pairs ( M j , K j ) belong to the Luchko set L 1 for all j = 1 , , m with m N .
Then, the set of kernel pairs ( M < 1 | m > , K < 1 | m > ) , in which the kernels can be represented in forms (93) and (94), is denoted as L n < 1 | m > , where n , m N .
Definition 16.
Let the pair ( M , K ) belong to the Luchko set L 1 .
Then, a set of kernel pairs ( M < 1 | m > , K < 1 | m > ) , in which the kernels can be represented in forms (93) and (94) with M j ( x ) = M ( x ) and K j ( x ) = K ( x ) for all j = 1 , , m , is denoted as L n < m > .
The set L n < m > is a subset of the set L n < 1 | m > . For m = 1 , one can see that L n < 1 | 1 > = L n and L n < 1 > = L n .
Theorem 17.
Let the kernel pair ( M < 1 | m > , K < 1 | m > ) belong to the set L n < 1 | m > such that the kernels can be represented in forms (93) and (94), where the pairs ( M j , K j ) belong to the Luchko set L 1 for all j = 1 , , m with m N .
Then, the multi-kernel GFI of an arbitrary order can be represented by the equations
I ( M ) < 1 | m > , x [ u ] f ( u ) = 0 x M < 1 | m > ( x u ) f ( u ) d u =
0 x ( h m ( n 1 ) M 1 M m ) ( x u ) f ( u ) d u ,
if f ( x ) C 1 ( 0 , ) and n > 1 . For n = 1 , the multi-kernel GFI and GFD of an arbitrary order have the form
I ( M ) < 1 | m > , x [ u ] f ( u ) = 0 x M < 1 | m > ( x u ) f ( u ) d u = 0 x ( M 1 M m ) ( x u ) f ( u ) d u .
Then, the multi-kernel GFD of an arbitrary order can be represented by the equations
D ( K ) < 1 | m > , x [ u ] F ( u ) = d n m d x n m 0 x K < 1 | m > ( x u ) F ( u ) d u =
d n m d x n m 0 x ( K 1 K m ) ( x u ) F ( u ) d u ,
if F ( x ) C 1 , ( M ) < 1 | m > ( 0 , ) .
Proof. 
The proof of Theorem 17 is based on Theorems 10 and 13. Using Theorem 10, one can obtain
I ( M ) < 1 | m > , x [ u ] f ( u ) = I ( M < 1 | m > ) x [ u ] f ( u ) ,
if f ( x ) belongs to the set C 1 ( 0 , ) . Using Theorem 13, one can obtain
D ( K ) < 1 | m > , x [ u ] F ( u ) = D ( K < 1 | m > ) x [ u ] F ( u ) ,
if F ( x ) belongs to the set C 1 , ( M ) < 1 | m > ( 0 , ) . Then, using the definitions of the GFI I ( M ) x , and the GFD D ( K ) x , Equation (93) gives the representations (95) and (96) as well as Equation (97). □
Note that the kernels M < 1 | m > ( x ) are defined for the kernels from the Luchko set L n , where the kernel of the GFI contains the function { 1 } n 1 = h n 1 ( x ) (see Theorem 2). Therefore, Equation (94) contains the function h m ( n 1 ) since the kernels M j ( x ) belong to the Luchko set L 1 .

5.2. Dimensions of Multi-Kernel GFI and GFD

For applications, the standard physical dimensions of the variables and quantities should be preserved [48,61]. To preserve the standard physical dimensions, one can assume that the dimensions of the GFI and GFD must coincide with the dimensions of the standard derivative and integral of the integer orders
[ I ( M j ) x [ u ] f ( u ) ] = [ 0 x f ( u ) d u ] , [ D ( K j ) x [ u ] F ( u ) ] = [ F ( 1 ) ( x ) ] .
Equation (100) lead to the dimensions of the GFI and GFD kernels, which belong to the Luchko set L 1 , in the form
[ K j ] = [ x ] 1 , [ M j ] = [ x ] 0 ,
where [ x ] 0 = [ 1 ] denotes the dimensionlessness of the quantity.
Using equalities (101), one can obtain the dimensions of the kernels, which belongs to the sets L n and L n < 1 | m > .
As a result, one can obtain the physical dimensions of the multi-kernel GFI I ( M ) < 1 | m > , x and the multi-kernel GFD D ( K ) < 1 | m > , x . To preserve the standard physical dimensions, one can assume that the dimensions of the GFI and GFD must coincide with the dimensions of the standard derivative and integral of the integer orders in the form
[ I ( M ) < 1 | m > , x ] = [ I 0 + n m f ( x ) ] , [ D ( K ) < 1 | m > , x f ( u ) ] = [ f n m ( x ) ] .
Using the following
( I 0 + n f ) ( x ) = 0 x d u 1 0 u 1 d u 2 0 u n 1 d u n f ( u n ) =
0 x ( x u ) n 1 ( n 1 ) ! f ( u ) d u = 0 x h n ( x u ) f ( u ) d u ,
one can obtain
[ I 0 + n ] = [ x ] n , [ h n ( x ) ] = [ x ] n 1 .
Then, using (94) for n > 1 , n N , one can derive the dimension of the kernel M < 1 | m > ( x ) via the following transformations
[ M < 1 | m > ( x ) ] = [ ( h m ( n 1 ) M 1 M m ) ( x ) ] =
[ h m ( n 1 ) ( x ) ] ( [ x ] 0 ) m [ x ] m = [ x ] m ( n 1 ) 1 + m = [ x ] m n 1 .
Using Equation (93), one can obtain
[ K < 1 | m > ( x ) ] = [ ( K 1 K m ) ( x ) ] = ( [ x ] 1 ) n [ x ] n 1 = [ x ] 1 .

5.3. Examples of Kernel Pairs from Luchko Set L 1

Let us give examples of the kernel pairs ( M j ( x ) , K j ( x ) ) that belong to the Luchko set L 1 and have the physical dimensions [ M j ( x ) ] = [ x ] 0 and [ K j ( x ) ] = [ x ] 1 , where j N . In these examples, λ > 0 , [ λ ] = [ x ] 1 , and x > 0 .
  • The kernels of the power-law type have the form
    M a ( x ) = h α ( λ x ) = ( λ x ) α 1 Γ ( α ) , K a ( x ) = λ h 1 α ( λ x ) = λ ( λ x ) α Γ ( 1 α ) .
  • The kernels of the Gamma distribution type have the form
    M b ( x ) = h α , λ ( λ x ) = ( λ x ) α 1 Γ ( α ) e λ x , K b ( x ) = λ h 1 α , λ ( λ x ) + λ Γ ( 1 α ) γ ( 1 α , λ x ) ,
    where γ ( β , x ) is the incomplete gamma function (see Section 9 in [63], pp. 134–142).
  • The kernels of the Mittag–Leffler type have the form
    M c ( x ) = ( λ x ) β 1 E α , β [ ( λ x ) α ] , K c ( x ) = λ h α β , λ ( λ x ) + λ h 1 β ( λ x ) ,
    where 0 < α β 1 , E α , β [ z ] is the two-parameter Mittag–Leffler function (see Section 3 in [64], pp. 17–54, [65] and Section 1.8 in [4], pp. 40–45). Here, the function
    e α , β ( x ) : = x β 1 E α , β [ x α ]
    can be used to simplify notations. Using function (110), the kernel M c ( x ) can be written as
    M c ( x ) = e α , β ( λ x ) .
  • The kernels of the Bessel type have the form
    M d ( x ) = ( λ x ) α 1 J α 1 ( 2 λ x ) , K d ( x ) = λ ( λ x ) α I α ( 2 λ x ) .
    where the function J α ( u ) is the Bessel function, and I α ( u ) is the modified Bessel function. The function
    ω α ( x ) : = ( x ) α 1 J α 1 ( 2 x )
    can be used to simplify notations. Using function (113), the kernel M d ( x ) can be written as
    M d ( x ) = ω α ( λ x ) .
  • The kernels of the hypergeometric Kummer type have the form
    M f ( x ) = ( λ x ) β 1 Φ ( α ; β ; λ x ) , K e ( x ) = λ sin ( π β ) π ( λ x ) β Φ ( α ; 1 β ; λ x ) ,
    where Φ ( α ; β ; x ) is the confluent hypergeometric Kummer function (Section 1.6 in [4], pp. 29–30). In Equation (115), one can use the function
    ϕ α , β ( x ) : = x β 1 Φ ( α ; β , x )
    to simplify notations. Using function (116), the kernel M f ( x ) can be written as
    M f ( x ) = ϕ α , β ( λ x ) .
Remark 5.
For other examples of kernel pairs from the Luchko set L 1 , see article [48]. Note that the examples can be expanded by using kernel pairs of the form ( M j , n e w = λ 1 K j ( x ) , K j , n e w = λ M j ( x ) ) for each pair ( M j ( x ) , K j ( x ) ) of these examples [48].

5.4. Examples of Calculating GF Integrals

To derive the multi-kernel GF operators, one should use equations of GF integration.
Proposition 4.
Equation
( h α ( λ x ) h β ( λ x ) ) = λ 1 h α + β ( λ x )
holds for all x > 0 , where α > 0 , λ > 0 .
Proof. 
Using function (107), one can consider the equation
0 x h α ( x u ) h β ( u ) d u = h α + β ( x ) ,
and the equation
0 x h α ( λ ( x u ) ) h β ( λ u ) d u = λ 1 h α + β ( λ x ) ,
where α > 0 and β > 0 . Equation (119) can be written in the form
( h α h β ) ( x ) = h α + β ( x ) ,
and Equation (120) as
( h α ( λ x ) h β ( λ x ) ) = λ 1 h α + β ( λ x ) .
Proposition 5.
Equation
( h α , λ ( λ x ) h β , λ ( λ x ) ) = λ 1 h α + β , λ ( λ x )
holds for all x > 0 , where α > 0 , λ > 0 .
Proof. 
For function (108), one can consider the equation
0 x h α , λ ( x u ) h β , λ ( u ) d u = h α + β , λ ( x )
which can be written as
( h α , λ ( λ x ) h β , λ ( λ x ) ) = λ 1 h α + β , λ ( λ x ) .
Proposition 6.
Equation
( h μ ( λ x ) e α , β ( λ x ) ) = λ 1 e α , β + μ ( λ x )
holds for all x > 0 , where α > 0 , β > 0 , μ > 0 , λ > 0 .
Proof. 
For function (109), one can use Equation (4).4.5 of [64], p. 61, (see also Equation (23) in Table 9.1 in [1], p. 173) in the form
1 Γ ( μ ) 0 x ( x u ) μ 1 u β 1 E α , β [ η u α ] d u = x β + μ 1 E α , β + μ [ η x α ] ,
where the parameters satisfy the conditions
μ > 0 , α > 0 , β > 0 .
Equation (127) can be written in the form
0 x ( λ ( x u ) ) μ 1 Γ ( μ ) ( λ u ) β 1 E α , β [ ( λ u ) α ] d u = λ 1 ( λ x ) β + μ 1 E α , β + μ [ ( λ x ) α ] .
Using functions (107) and (110), Equation (129) can be written in the form
( M a M c ) ( x ) = ( h μ ( λ x ) e α , β ( λ x ) ) = λ 1 e α , β + μ ( λ x ) .
Proposition 7.
Equation
( h μ ( λ x ) ω α ( λ x ) ) = λ 1 ω α + μ ( λ x )
holds for all x > 0 , where α > 0 , μ > 0 , λ > 0 .
Proof. 
For function (112), one can use the following example (see Equation (19) in Table 9.1 in [1], p. 172) in the form
1 Γ ( α ) 0 x ( x u ) α 1 u μ / 2 J μ ( λ u ) d u = 2 λ α x ( α + μ ) / 2 J α + μ ( λ x ) ,
where the parameters satisfy the conditions α > 0 , and μ > 1 . Equation (132) can be written ( μ μ 1 , λ 2 λ ) in the form
0 x ( λ ( x u ) ) α 1 Γ ( α ) ( λ u ) μ 1 J μ 1 ( 2 λ u ) d u = λ 1 ( λ x ) α + μ 1 J α + μ 1 ( 2 λ x ) ,
Using functions (112) and (113), Equation (133) can be rewritten in the form
( M a M d ) ( x ) = ( h μ ( λ x ) ω α ( λ x ) ) = λ 1 ω α + μ ( λ x ) .
Proposition 8.
Equation
( h α ( λ x ) e λ x ) = λ 1 e 1 , α + 1 ( λ x )
holds for all x > 0 , where α > 0 , λ > 0 .
Proof. 
Equation (8) in Table 9.1 in [1], p. 173, has the form
0 x ( x u ) α 1 Γ ( α ) e λ u d u = x α E 1 , α + 1 [ λ x ] ,
where α > 0 and x > 0 . Using functions (107) and (110), Equation (136) can be written as
( h α ( λ x ) e λ x ) = λ 1 e 1 , α + 1 ( λ x ) .
Equation (137) can be considered a special case of Equation (130) for α = β = 1 , μ = α , where E 1 , 1 [ x ] = exp ( x ) . □
Proposition 9.
Equation
( h α ( λ x ) h β , λ ( λ x ) ) = λ 1 ϕ β , α + β ( λ x )
holds for all x > 0 , where α > 0 , β > 0 , μ > 0 , λ > 0 .
Proof. 
Equation (9) in Table 9.1 in [1], p. 173, has the form
0 x ( x u ) α 1 Γ ( α ) u β 1 e λ u d u = Γ ( β ) Γ ( α + β ) x α + β 1 1 F 1 ( β ; α + β ; λ x ) ,
where α > 0 , β > 0 , x > 0 , and 1 F 1 ( a ; b ; z ) = Φ ( a ; b ; z ) is the confluent hypergeometric Kummer function [4], p. 29. Using functions (107), (108), and (116), Equation (139) can be written in the form
( M a M b ) ( x ) = ( h α ( λ x ) h β , λ ( λ x ) ) = λ 1 ϕ β , α + β ( λ x )
where λ > 0 . □
Proposition 10.
Equation
( h μ ( λ x ) ϕ α , β ( λ x ) ) = λ 1 ϕ α , β + μ ( λ x )
holds for all x > 0 , where α > 0 , β > 0 , μ > 0 , λ > 0 .
Proof. 
Using Equation (22) in Table 9.1 in [1], p. 173, in the form
0 x ( x u ) α 1 Γ ( α ) u β 1 Γ ( β ) 2 F 1 ( μ , ν ; β ; b u ) d u = u α + β 1 Γ ( α + β ) 2 F 1 ( μ , ν ; α + β ; b u )
holds for x > 0 , where α > 0 , β > 0 , μ > 0 , ν > 0 .
Using the parameter b = λ / ν and the limit
lim ν 2 F 1 ( μ , ν ; β ; ( λ / ν ) u ) = 1 F 1 ( μ ; β ; λ u ) ,
one can obtain
0 x ( x u ) α 1 Γ ( α ) u β 1 Γ ( β ) Φ ( μ ; β ; λ u ) d u = u α + β 1 Γ ( α + β ) Φ ( μ ; α + β ; λ u ) .
As a result, Equation (144) can be written as
( M a M f ) ( x ) = ( h μ ( λ x ) ϕ α , β ( λ x ) ) = λ 1 ϕ α , β + μ ( λ x )
holds for all x > 0 , where α > 0 , β > 0 , μ > 0 , λ > 0 . □

5.5. List of Functions and Equations to Derive Multi-Kernels

To build multi-kernel GF operators, the following functions can be considered. For GFI kernels, the parameter values of these functions should be restricted. In order for these functions to describe the operator kernels belonging to the set L 1 , the parameter values in these functions must be restricted. For example, the parameters of functions (146) and (149) are α ( 0 , 1 ) ; the parameters of functions (148) and (150) are 0 < α β < 1 ; the parameters of function (147) are α ( 0 , 1 ) and β > 0 . However, when considering sets L n , L n < m > , and L n < 1 | m > , the restrictions on the range of values of these parameters change.
h α ( x ) : = x α 1 Γ ( α ) .
h α , β ( x ) : = x α 1 Γ ( α ) e β x .
e α , β ( x ) : = x β 1 E α , β [ x α ] .
ω α ( x ) : = ( x ) α 1 J α 1 ( 2 x ) .
ϕ α , β ( x ) : = x β 1 Φ ( α , β ; x ) .
Note that functions (146), (147), and (149) belong to the set C 1 ( 0 , ) , if α > 0 . Functions (148) and (150) belong to the set C 1 ( 0 , ) , if β > 0 .
Let us define the following notation for the Laplace convolution
( f ( λ x ) g ( λ x ) ) = 0 x f ( λ ( x u ) ) g ( λ u ) d u .
To derive the kernels M < 1 | m > of the multi-kernel GF integrals and derivatives, the following equations can be used. In these equations, the parameters of the functions are assumed to be positive. Because of this, these equations can be reused any finite number of times for operator kernels belonging to the set L 1 to obtain the kernels M < 1 | m > .
( h α ( λ x ) h β ( λ x ) ) = λ 1 h α + β ( λ x ) .
( h α , λ ( λ x ) h β , λ ( λ x ) ) = λ 1 h α + β , λ ( λ x ) .
( h μ ( λ x ) e α , β ( λ x ) ) = λ 1 e α , β + μ ( λ x ) .
As a special case of this equation, one can consider
( h α ( λ x ) e λ x ) = λ 1 e 1 , α + 1 ( λ x )
where e 1 , 1 ( x ) = exp ( x ) . It should be noted that the function e α , β ( λ x ) belonging to the set L 1 is 0 < α β < 1 . Therefore, e 1 , 1 ( x ) = exp ( x ) cannot belong to the set L 1 .
( h μ ( λ x ) ω α ( λ x ) ) = λ 1 ω α + μ ( λ x ) .
( h α ( λ x ) h β , λ ( λ x ) ) = λ 1 ϕ β ; α + β ( λ x ) .
( h μ ( λ x ) ϕ α , β ( λ x ) ) = λ 1 ϕ α , β + μ ( λ x ) .
In these equations, one can consider x > 0 , and the parameters α > 0 , β > 0 , and λ > 0 .

5.6. Examples of Kernels of Multi-Kernel GF Integrals

In this subsection, some kernels of multi-kernel GF integrals are derived. Using Remark 5, one can state that examples of GFI kernels can be considered examples of GFD kernels, since one can use the kernel pairs ( M j , n e w = λ 1 K j ( x ) , K j , n e w = λ M j ( x ) ) for each pair ( M j ( x ) , K j ( x ) ) (for details, see [48]).
Let us consider the PL-type kernels in the form
M a | j ( x ) = h α j ( λ x ) , K a | j ( x ) = λ h 1 α j ( λ x ) ,
where all α j ( 0 , 1 ) , λ > 0 and j = 1 , , m . Kernel pair (159) belongs to the Luchko set L 1 for all j = 1 , , m , where m N . Then, the kernel pair
( h n 1 M a | j ) ( x ) = ( h n 1 h α j ) ( x ) = h α j + n 1 ( x ) , K a | j ( x ) = h 1 α j ( x ) ,
belongs to the Luchko set L n for all j = 1 , , m , where n , m N .
In the multi-kernel case, one can consider the kernels
M < 1 | m > ( x ) = ( h m ( n 1 ) M a | 1 M a | m ) ( x ) = ( h m ( n 1 ) h α ) ( x ) = h α + m ( n 1 ) ( x ) ,
K < 1 | m > ( x ) = ( K a | 1 K a | m ) ( x ) = h m α ( x ) ,
where
α = j = 1 m α j ,
and α j ( 0 , 1 ) for all j = 1 , , m . The pair of kernels (161) and (162) belongs to the set L n < 1 | m > , where n , m N .
As a result, the power-law functions of the form h α ( x ) can be used as kernels (161) and (162) of the multi-kernel GFI and GFD for all α > 0 instead of α ( 0 , 1 ) .
Note that
( M < 1 | m > K < 1 | m > ) ( x ) = ( h α + m ( n 1 ) h m α ) ( x ) = h m n ( x ) = { 1 } m n ( x ) ,
where 0 < α < m since 0 < α j < 1 for all j = 1 , , m .
Similarly, one can derive different operator kernels for the multi-kernel GF integrals and derivatives of arbitrary orders. Let us give examples of the kernels M < 1 | m > ( x ) .
Proposition 11.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j ( λ x ) for all j = 1 , , m , where α j ( 0 , 1 ) .
Then, the kernel of the multi-kernel GFI has the form
M a < 1 | m > ( x ) = λ m n + 1 h α + m ( n 1 ) ( λ x ) ,
where
α = j = 1 m α j ,
and α j ( 0 , 1 ) for all j = 1 , , m .
Proof. 
Using Equation (152) (see also (122)), one can obtain
( h α 1 ( λ x ) h α m ( λ x ) ) = λ ( m 1 ) h α ( λ x ) ,
where α is defined by Equation (166), and
M a < 1 | m > ( x ) = ( h m ( n 1 ) ( x ) λ m + 1 h α ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ m + 1 ( h m ( n 1 ) ( λ x ) h α ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ m + 1 λ 1 h α + m ( n 1 ) ( λ x ) = λ m n + 1 h α + m ( n 1 ) ( λ x ) ,
where α is defined by Equation (166). Note that [ M a < 1 | m > ( x ) ] = [ x ] m n 1 . □
Proposition 12.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j , λ ( λ x ) for all j = 1 , , m , where α j ( 0 , 1 ) .
Then, the kernel of the multi-kernel GFI has the form
M b < 1 | m > ( x ) = λ m n + 1 ϕ α , α + m ( n 1 ) ( λ x ) ,
where
α = j = 1 m α j .
and α j ( 0 , 1 ) for all j = 1 , , m .
Proof. 
Using Equation (153) (see also Equations (125) and (140)), one can obtain
( h α 1 , λ ( λ x ) h α m , λ ( λ x ) ) = λ ( m 1 ) h α , λ ( λ x ) ,
where α is defined by Equation (170), and
M b < 1 | m > ( x ) = ( h m ( n 1 ) ( x ) λ m + 1 h α , λ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ m + 1 ( h m ( n 1 ) ( λ x ) h α , λ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ m + 1 λ 1 ϕ α , α + m ( n 1 ) ( λ x ) = λ m n + 1 ϕ α , α + m ( n 1 ) ( λ x ) .
Proposition 13.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j ( λ x ) for all j = 1 , , ( m 1 ) , where α j ( 0 , 1 ) , and let M m ( x ) = e α , β ( λ x ) for j = m , where 0 < α β < 1 .
Then, the kernel of the multi-kernel GFI has the form
M c < 1 | m > ( x ) = λ ( m n 1 ) e α , β + μ + m ( n 1 ) ( λ x ) ,
where 0 < α β < 1 , and
μ = j = 1 m 1 α j ,
where α j ( 0 , 1 ) for all j = 1 , , ( m 1 ) .
Proof. 
Using the equality
( λ m 2 h μ ( λ x ) e α , β ( λ x ) ) = λ ( m 1 ) e α , β + μ ( λ x ) ,
where μ is defined by Equation (174), one can obtain
M c < 1 | m > ( x ) = ( h m ( n 1 ) ( x ) λ ( m 1 ) e α , β + μ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ ( m 1 ) ( h m ( n 1 ) ( λ x ) e α , β + μ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ ( m 1 ) λ 1 e α , β + μ + m ( n 1 ) ( λ x ) = λ ( m n 1 ) e α , β + μ + m ( n 1 ) ( λ x ) ,
where 0 < α β < 1 , λ > 0 . □
Proposition 14.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j ( λ x ) for all j = 1 , , ( m 1 ) , where α j ( 0 , 1 ) , and let M m ( x ) = ω α ( λ x ) for j = m , where 0 < α < 1 .
Then, the kernel of the multi-kernel GFI has the form
M d < 1 | m > ( x ) = λ ( m n 1 ) ω α + μ + m ( n 1 ) ( λ x ) .
where 0 < α < 1 and
μ = j = 1 m 1 α j ,
where α j ( 0 , 1 ) for all j = 1 , , ( m 1 ) .
Proof. 
Using the equality
( h α 1 ( λ x ) h α m 1 ( λ x ) = λ ( m 2 ) h μ ( λ x ) ,
where μ is defined by Equation (178), and
( λ ( m 2 ) h μ ( λ x ) ω α ( λ x ) ) = λ ( m 1 ) ω α + μ ( λ x ) ,
one can obtain
M d < 1 | m > ( x ) = ( h m ( n 1 ) ( x ) λ ( m 1 ) ω α + μ ( λ x ) ) = λ ( m ( n 1 ) 1 ) λ ( m 1 ) ( h m ( n 1 ) ( λ x ) ω α + μ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ ( m 1 ) λ 1 ω α + μ + m ( n 1 ) ( λ x ) = λ ( m n 1 ) ω α + μ + m ( n 1 ) ( λ x ) ,
where 0 < α < 1 and λ > 0 . □
Proposition 15.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j ( λ x ) for all j = 1 , , k , and let M j ( x ) = h α j , λ ( λ x ) for all j = k + 1 , , m ) , where β j i n ( 0 , 1 ) for all j = 1 , , m .
Then, the kernel of the multi-kernel GFI has the form
M f < 1 | m > ( x ) = λ ( m n 1 ) ϕ ν , m ( n 1 ) + η + ν ( λ x ) .
where
η = j = 1 k α j , ν = j = k + 1 m α j .
Proof. 
Using parameters (183), one can obtain the following
( h α 1 ( λ x ) h α k ( λ x ) ) = λ ( k 1 ) h η ( λ x ) ,
( h α k + 1 , λ ( λ x ) h α m , λ ( λ x ) ) = λ ( m k 1 ) h ν , λ ( λ x ) ,
where μ and ν are defined by Equation (183). Then,
M f < 1 | m > ( x ) = ( h m ( n 1 ) ( x ) λ ( k 1 ) h η ( λ x ) λ ( m k 1 ) h ν , λ ( λ x ) ) =
λ ( m ( n 1 ) 1 ) λ ( k 1 ) λ ( m k 1 ) ( h m ( n 1 ) ( λ x ) h η ( λ x ) h ν , λ ( λ x ) ) =
λ ( m n 3 ) λ 1 ( h m ( n 1 ) + η ( λ x ) h ν , λ ( λ x ) ) =
λ ( m n 2 ) ϕ ν , m ( n 1 ) + η + ν ( λ x ) = λ ( m n 1 ) ϕ ν , m ( n 1 ) + η + ν ( λ x ) .
Proposition 16.
Let ( M j , K j ) belong to the Luchko set L 1 such that M j ( x ) = h α j ( λ x ) for all j = 1 , , ( m 1 ) , where α j ( 0 , 1 ) , and let M m ( x ) = ϕ α , β ( λ x ) for j = m , where 0 < α β < 1 .
Then, the kernel of the multi-kernel GFI has the form
M g < 1 | m > ( x ) = λ ( m n 1 ) ϕ α , β + μ + m ( n 1 ) ( λ x ) ,
where 0 < α β < 1 , and
μ = j = 1 m 1 α j .
Proof. 
Using the equalities
( h α 1 ( λ x ) h α m 1 ( λ x ) ) = λ ( m 2 ) h μ ( λ x ) ,
and
( h m ( n 1 ) ( x ) λ ( m 2 ) h μ ( λ x ) ) = λ ( m ( n 1 ) 1 ) λ ( m 2 ) ( h m ( n 1 ) ( λ x ) h μ ( λ x ) ) =
λ ( m n 3 ) λ 1 h m ( n 1 ) + μ ( λ x )
where μ is defined by Equation (188), one can obtain
M g < 1 | m > ( x ) = λ ( m n 2 ) ( h m ( n 1 ) + μ ( λ x ) ϕ α , β ( λ x ) ) = λ ( m n 1 ) ϕ α , β + μ + m ( n 1 ) ( λ x ) .

6. Conclusions

Let us briefly list the main results obtained in this article. The multi-kernel GFC of an arbitrary order on the interval ( 0 , ) is proposed as a generalization of Luchko’s single-kernel GFC of an arbitrary order, described in [27,29,30,31], and the multi-kernel approach suggested in [35]. The multi-kernel GFC is also proposed for the finite intervals ( a , b ) , where < a < b < . These calculi can be considered one of the possible solutions to Problem 1 of general fractional calculus, described by Luchko in Section “2.4 Open problems” of his work [37], p. 3255.

Funding

This research received no external funding.

Conflicts of Interest

The author declare no conflict of interest.

References

  1. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives: Theory and Applications; Gordon and Breach: New York, NY, USA, 1993. [Google Scholar]
  2. Kiryakova, V. Generalized Fractional Calculus and Applications; Longman and J. Wiley: New York, NY, USA, 1994; ISBN 9780582219779. [Google Scholar]
  3. Podlubny, I. Fractional Differential Equations; Academic Press: San Diego, CA, USA, 1998; ISBN 978-0-12-558840-9. [Google Scholar]
  4. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006; ISBN 9780444518323. [Google Scholar]
  5. Diethelm, F. The Analysis of Fractional Differential Equations. An Application-Oriented Exposition Using Differential Operators of Caputo Type; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar] [CrossRef] [Green Version]
  6. Kochubei, A.; Luchko, Y. (Eds.) Handbook of Fractional Calculus with Applications. Volume 1. Basic Theory; Walter de Gruyter GmbH: Berlin, Germany; Boston, MA, USA, 2019; 481p. [Google Scholar] [CrossRef]
  7. Kochubei, A.; Luchko, Y. (Eds.) Handbook of Fractional Calculus with Applications. Volume 2. Fractional Differential Equations; Walter de Gruyter GmbH: Berlin, Germany; Boston, MA, USA, 2019. [Google Scholar] [CrossRef] [Green Version]
  8. Tarasov, V.E. Fractional Dynamics: Applications of Fractional Calculus to Dynamics of Particles, Fields and Media; Springer: New York, NY, USA, 2010. [Google Scholar] [CrossRef] [Green Version]
  9. Klafter, J.; Lim, S.C.; Metzler, R. (Eds.) Fractional Dynamics. Recent Advances; World Scientific: Singapore, 2011. [Google Scholar] [CrossRef]
  10. Mainardi, F. Fractional Calculus and Waves in Linear Viscoelasticity: An Introduction to Mathematical Models; World Scientific: Singapore, 2010. [Google Scholar] [CrossRef]
  11. Uchaikin, V.; Sibatov, R. Fractional Kinetics in Solids: Anomalous probability Transport in Semiconductors, Dielectrics and Nanosystems; World Scientific: Singapore, 2013. [Google Scholar] [CrossRef]
  12. Atanackovic, T.; Pilipovic, S.; Stankovic, B.; Zorica, D. Fractional Calculus with Applications in Mechanics: Vibrations and Diffusion Processes; Wiley-ISTE: London, UK; Hoboken, NJ, USA, 2014. [Google Scholar]
  13. Atanackovic, T.; Pilipovic, S.; Stankovic, B.; Zorica, D. Fractional Calculus with Applications in Mechanics: Wave Propagation, Impact and Variational Principles; Wiley-ISTE: London, UK; Hoboken, NJ, USA, 2014. [Google Scholar]
  14. Povstenko, Y. Fractional Thermoelasticity; Springer: Cham, Switzerland; Berlin/Heidelberg, Germany; New York, NY, USA; Dordrecht, The Netherlands; London, UK, 2015. [Google Scholar] [CrossRef]
  15. Uchaikin, V.; Sibatov, R. Fractional Kinetics in Space. Anomalous Transport Models; Worls Scientific: Singapore, 2018. [Google Scholar] [CrossRef]
  16. Tarasov, V.E. (Ed.) Mathematical Economics: Application of Fractional Calculus; MDPI: Basel, Switzerland, 2020. [Google Scholar] [CrossRef]
  17. Tarasov, V.E.; Tarasova, V.V. Economic Dynamics with Memory: Fractional Calculus Approach; De Gruyter: Berlin, Germany; Boston, MA, USA, 2021; 602p. [Google Scholar] [CrossRef]
  18. Tarasov, V.E. (Ed.) Handbook of Fractional Calculus with Applications. Volume 4. Application in Physics. Part A; Walter de Gruyter GmbH: Berlin, Germany; Boston, MA, USA, 2019. [Google Scholar] [CrossRef]
  19. Tarasov, V.E. (Ed.) Handbook of Fractional Calculus with Applications. Volume 5. Application in Physics. Part B; Walter de Gruyter GmbH: Berlin, Germany; Boston, MA, USA, 2019. [Google Scholar] [CrossRef] [Green Version]
  20. Sonine, N. On the generalization of an Abel formula. (Sur la generalisation d’une formule d’Abel). Acta Math. 1884, 4, 171–176. (In French) [Google Scholar] [CrossRef]
  21. Sonin, N.Y. On the generalization of an Abel formula. In Investigations of Cylinder Functions and Special Polynomials; GTTI: Moscow, Russia, 1954; pp. 148–154, (In Russian). Available online: https://ur.zlibcdn2.com/book/2157173/2a8410 (accessed on 22 February 2023).
  22. Kochubei, A.N. General fractional calculus, evolution equations and renewal processes. Integral Equations Oper. Theory 2011, 71, 583–600. [Google Scholar] [CrossRef] [Green Version]
  23. Luchko, Y. General fractional integrals and derivatives with the Sonine kernels. Mathematics 2021, 9, 594. [Google Scholar] [CrossRef]
  24. Kochubei, A.N. General fractional calculus. Chapter 5. In Handbook of Fractional Calculus with Applications. Volume 1. Basic Theory; Kochubei, A.N., Luchko, Y., Eds.; De Gruyter: Berlin, Germany; Boston, MA, USA, 2019; pp. 111–126. [Google Scholar] [CrossRef]
  25. Kochubei, A.N. Equations with general fractional time derivatives. Cauchy problem. Chapter 11. In Handbook of Fractional Calculus with Applications. Volume 2. Fractional Differential Equations; Kochubei, A.N., Luchko, Y., Eds.; De Gruyter: Berlin, Germany; Boston, MA, USA, 2019; pp. 223–234. [Google Scholar] [CrossRef]
  26. Hanyga, A. A comment on a controversial issue: A generalized fractional derivative cannot have a regular kernel. Fract. Calc. Appl. Anal. 2020, 23, 211–223. [Google Scholar] [CrossRef] [Green Version]
  27. Luchko, Y. General fractional integrals and derivatives of arbitrary order. Symmetry 2021, 13, 755. [Google Scholar] [CrossRef]
  28. Luchko, Y. Operational calculus for the general fractional derivatives with the Sonine kernels. Fract. Calc. Appl. Anal. 2021, 24, 338–375. [Google Scholar] [CrossRef]
  29. Luchko, Y. Special functions of fractional calculus in the form of convolution series and their applications. Mathematics 2021, 9, 2132. [Google Scholar] [CrossRef]
  30. Luchko, Y. Convolution series and the generalized convolution Taylor formula. Fract. Calc. Appl. Anal. 2022, 25, 207–228. [Google Scholar] [CrossRef]
  31. Luchko, Y. Fractional differential equations with the general fractional derivatives of arbitrary order in the Riemann-Liouville sense. Mathematics 2022, 10, 849. [Google Scholar] [CrossRef]
  32. Luchko, Y. The 1st level general fractional derivatives and some of their properties. J. Math. Sci. 2022. [Google Scholar] [CrossRef]
  33. Al-Kandari, M.; Hanna, L.A.M.; Luchko, Y. Operational calculus for the general fractional derivatives of arbitrary order. Mathematics 2022, 10, 1590. [Google Scholar] [CrossRef]
  34. Al-Refai, M.; Luchko, Y. Comparison principles for solutions to the fractional differential inequalities with the general fractional derivatives and their applications. J. Differ. Equations 2022, 319, 312–324. [Google Scholar] [CrossRef]
  35. Tarasov, V.E. General fractional calculus: Multi-kernel approach. Mathematics 2021, 9, 1501. [Google Scholar] [CrossRef]
  36. Tarasov, V.E. General fractional vector calculus. Mathematics 2021, 9, 2816. [Google Scholar] [CrossRef]
  37. Diethelm, K.; Kiryakova, V.; Luchko, Y.; Tenreiro Machado, J.A.; Tarasov, V.E. Trends, directions for further research, and some open problems of fractional calculus. Nonlinear Dyn. 2022, 107, 3245–3270. [Google Scholar] [CrossRef]
  38. Samko, S.G.; Cardoso, R.P. Integral equations of the first kind of Sonine type. Int. J. Math. Math. Sci. 2003, 2003, 238394. [Google Scholar] [CrossRef] [Green Version]
  39. Samko, S.G.; Cardoso, R.P. Sonine integral equations of the first kind in Ly(0;b). Fract. Calc. Appl. Anal. 2003, 6, 235–258. [Google Scholar]
  40. Toaldo, B. Convolution-type derivatives, hitting times of subordinators and time-changed C0-semigroups. Potential Anal. 2015, 42, 115–140. [Google Scholar] [CrossRef] [Green Version]
  41. Luchko, Y.; Yamamoto, M. General time-fractional diffusion equation: Some uniqueness and existence results for the initial-boundary-value problems. Fract. Calc. Appl. Anal. 2016, 19, 675–695. [Google Scholar] [CrossRef]
  42. Luchko, Y.; Yamamoto, M. The general fractional derivative and related fractional differential equations. Mathematics 2020, 8, 2115. [Google Scholar] [CrossRef]
  43. Sin, C.-S. Well-posedness of general Caputo-type fractional differential equations. Fract. Calc. Appl. Anal. 2018, 21, 819–832. [Google Scholar] [CrossRef]
  44. Ascione, G. Abstract Cauchy problems for the generalized fractional calculus. Nonlinear Anal. 2021, 209, 112339. [Google Scholar] [CrossRef]
  45. Giusti, A. General fractional calculus and Prabhakar’s theory. Commun. Nonlinear Sci. Numer. Simul. 2020, 83, 105114. [Google Scholar] [CrossRef] [Green Version]
  46. Bazhlekova, E. Estimates for a general fractional relaxation equation and application to an inverse source problem. Math. Methods Appl. Sci. 2018, 41, 9018–9026. [Google Scholar] [CrossRef] [Green Version]
  47. Bazhlekova, E.; Bazhlekov, I. Identification of a space-dependent source term in a nonlocal problem for the general time-fractional diffusion equation. J. Comput. Appl. Math. 2021, 386, 113213. [Google Scholar] [CrossRef]
  48. Tarasov, V.E. Nonlocal probability theory: General fractional calculus approach. Mathematics 2022, 10, 848. [Google Scholar] [CrossRef]
  49. Kochubei, A.N.; Kondratiev, Y.G. Fractional kinetic hierarchies and intermittency. Kinetic and related models. Am. Inst. Math. Sci. 2017, 10, 725–740. [Google Scholar] [CrossRef]
  50. Kochubei, A.N.; Kondratiev, Y.G. Growth equation of the general fractional calculus. Mathematics 2019, 7, 615. [Google Scholar] [CrossRef] [Green Version]
  51. Tarasov, V.E. General fractional dynamics. Mathematics 2021, 9, 1464. [Google Scholar] [CrossRef]
  52. Kondratiev, Y.; da Silva, J. Cesaro limits for fractional dynamics. Fractal Fract. 2021, 5, 133. [Google Scholar] [CrossRef]
  53. Kinash, N.; Janno, J. Inverse problems for a generalized subdiffusion equation with final overdetermination. Math. Model. Anal. 2019, 24, 236–262. [Google Scholar] [CrossRef]
  54. Kinash, N.; Janno, J. An inverse problem for a generalized fractional derivative with an application in reconstruction of time- and space- dependent sources in fractional diffusion and wave equations. Mathematics 2019, 7, 1138. [Google Scholar] [CrossRef] [Green Version]
  55. Atanackovic, T.M.; Pilipovic, S. Zener model with deneral fractional calculus: Thermodynamical restrictions. Fractal Fract. 2022, 6, 617. [Google Scholar] [CrossRef]
  56. Miskovic-Stankovic, V.; Janev, M.; Atanackovic, T.M. Two compartmental fractional derivative model with general fractional derivative. J. Pharmacokinet. Pharmacodyn. 2022, 50, 79–87. [Google Scholar] [CrossRef]
  57. Tarasov, V.E. General non-Markovian quantum dynamics. Entropy 2021, 23, 1006. [Google Scholar] [CrossRef]
  58. Tarasov, V.E. General non-local continuum mechanics: Derivation of balance equations. Mathematics 2022, 10, 1427. [Google Scholar] [CrossRef]
  59. Tarasov, V.E. General non-local electrodynamics: Equations and non-local effects. Ann. Phys. 2022, 445, 169082. [Google Scholar] [CrossRef]
  60. Tarasov, V.E. Nonlocal classical theory of gravity: Massiveness of nonlocality and mass shielding by nonlocality. Eur. Phys. J. Plus 2022, 137, 1336. [Google Scholar] [CrossRef]
  61. Tarasov, V.E. Nonlocal statistical mechanics: General fractional Liouville equations and their solutions. Phys. A Stat. Mech. Its Appl. 2023, 609, 128366. [Google Scholar] [CrossRef]
  62. Luchko, Y.; Gorenflo, R. An operational method for solving fractional differential equations. Acta Math. Vietnam. 1999, 24, 207–234. [Google Scholar]
  63. Erdelyi, A.; Magnus, W.; Oberhettinger, F.; Tricomi, F.G. Higher Transcendental Functions; Volume II, (Bateman Manuscript Project); McGraw-Hill: New York, NY, USA, 1953. [Google Scholar]
  64. Gorenflo, R.; Kilbas, A.A.; Mainardi, F.; Rogosin, S.V. Mittag-Leffler Functions, Related Topics and Applications; Springer: Berlin/Heidelberg, Germany, 2014; 443p. [Google Scholar] [CrossRef]
  65. Gorenflo, R.; Kilbas, A.A.; Mainardi, F.; Rogosin, S.V. Mittag-Leffler Functions, Related Topics and Applications, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 2020; 443p. [Google Scholar] [CrossRef]
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

Tarasov, V.E. Multi-Kernel General Fractional Calculus of Arbitrary Order. Mathematics 2023, 11, 1726. https://doi.org/10.3390/math11071726

AMA Style

Tarasov VE. Multi-Kernel General Fractional Calculus of Arbitrary Order. Mathematics. 2023; 11(7):1726. https://doi.org/10.3390/math11071726

Chicago/Turabian Style

Tarasov, Vasily E. 2023. "Multi-Kernel General Fractional Calculus of Arbitrary Order" Mathematics 11, no. 7: 1726. https://doi.org/10.3390/math11071726

APA Style

Tarasov, V. E. (2023). Multi-Kernel General Fractional Calculus of Arbitrary Order. Mathematics, 11(7), 1726. https://doi.org/10.3390/math11071726

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