Home Efficient scheme for a category of variable-order optimal control problems based on the sixth-kind Chebyshev polynomials
Article Open Access

Efficient scheme for a category of variable-order optimal control problems based on the sixth-kind Chebyshev polynomials

  • Khadijeh Sadri EMAIL logo , Kamyar Hosseini , Soheil Salahshour , Dumitru Baleanu , Ali Ahmadian and Choonkil Park EMAIL logo
Published/Copyright: November 22, 2024
Become an author with De Gruyter Brill

Abstract

The main goal of the present study is to introduce an operational collocation scheme based on sixth-kind Chebyshev polynomials (SCPs) to solve a category of optimal control problems involving a variable-order dynamical system (VODS). To achieve this goal, the collocation method based on SCPs, the pseudo-operational matrix for the fractional integral operator, and the dual operational matrix are adopted. More precisely, an algebraic equation is obtained instead of the objective function and a system of algebraic equation is derived instead of the VODS. The constrained equations obtained from joining the objective function to the VODS are ultimately optimized using the method of the Lagrange multipliers. Detailed convergence analysis of the suggested method is given as well. Four illustrative examples along with several tables and figures are formally provided to support the efficiency and preciseness of the numerical scheme.

MSC 2010: 34H05; 34A08; 33C45

1 Introduction

Fractional operators exhibit real-world phenomena better due to their memory properties unlike their classic counterparts. Diverse definitions have been presented for integral and derivative operators with fractional orders that the most applicable are the Caputo and Riemann-Liouville operators [16]. The variable-order integration and derivative are extensions of their classical definitions. In fractional integral and derivative operators with variable orders, the orders depend on the time variable or the space variable or both of them that nowadays have much popularity in various fields of engineering and science [715]. In addition, Kashif et al. applied an efficient variable-order Bernstein collocation technique to a nonlinear coupled system of variable-order reaction-diffusion equations [16]. Ganji and Jafari considered the shifted Legendre and shifted Chebyshev polynomials for solving multi-variable orders differential equations [17]. Jafari et al. [18] proposed a numerical approach based on the shifted fifth-kind Chebyshev polynomials to study a category of variable-order integro-differential equations. Precise modeling of fractional functional equations emerged in diverse problems of engineering, such as the bioengineering, viscoelasticity, and dynamics of interfaces between substrates and nanoparticles, gives rise to variable-order optimal control problems (VOCPs) via joining these equations to an objective function and a set of initial and/or boundary conditions [1922]. Tajadodi [8] used Genocchi polynomials to solve a type of VOCP. Dehestani et al. [19] used fractional-order Bessel wavelets for numerically solving these equations. Heydari et al. [20] applied the Chebyshev cardinal functions to VFOCPs with dynamical systems of weakly singular variable-order integral equations. Hassani and Avazzadeh [22] used the transcendental Bernstein series for solving nonlinear VFOCPs. Heydari [23], Heydari and Avazzadeh [24] introduced new direct methods based on the Chebyshev cardinal functions and the wavelet method for VFOCPs. A Legendre collocation method and a nonstandard finite difference method were proposed to solve VFOCPs in [25,26].

The spectral methods along with orthogonal polynomials as basis functions are very popular and efficient. The Galerkin, Tau, and collocation are the three most widely used methods of the family of the spectral methods. The Chebyshev polynomials of the first to fourth kinds have many applications as basis functions in the spectral methods [2733]. The other two sorts of Chebyshev polynomials are called the Chebyshev polynomials of the fifth and sixth kinds that have been applied to solve some fractional ordinary differential equations [3436]. After introducing the Chebyshev polynomials of the sixth kind by Masjed-Jamei [37] and due to the complex structure of this category of polynomials and their weight functions compared to the first- and second-kind Chebyshev polynomials, researchers and mathematicians have rarely used it as a basis in spectral methods. Although recently, Chebyshev polynomials of the sixth type have been considered as basis functions in spectral methods for solving fractional Rayleigh-Stokes problems, time-fractional heat equations, and hyperbolic-telegraph problems [3841]. This work shows efficiency of these polynomials by obtaining a suitable approximate solution to the problem under study. The aim of the current work is to achieve the following:

  • Establishing an operational collocation scheme based on the sixth-kind shifted Chebyshev polynomials for solving the variable-order Caputo control problems with boundary conditions.

  • Displaying the accuracy of the suggested method via estimating an error bound for the residual function in a Chebyshev-weighted Sobolev space.

  • Acquiring more precise approximations to the problems under study compared to approximations reported in previous studies [19,42].

  • Considering the best approximation to the exact solution in a Chebyshev-weighted space for finding the error bound in addition to considering the approximate solution obtained from the suggested method.

Hence, in the present work, a numerical scheme is constructed by coupling the collocation method and the sixth-kind Chebyshev polynomials (SCPs) as the basis functions for solving the following VOCP:

(1.1) Min J [ x , u ] = 0 1 ( t , x ( t ) , u ( t ) ) d t ,

(1.2) D t θ ( t ) 0 C x ( t ) = G ( t , x ( t ) , x ˙ ( t ) , u ( t ) ) , 0 < θ ( t ) 1 ,

with the conditions

(1.3) x ( 0 ) = η 0 , x ( 1 ) = η 1 ,

where x ( t ) and u ( t ) are the state and control variables, respectively, η 0 and η 1 are the real constants, and G are the smooth functions, D t θ ( t ) 0 C is the variable-order derivative operator in the Caputo sense, and t J = [ 0 , 1 ] is the time variable. x ( t ) , u ( t ) , and their derivatives are continuous functions and there exist finite constants i , x for i = 1 , 2 , 1 , u , and θ such that

x ( t ) 1 , x , x ˙ ( t ) 1 , x ˙ , u ( t ) 1 , u , D t θ ( t ) 0 C x ( t ) θ .

In this respect, first a pseudo-operational matrix for the fractional integration and a dual operational matrix (related to the product of basis vectors) for the SCPs are derived. The stated and control variables are approximated by the operational matrices and the basis vector. Approximations are substituted into performance index (1.1), variable-order dynamical system (VODS) (1.2), and conditions (1.3). These approximations and matrices avoid the direct use of the integration and derivative operations. Thus, the given problem is converted into a set of algebraic equations. In the next step, constraint equations obtained from the algebraic system are joined to the performance index using a set of unknown Lagrange multipliers. Ultimately, optimal conditions provide a nonlinear system of algebraic equations, by solving which, unknown coefficients are determined.

This study is structured as follows: some definitions of variable-order operators are given in Section 2. The Chebyshev polynomials of the sixth kind, some of their properties, and their operational matrices are presented in Section 3. In Section 4, the suggested approach is explained. Error bounds for approximate solutions and the residual functions of the performance index and VODS are calculated in Section 5. The efficiency and accuracy of the proposed approach are illustrated by reporting numerical results in Section 6. Section 7 concludes briefly.

2 Preliminary definitions

Definition 2.1

The variable-order derivative in the Caputo sense of the order θ ( t ) ( θ : [ 0 , 1 ] ( 0 , 1 ] ) of the differentiable function f is defined as [19]:

(2.1) D t θ ( t ) 0 C f ( t ) = f ( t ) , θ ( t ) = 1 , 1 Γ ( 1 θ ( t ) ) 0 t ( t s ) θ ( t ) f ( s ) d s , otherwise .

The following results are obtained based on the above definition:

( 1 ) D t θ ( t ) 0 C A = 0 , A is a constant, ( 2 ) D t θ ( t ) 0 C D t ϑ ( t ) 0 C f ( t ) = D t θ ( t ) + ϑ ( t ) 0 C f ( t ) , ( 3 ) D t θ ( t ) 0 C t ν = Γ ( ν + 1 ) t ν θ ( t ) Γ ( ν θ ( t ) + 1 ) , ν 1 , 0 , otherwise .

Definition 2.2

The variable-order integral in the Riemann-Liouville sense with the order θ ( t ) of the continuous function f is as follows [20]:

(2.2) t θ ( t ) 0 R L f ( t ) = 1 Γ ( θ ( t ) ) 0 t ( t s ) θ ( t ) 1 f ( s ) d s , θ ( t ) > 0 , f ( t ) , θ ( t ) = 0 .

Based on Definition (2.2), the following properties are obtained:

( 1 ) D t θ ( t ) 0 C f ( t ) = t 1 θ ( t ) 0 R L f ( t ) , ( 2 ) t θ ( t ) 0 R L t ν = Γ ( ν + 1 ) t ν + θ ( t ) Γ ( ν + θ ( t ) + 1 ) .

3 SCPs and their operational matrices

In this section, the SCPs are introduced and their operational matrices are constructed.

3.1 SCPs

These polynomials are defined over the interval [ 1 , 1 ] as follows [36,43]:

Y ¯ j ( t ) = S ¯ j 5 , 2 , 1 , 1 ( t ) , t [ 1 , 1 ] ,

where

S ¯ j 5 , 2 , 1 , 1 ( t ) = j 2 l = 0 ( 2 l + ( 1 ) j + 1 + 2 ) + 2 2 l + ( 1 ) j + 1 + 2 j 2 5 S j 5 , 2 , 1 , 1 ( t ) , j 0 ,

S j 5 , 2 , 1 , 1 ( t ) = j 2 r = 0 j 2 r j 2 r 1 l = 0 2 l + ( 1 ) j + 1 + 2 j 2 5 ( 2 l + ( 1 ) j + 2 + 2 ) + 2 t j 2 r , j 0 .

These polynomials satisfy the following recurrence formula:

Y ¯ j ( t ) = t Y ¯ j 1 ( t ) j ( j + 1 ) + ( 1 ) j ( 2 j + 1 ) + 1 4 j ( j + 1 ) Y ¯ j 2 ( t ) , j 2 , t [ 1 , 1 ] , Y ¯ 0 ( t ) = 1 , Y ¯ 1 ( t ) = t .

The SCPs are orthogonal with respect to the weight function w ¯ ( t ) = t 2 1 t 2 , i.e.,

1 1 Y ¯ i ( t ) Y ¯ j ( t ) w ¯ ( t ) d t = ¯ i δ i j ,

where δ i j is the Kronecker delta function and

¯ i = π 2 2 i + 3 , i even , π ( i + 3 ) 2 2 i + 3 ( i + 1 ) , i odd .

By means of the change in variable t 2 t 1 , the shifted sixth-kind Chebyshev polynomials (SSKCPs) are orthogonal regarding the weight function w ( t ) = ( 2 t 1 ) 2 t t 2 on J = [ 0 , 1 ] , i.e.,

0 1 Y i ( t ) Y j ( t ) w ( t ) d t = i δ i j ,

where

(3.1) i = π 2 2 i + 5 , i even , π ( i + 3 ) 2 2 i + 5 ( i + 1 ) , i odd .

Abd-Elhameed and Youssri [36] presented a series form of the SSKCPs as follows:

(3.2) Y j ( t ) = j r = 0 ς r , j t r ,

where

(3.3) ς r , j = 2 2 r j ( 2 r + 1 ) ! j 2 l = r + 1 2 ( 1 ) j 2 + l + r ( 2 l + r + 1 ) ! ( 2 l r + 1 ) ! , j even , 2 j + 1 j 1 2 l = r 2 ( 1 ) j + 1 2 + l + r ( l + 1 ) ( 2 l + r + 2 ) ! ( 2 l r + 1 ) ! , j odd .

Please refer to [40,41] for more properties and details about SCPs.

A square-integrable function z ( t ) L w 2 ( J ) can be written in terms of the SSKCPs as

(3.4) z ( t ) = j = 0 Z j Y j ( t ) , t J ,

where the coefficients Z j are calculated as

Z j = 1 j 0 1 z ( t ) Y j ( t ) w ( t ) d t , j = 0 , 1 , 2 , .

The first few terms in (3.4) are practically used to determine an approximation to z ( t ) , i.e.,

(3.5) z ( t ) z N ( t ) = N j = 0 Z j Y j ( t ) = Y T ( t ) Z = Z T Y ( t ) ,

where Y ( t ) and Z are the ( N + 1 ) -order vectors as follows:

(3.6) Y ( t ) = [ Y 0 ( t ) Y 1 ( t ) Y N ( t ) ] T , Z = [ Z 0 Z 1 Z N ] T .

3.2 Operational matrices for SSKCPs

To solve the problem (1.1)–(1.3), three types of operational matrices are needed: an integral operational matrix of integer order, a pseudo-operational integral matrix of fractional order, and a dual operational matrix. In order to construct them, some lemmas and theorems must be given.

Lemma 3.1

If ρ > 1 , one has

0 1 t ρ Y k ( t ) w ( t ) d t = k m = 0 ς m , k π 2 4 Γ ( ρ + m + 7 2 ) Γ ( ρ + m + 5 ) 4 Γ ( ρ + m + 5 2 ) Γ ( ρ + m + 4 ) + Γ ( ρ + m + 3 2 ) Γ ( ρ + m + 3 ) .

Proof

See Lemma 4.2 in [43].□

Theorem 3.2

If Y ( t ) is the basis vector in (3.6), then the integral of the vector Y ( t ) can be attained as

0 t Y ( s ) d s P Y ( t ) , t J ,

where P is the ( N + 1 ) × ( N + 1 ) integral operational matrix corresponding to the basis vector with integer powers as follows:

(3.7) P = p 0 0 p 1 0 p N 0 p 0 1 p 1 1 p N 1 p 0 N p 1 N p N N ,

and its entries are computed as

p k j = j r = 0 ς r , j π 2 ( r + 1 ) k k m = 0 ς m , k 4 Γ ( r + m + 9 2 ) Γ ( r + m + 6 ) 4 Γ ( r + m + 7 2 ) Γ ( r + m + 5 ) + Γ ( r + m + 5 2 ) Γ ( r + m + 4 ) , j = 0 , 1 , , N , k = 0 , 1 , , N .

Proof

See Theorem 4.3 in [43].□

Theorem 3.3

Suppose that Y ( t ) is the basis vector in (3.6) and t θ ( t ) 0 R L , θ ( t ) ( 0 , 1 ] , is the Riemann-Liouville fractional integral of the order θ ( t ) . Then, one has

t θ ( t ) 0 R L Y ( t ) P ( θ ) Y ( t ) ,

where P ( θ ) is the ( N + 1 ) × ( N + 1 ) fractional operational matrix as follows:

P ( θ ) = p ( θ ) ( 0 , 0 ) p ( θ ) ( 0 , 1 ) p ( θ ) ( 0 , N ) p ( θ ) ( 1 , 0 ) p ( θ ) ( 1 , 1 ) p ( θ ) ( 1 , N ) p ( θ ) ( N , 0 ) p ( θ ) ( N , 1 ) p ( θ ) ( N , N ) ,

where p ( θ ) ( i , k ) are calculated as

p ( θ ) ( i , k ) = i r = 0 ς r , i π Γ ( r + 1 ) t θ ( t ) 2 Γ ( r + θ ( t ) + 1 ) k k m = 0 ς m , k 4 Γ ( r + m + 7 2 ) Γ ( r + m + 5 ) 4 Γ ( r + m + 5 2 ) Γ ( r + m + 4 ) + Γ ( r + m + 3 2 ) Γ ( r + m + 3 ) , i = 0 , 1 , , N , k = 0 , 1 , , N .

Proof

See Theorem 4.4 in [43].□

Lemma 3.4

Suppose that Y j ( t ) and Y k ( t ) are the jth and kth SSKCPs, respectively. The product of Y j ( t ) and Y k ( t ) is written as the series form

Q j + k ( t ) = Y j ( t ) Y k ( t ) = j + k r = 0 q r ( j , k ) t r , j , k = 0 , 1 , , N ,

where the coefficients q r ( j , k ) , j , k = 0 , 1 , , N , are computed as

If j k :

r = 0 , 1 , , j + k ,

if r > j , then

q r ( j , k ) = l = r j k ς r l , j ς l , k ,

else

r 1 = min { r , k } ,

q r ( j , k ) = l = 0 r 1 ς r l , j ς l , k ,

end.

If j < k :

r = 0 , 1 , , j + k ,

if r j , then

r 1 = min { r , j } ,

q r ( j , k ) = l = 0 r 1 ς r l , j ς l , k ,

else

r 2 = min { r , k } ,

q r ( j , k ) = l = r j r 2 ς r l , j ς l , k ,

end.

Proof

See Lemma 3 in [44].□

Theorem 3.5

If Y ( t ) is the basis vector in (3.6), then the integration of the product of the vectors Y ( t ) and Y T ( t ) over [ 0 , 1 ] is given as the following matrix form:

(3.8) 0 1 Y ( t ) Y T ( t ) d t = D Y ( t ) ,

where D is the ( N + 1 ) × ( N + 1 ) dual operational matrix and its members are as follows:

d j , k = j + k r = 0 q r ( j , k ) r + 1 , j , k = 0 , 1 , , N .

Proof

From the left-hand side of equation (3.8), one has

0 1 Y ( t ) Y T ( t ) d t = 0 1 Y j ( t ) Y k ( t ) d t j , k , j , k = 0 , 1 , , N .

By utilizing Lemma 3.4, the integration of the product of Y j ( t ) and Y k ( t ) can be computed as

0 1 Y j ( t ) Y k ( t ) d t = j + k r = 0 q r ( j , k ) 0 1 t r d t = j + k r = 0 q r ( j , k ) r + 1 , j = 0 , 1 , , N , k = j = 0 , 1 , , N .

Thus, the desired result is obtained.□

Interested readers can refer to [45] to understand the matrix algebra done within the work.

4 Methodology

In this section, the derived matrices in Section 3 are employed to numerically solve problems (1.1)–(1.3). For this end, pursuing the following steps is proposed:

Step 1. The control variable is expanded as

(4.1) u ( t ) N k = 0 U k Y k ( t ) = Y T ( t ) U , s.t. U = [ U 0 U 1 U N ] T .

Step 2-1. If both functions x ˙ ( t ) and D t θ ( t ) 0 C x ( t ) , 0 < θ ( t ) < 1 , exist in the dynamical system, then

(4.2) x ˙ ( t ) N k = 0 X k Y k ( t ) = Y T ( t ) X , s.t. X = [ X 0 X 1 X N ] T .

Now, integrating approximate (4.2) and using Theorem 3.2 lead to an approximation to the state variable:

(4.3) x ( t ) Y T ( t ) P T X + x ( 0 ) Y T ( t ) P T X + Y T ( t ) F Y T ( t ) V 1 , s.t. V 1 = P T X + F .

Step 2-2. An approximation is obtained to D t θ ( t ) 0 C x ( t ) , 0 < θ ( t ) < 1 , by means of approximation (4.2):

(4.4) D t θ ( t ) 0 C x ( t ) = t 1 θ ( t ) 0 R L x ˙ ( t ) Y T ( t ) X .

By applying the operator t 1 θ ( t ) 0 R L on (4.4) and using Theorem 3.3, one obtains the following approximation:

(4.5) D t θ ( t ) 0 C x ( t ) Y T ( t ) P ( 1 θ ) T X = Y T ( t ) V 2 , s.t. V 2 = P ( 1 θ ) T X .

Step 2-3. If the function x ˙ ( t ) does not exist in dynamical system (1.2), then

(4.6) D t θ ( t ) 0 C x ( t ) Y T ( t ) X .

Applying the operator t θ ( t ) 0 R L on (4.6) leads to an approximation to the state variable:

(4.7) x ( t ) Y T ( t ) P ( θ ) T X + x ( 0 ) = Y T ( t ) P ( θ ) T X + Y T ( t ) F = Y T ( t ) V 1 , s.t. V 1 = P ( θ ) T X + F .

Step 3. Substituting approximations (4.1)–(4.7) into dynamical system (1.2), one obtains

(4.8) ( t , θ ( t ) ) = Y T ( t ) P ( 1 θ ) T X G ( t , Y T ( t ) V 1 , Y T ( t ) X , Y T ( t ) U ) .

Step 4. If t i , i = 0 , 1 , , N , are roots of Y N + 1 ( t ) , then collocating ( t , θ ( t ) ) in (4.8) leads to the following algebraic system:

(4.9) ( t i , θ ( t i ) ) = Y T ( t i ) P ( 1 θ i ) T X G ( t i , Y T ( t i ) V 1 , Y T ( t i ) X , Y T ( t i ) U ) , i = 0 , 1 , , N .

Step 5. The boundary condition x ( 1 ) = η 1 can be approximated by (4.3) or (4.7) as follows:

(4.10) 1 = Y T ( 1 ) V 1 η 1 .

Step 6. Substituting approximations (4.1), (4.3), or (4.7) into performance index (1.1) leads to the following expression:

(4.11) J [ x , u ] J N = 0 1 ( t , Y T ( t ) V 1 , Y T ( t ) U ) d t .

Step 7. The following optimization problem is constructed by means of (4.9), (4.10), and (4.11).

(4.12) J N * = J N + Λ T M + λ N + 1 1 ,

where Λ , M are ( N + 1 ) -order vectors as

Λ = [ λ 0 λ 1 λ N ] , M i = [ ( t i , θ ( t i ) ) ] , i = 0 , 1 , , N ,

and λ i , 0 i N + 1 , are unknown Lagrange multipliers.

Step 8. The necessary conditions for obtaining the extremum of the problem are

(4.13) J N * X = 0 , J N * U = 0 , J N * Λ = 0 , J N * λ N + 1 = 0 .

Step 9. Solving algebraic system (4.13) involving 3 N + 4 equations leads to determine the vectors X , U , Λ , and the coefficient λ N + 1 . Thus, approximate optimal solutions for the given problem are obtained.

5 Error bounds

In the current section, some upper bounds for errors of approximate solutions and the residual function of the performance index are obtained in a Sobolev space.

Definition 5.1

Suppose that Y j ( t ) is the SSKCP of at most degree N and P N = span { Y 0 ( t ) , Y 1 ( t ) , , Y N ( t ) } . If v ( t ) C ( J ) , then there exists v ¯ ( t ) P N such that

v ( t ) v ¯ ( t ) = inf y P N v ( t ) y ( t ) ,

where v ¯ ( t ) is the best approximation to v ( t ) from P N .

Definition 5.2

The Chebyshev-weighted Sobolev space Cℋ w ϖ ( J ) , ϖ Z + { 0 } is defined as

Cℋ w ϖ ( J ) = v ( t ) d k v ( t ) d t k L w 2 ( J ) , 0 k ϖ ,

where L w 2 ( J ) is the weighted space of squared-integrable functions on the interval J and equipped to the following norm and semi-norm

(5.1) v Cℋ w ϖ ( J ) = ϖ k = 0 d k v d t k L w 2 ( J ) 2 1 2 , v Cℋ w ϖ , N ( J ) = ϖ k = min { ϖ , N + 1 } d k v d t k L w 2 ( J ) 2 1 2 ,

where · L w 2 ( J ) is the L w 2 -norm defined as

f L w 2 ( J ) = 0 1 f ( t ) 2 w ( t ) d t 1 2 .

Theorem 5.1

Suppose that v ( t ) Cℋ w ϖ ( J ) , ϖ Z + { 0 } , and v ¯ N ( t ) = j = 0 N V ¯ j Y j ( t ) is the best approximation to v ( t ) from P N . Then, one obtains [46]:

(5.2) v v ¯ N L w 2 ( J ) β N ϖ v Cℋ w ϖ , N ( J )

and

(5.3) d m v d t m d m v ¯ N d t m Cℋ w m ( J ) β N ρ ( m ) ϖ v Cℋ w m , ϖ , N ( J ) , 0 m ϖ ,

where

ρ ( m ) = 2 m 1 2 , m > 0 , 0 , m = 0 , v Cℋ w m , ϖ , N ( J ) = ϖ k = min { ϖ , N + 1 } N 2 m 2 k d k v d t k L w 2 ( J ) 2 1 2

and β depends on ϖ .

Theorem 5.2

Suppose that v N * ( t ) = j = 0 N V j * Y j ( t ) = Y T ( t ) V * and v ¯ N ( t ) = j = 0 N V ¯ j Y j ( t ) = Y T ( t ) V ¯ are the approximate solutions obtained from the presented method and the best approximation to v ( t ) from P N , respectively. Then, one obtains

v v N * L w 2 ( J ) β N ϖ v Cℋ w ϖ , N ( J ) + V ¯ V * 2 N j = 0 j 1 2 ,

where j , j = 0 , 1 , , N , are defined in (3.1).

Proof

The following inequality is obtained from the properties of the norm

(5.4) v v N * L w 2 ( J ) v v ¯ N L w 2 ( J ) + v ¯ N v N * L w 2 ( J ) .

The second norm in the right-hand side of (5.4) is as follows:

v ¯ v N * L w 2 ( J ) = Y T ( t ) V ¯ Y T ( t ) V * L w 2 ( J ) = N j = 0 V ¯ j Y j ( t ) N j = 0 V j * Y j ( t ) L w 2 ( J ) = N j = 0 ( V ¯ j V j * ) Y j ( t ) L w 2 ( J ) = 0 1 N j = 0 ( V ¯ j V j * ) Y j ( t ) 2 w ( t ) d t 1 2 N j = 0 V ¯ j V j * 2 1 2 0 1 N j = 0 Y j ( t ) 2 w ( t ) d t 1 2 = V ¯ V * 2 0 1 N j = 0 Y j ( t ) 2 w ( t ) d t 1 2 = V ¯ V * 2 N j = 0 j 1 2 .

It can be easily seen from relation (3.1), j , 0 j N , are decreasing when j (or N ) is sufficiently large. Using Theorem 5.1 and the recent result, inequality (5.4) is written as

v v N * L w 2 ( J ) β N ϖ v Cℋ w ϖ , N ( J ) + V ¯ V * 2 N j = 0 j 1 2 .

Theorem 5.3

Assume that v ( t ) Cℋ w m ( J ) , ϖ Z + { 0 } , v N * ( t ) is the approximate solution of the proposed method, v ¯ N ( t ) is the best approximation to v ( t ) from P N , 0 C D t θ ( t ) v N * ( t ) Y T ( t ) W * , 0 C D t θ ( t ) v ¯ N ( t ) Y T ( t ) W ¯ , and 0 < θ ( t ) 1 . Then, one obtains

D t θ ( t ) 0 C v D t θ ( t ) 0 C v N * L w 2 ( J ) β β 1 N ρ ( m ) ϖ v Cℋ w ϖ , N ( J ) + W ¯ W * 2 N j = 0 j 1 2 .

Proof

Based on Definition 2.2, one has

(5.5) D t θ ( t ) 0 C v D t θ ( t ) 0 C v ¯ N L w 2 ( J ) = 1 Γ ( 1 θ ( t ) ) 0 t ( t s ) θ ( t ) v ( s ) d s 1 Γ ( 1 θ ( t ) ) 0 t ( t s ) θ ( t ) v ¯ N ( s ) d s L w 2 ( J ) = 1 Γ ( 1 θ ( t ) ) 0 t ( t s ) θ ( t ) ( v ( s ) v ¯ N ( s ) ) d s L w 2 ( J ) .

Besides, one has for t 0 J

1 Γ ( 1 θ ( t ) ) 0 t ( t s ) θ ( t ) d s = t 1 θ ( t ) Γ ( 2 θ ( t ) ) t 0 θ * Γ ( θ * * ) = β 1 ,

where θ * = sup t J ( 1 θ ( t ) ) , θ * * = inf t J ( 2 θ ( t ) ) . Therefore, by setting m = 1 in (5.3), equation (5.5) is as follows:

D t θ ( t ) 0 C v D t θ ( t ) 0 C v ¯ N L w 2 ( J ) β 1 0 t v ( s ) v ¯ N ( s ) L w 2 ( J ) d s β 1 v ( s ) v ¯ N ( s ) L w 2 ( J ) β 1 v ( s ) v ¯ N ( s ) Cℋ w 1 ( J ) β 1 β N 3 2 ϖ v Cℋ w 1 , ϖ , N ( J ) .

According to the given approximations to D t θ ( t ) 0 C v ¯ N and 0 C D t θ ( t ) v N * and Theorem 5.2, one has

D t θ ( t ) 0 C v ¯ N D t θ ( t ) 0 C v N * L w 2 ( J ) = Y T ( t ) W ¯ Y T ( t ) W * L w 2 ( J ) W ¯ W * 2 N j = 0 j 1 2 .

Thus, the desired result is achieved and the following relation is deduced:

D t θ ( t ) 0 C v D t θ ( t ) 0 C v N * L w 2 ( J ) 0 as N .

Now, suppose that x N * ( t ) and u N * ( t ) are approximate optimal solutions obtained from the present method and the operators and G satisfy the Lipschitz conditions. Therefore, using Theorems 5.2 and 5.3, one obtains

0 1 ( t , x ( t ) , u ( t ) ) d t 0 1 ( t , x N * ( t ) , u N * ( t ) ) d t N ( t ) = 0 ,

where N ( t ) is the residual function. So, taking norm leads to the following inequality:

(5.6) N L w 2 ( J ) = ( t , x , u ) ( t , x N * , u N * ) L w 2 ( J ) s 1 ( x x N * L w 2 ( J ) + u u N * L w 2 ( J ) ) s 1 β N ϖ ( x Cℋ w ϖ , N + u Cℋ w ϖ , N ) + N j = 0 j ( X ¯ X * 2 + U ¯ U * 2 )

and

D t θ ( t ) 0 C x ( t ) D t θ ( t ) 0 C x N * ( t ) G ( t , x ( t ) , x ˙ ( t ) , u ( t ) ) + G ( t , x N * ( t ) , x ˙ N * ( t ) , u N * ( t ) ) + N ( t ) = 0 ,

where N ( t ) is the residual function. Similarly, the following inequality is achieved:

(5.7) N L w 2 ( J ) = D t θ ( t ) 0 C x G ( t , x , x ˙ , u ( t ) ) D t θ ( t ) 0 C x N * + G ( t , x N * , x ˙ N * , u N * ) L w 2 ( J ) D t θ ( t ) 0 C x D t θ ( t ) 0 C x N * L w 2 ( J ) + s 2 ( x x N * L w 2 ( J ) + x ˙ x ˙ N * L w 2 ( J ) + u u N * L w 2 ( J ) ) β β 1 N 3 2 ϖ x Cℋ w 1 , ϖ , N + N j = 0 j W ¯ W * 2 + s 2 β N ϖ ( x Cℋ w ϖ , N + u Cℋ w ϖ , N ) + N j = 0 j ( X ¯ X * 2 + U ¯ U * 2 ) + β N 3 2 ϖ x Cℋ w 1 , ϖ , N .

It can be easily seen that when N , the right-hand sides of inequalities (5.6) and (5.7) tend to zero. It can be seen that when N is large enough W ¯ W * 2 , X ¯ X * 2 , U ¯ U * 2 0 . Thus, the error bounds will be proportional to N ϖ . The obtained bounds show an exponential rate of convergence.

6 Numerical experiments

The efficiency and preciseness of the present approach are exemplified by solving four illustrated examples.

Example 6.1

Consider the following fractional-order optimal control problem [47]:

Min J [ x , u ] = 0 1 ( t u ( t ) ( θ ( t ) + 2 ) x ( t ) ) 2 d t ,

x ˙ ( t ) + D t θ ( t ) 0 C x ( t ) u ( t ) t 2 = 0 , 0 < θ ( t ) 1 ,

with the following boundary conditions:

x ( 0 ) = 0 , x ( 1 ) = 2 Γ ( 3 + θ ( t ) ) .

The exact solutions are ( x ( t ) , u ( t ) , J [ x , u ] ) = ( 2 t θ ( t ) + 2 Γ ( 3 + θ ( t ) ) , 2 t θ ( t ) + 1 Γ ( 2 + θ ( t ) ) , 0 ) . To determine the approximate optimal solutions by the scheme described in Section 4, the following approximations can be considered:

(6.1) x ˙ ( t ) Y T ( t ) X , x ( t ) Y T ( t ) P T X = Y T ( t ) V 1 , V 1 = P T X , D t θ ( t ) 0 C x ( t ) Y T ( t ) P ( 1 θ ) T X , u ( t ) Y T ( t ) U .

Substituting approximations (6.1) into the performance index, the dynamical system, and the boundary conditions, one obtains

J N = 0 1 ( t Y T ( t ) U ( θ ( t ) + 2 ) Y T ( t ) P T X ) 2 d t , ( t , θ ( t ) ) = Y T ( t ) X + Y T ( t ) P ( 1 θ ( t ) ) X Y T ( t ) U t 2 , 1 = Y T ( 1 ) P T X 2 Γ ( 3 + θ ( t ) ) .

Finally, the following optimization problem is achieved:

J N * = J N + Λ T M + λ N + 1 1 .

Based on the procedure stated in Section 4, the unknown vectors and coefficients are determined. The maximum absolute errors related to the approximately optimal solutions are compared to those reported in [19] and [47] in Table 1 for N = 3 and θ ( t ) = 1 . The comparison of the results shows the accuracy of the proposed scheme. Also, the computational time is 2.07 s. The absolute errors of the approximate solutions at the points t i = 0.2 i , i = 0 , 1 , , 5 , are listed in Table 2 for N = 3 , 5 , and θ ( t ) = 0.9 . The values of the functional J [ x , u ] are 8.3946 × 1 0 8 and 1.2254 × 1 0 10 for N = 3 and 5 , respectively. The plots of the exact and approximate solutions and absolute error functions are depicted in Figure 1 for N = 5 and θ ( t ) = 1 . The numerical results confirm the satisfactory agreement of the approximate results with their exact ones.

Table 1

Maximum absolute errors of state and control variables for N = 3 and θ ( t ) = 1 of Example 6.1

Present method Method in [19] Method in [47]
Error of x ( t ) 1.3536 × 1 0 21 3.5526 × 1 0 4 9.3698 × 1 0 15
Error of u ( t ) 4.3136 × 1 0 20 9.1353 × 1 0 3 5.6882 × 1 0 16
J [ x , u ] 1.3433 × 1 0 40 0
Table 2

Absolute errors of numerical results at selected points for N = 3 , 5 and θ ( t ) = 0.9 of Example 6.1

N = 3 N = 5
t i Error of x ( t ) Error of u ( t ) J [ x ( t ) , u ( t ) ] Error of x ( t ) Error of u ( t ) J [ x ( t ) , u ( t ) ]
0.0 1.8707 × 1 0 4 4.3125 × 1 0 3 8.3946 × 1 0 8 7.09718 × 1 0 6 5.6699 × 1 0 4 1.2254 × 1 0 10
0.2 1.5189 × 1 0 4 4.6587 × 1 0 4 2.9405 × 1 0 6 3.0923 × 1 0 5
0.4 8.8858 × 1 0 5 3.9267 × 1 0 4 8.0242 × 1 0 6 6.7222 × 1 0 5
0.6 5.2670 × 1 0 5 1.9803 × 1 0 4 7.6123 × 1 0 6 2.6087 × 1 0 5
0.8 1.8546 × 1 0 4 4.2251 × 1 0 4 3.5419 × 1 0 6 2.1047 × 1 0 5
1.0 0 5.0222 × 1 0 4 1.0000 × 1 0 20 2.0350 × 1 0 5
Figure 1 
               (a) Exact and approximate solutions and (b) absolute error functions of Example 6.1 for 
                     
                        
                        
                           N
                           =
                           5
                        
                        N=5
                     
                   and 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                           =
                           1
                        
                        \theta \left(t)=1
                     
                  .
Figure 1

(a) Exact and approximate solutions and (b) absolute error functions of Example 6.1 for N = 5 and θ ( t ) = 1 .

Example 6.2

Consider the following VOCP [42]

Min J [ x , u ] = 0 1 ( u ( t ) x ( t ) ) 2 d t ,

x ˙ ( t ) + D t θ ( t ) 0 C x ( t ) u ( t ) + x ( t ) t 3 6 t θ ( t ) + 2 Γ ( θ ( t ) + 3 ) = 0 , 0 < θ ( t ) 1 ,

with

x ( 0 ) = 0 , x ( 1 ) = 6 Γ ( θ ( 1 ) + 4 ) .

The exact solutions are ( x ( t ) , u ( t ) , J [ x , u ] ) = ( 6 t θ ( t ) + 3 Γ ( θ ( t ) + 4 ) , 6 t θ ( t ) + 3 Γ ( θ ( t ) + 4 ) , 0 ) . The values of the absolute errors of x ( t ) and u ( t ) at the equally spaced points t i = 0.1 i , i = 0 , 1 , , 10 , are listed in Table 3 for N = 5 and θ ( t ) = 0.45 , 0.47 , 0.49 . The optimal values of the functional J [ x , u ] are listed in Table 4 for N = 5 and θ ( t ) = 0.7 , 0.8 , 0.9 , 1 , and compared to the values reported in [19] and [42]. It can be seen that the accuracy of the approximate solutions increases when θ ( t ) 1 . The computational time for this algorithm is 1.17 s. By choosing functions θ i ( t ) , i = 1 , 2 , 3 , 4 , as

θ 1 ( t ) = 0.8 + 0.05 sin ( t ) , θ 2 ( t ) = 0.8 + 0.005 sin ( t ) , θ 3 ( t ) = 0.8 + 0.0005 sin ( t ) , θ 4 ( t ) = 0.8 ,

the values of the performance index are listed in Table 5 for N = 7 and the values are compared to results in [19]. Values of absolute errors at equally spaced points t i = 0.2 i , i = 0 , 1 , , 5 are listed in Table 6. The running time is 4.71 s. The plots of the error functions of x ( t ) and u ( t ) are depicted in Figure 2 for N = 5 and θ ( t ) = 0.7 . The figures of the approximate optimal solutions are shown in Figure 3 for θ ( t ) = 0.8 + 0.005 sin ( t ) and N = 7 .

Table 3

Absolute errors of approximate optimal solutions for N = 5 and different values of θ ( t ) of Example 6.2

θ ( t ) = 0.45 θ ( t ) = 0.47 θ ( t ) = 0.49
t i x N ( t ) u N ( t ) x N ( t ) u N ( t ) x N ( t ) u N ( t )
0 3.1265 × 1 0 5 1.1897 × 1 0 4 3.0469 × 1 0 5 1.1745 × 1 0 4 2.9581 × 1 0 5 1.1544 × 1 0 4
0.2 3.5212 × 1 0 6 6.0441 × 1 0 5 3.4425 × 1 0 6 5.9910 × 1 0 5 3.3576 × 1 0 6 5.9204 × 1 0 5
0.4 4.0384 × 1 0 5 1.4253 × 1 0 4 3.9372 × 1 0 5 1.3977 × 1 0 4 3.8250 × 1 0 5 1.3658 × 1 0 4
0.6 1.9546 × 1 0 5 8.8103 × 1 0 5 1.9320 × 1 0 5 8.6704 × 1 0 5 1.9028 × 1 0 5 8.5049 × 1 0 5
0.8 5.7962 × 1 0 6 1.1813 × 1 0 4 5.8273 × 1 0 6 1.1542 × 1 0 5 5.8329 × 1 0 6 1.1236 × 1 0 4
1 2.0000 × 1 0 20 7.9133 × 1 0 5 2.0000 × 1 0 20 7.7584 × 1 0 5 2.0000 × 1 0 20 7.5740 × 1 0 5
J [ x N , u N ] 8.7213 × 1 0 9 8.3862 × 1 0 9 8.0067 × 1 0 9
Table 4

Values of functional J [ x , u ] for N = 5 and θ ( t ) = 0.7 , 0.8 , 0.9 , 1 of Example 6.2

θ ( t ) = 0.7 θ ( t ) = 0.8 θ ( t ) = 0.9 θ ( t ) = 1
Present method 3.0974 × 1 0 9 1.2969 × 1 0 9 2.8560 × 1 0 10 9.1863 × 1 0 41
Method in [19] 1.5115 × 1 0 8 7.0650 × 1 0 9 1.7599 × 1 0 9 0
Method in [42] 1.649 × 1 0 8 4.264 × 1 0 9 3.023 × 1 0 33
Table 5

Values of functional J [ x , u ] for N = 7 and different values of θ ( t ) of Example 6.2

θ ( t ) = 0.8 + 0.05 sin ( t ) θ ( t ) = 0.8 + 0.005 sin ( t ) θ ( t ) = 0.8 + 0.0005 sin ( t ) θ ( t ) = 0.8
Present method 4.3839 × 1 0 5 4.6827 × 1 0 7 4.7798 × 1 0 9 1.2969 × 1 0 9
Method in [19] 1.5854 × 1 0 7 4.8728 × 1 0 8 4.0839 × 1 0 8 7.0650 × 1 0 9
Table 6

Absolute errors of approximate optimal solutions for N = 5 and different values of θ ( t ) of Example 6.2

θ ( t ) = 0.8 + 0.05 sin ( t ) θ ( t ) = 0.8 + 0.005 sin ( t ) θ ( t ) = 0.8 + 0.0005 sin ( t )
t i x N ( t ) u N ( t ) x N ( t ) u N ( t ) x N ( t ) u N ( t )
0 5.9048 × 1 0 5 8.5540 × 1 0 3 7.4315 × 1 0 6 8.9703 × 1 0 4 1.4460 × 1 0 6 9.1429 × 1 0 5
0.2 7.265 × 1 0 4 7.8584 × 1 0 3 7.3547 × 1 0 5 8.0564 × 1 0 4 7.2622 × 1 0 6 8.1172 × 1 0 5
0.4 1.3218 × 1 0 3 6.8141 × 1 0 3 1.3489 × 1 0 4 6.8654 × 1 0 4 1.3864 × 1 0 5 6.9438 × 1 0 5
0.6 1.5487 × 1 0 3 8.9384 × 1 0 3 1.5707 × 1 0 4 9.2494 × 1 0 4 1.5120 × 1 0 5 9.2738 × 1 0 5
0.8 1.1184 × 1 0 3 7.0338 × 1 0 3 1.1199 × 1 0 4 7.2347 × 1 0 4 1.0504 × 1 0 5 7.2285 × 1 0 5
1 2.0000 × 1 0 20 5.6181 × 1 0 3 2.0000 × 1 0 20 6.0555 × 1 0 4 0.0000 6.1417 × 1 0 5
J [ x N , u N ] 4.3839 × 1 0 5 4.6827 × 1 0 7 4.7798 × 1 0 9
Figure 2 
               Plots of error functions for (a) 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           5
                        
                        N=5
                     
                   and 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                           =
                           0.7
                        
                        \theta \left(t)=0.7
                     
                   of Example 6.2.
Figure 2

Plots of error functions for (a) x ( t ) , (b) u ( t ) for N = 5 and θ ( t ) = 0.7 of Example 6.2.

Figure 3 
               Plots of (a) approximate solutions for 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) approximate solutions for 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                  , (c) absolute error function of 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (d) absolute error function of 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           7
                        
                        N=7
                     
                   and 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                           =
                           0.8
                           +
                           0.005
                           sin
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        \theta \left(t)=0.8+0.005\sin \left(t)
                     
                   of Example 6.2.
Figure 3

Plots of (a) approximate solutions for x ( t ) , (b) approximate solutions for u ( t ) , (c) absolute error function of x ( t ) , (d) absolute error function of u ( t ) for N = 7 and θ ( t ) = 0.8 + 0.005 sin ( t ) of Example 6.2.

Example 6.3

The following VOCP is considered [19,48]:

Min J [ x , u ] = 1 2 0 1 ( x 2 ( t ) + u 2 ( t ) ) d t , D t θ ( t ) 0 C x ( t ) + x ( t ) u ( t ) = 0 , 0 < θ ( t ) 1 ,

with the initial condition

x ( 0 ) = 1 .

If θ ( t ) = 1 , the exact solutions are

x ( t ) = cosh ( 2 t ) + β sinh ( 2 t ) , u ( t ) = ( 1 + 2 β ) cosh ( 2 t ) + ( 2 + β ) sinh ( 2 t ) ,

where

β = cosh ( 2 ) + 2 sinh ( 2 ) 2 cosh ( 2 ) + sinh ( 2 ) ,

and J [ x , u ] = 0.1929092980931693 . The values of the absolute errors of the approximate solutions are listed in Table 7 at the points t i = 0.2 i , i = 0 , 1 , , 5 , N = 10 , and θ ( t ) = 1 and compared to results in [19] and [48]. The maximum absolute errors of x ( t ) and u ( t ) and the approximate values of J [ x , u ] are observed in Table 8 for various values of θ ( t ) and N = 10 and the results are compared to results in [19]. The plots of the approximate solutions are seen in Figure 4 for N = 10 and θ ( t ) = 0.6 , 0.7 , 0.8 , 0.9 , 1 . The plots of approximate solutions for N = 8 and θ 1 ( t ) = 1 0.1 t , θ 2 ( t ) = 1 0.3 t , and θ 3 ( t ) = 1 0.5 t are shown in Figure 5.

Table 7

Absolute errors of optimal approximate solutions for N = 10 and θ ( t ) = 1 of Example 6.3

Present method Method in [48] Method in [19]
t i x N ( t ) u N ( t ) x N ( t ) u N ( t ) x N ( t ) u N ( t )
0 0 3.0459 × 1 0 4 8.29 × 1 0 17 8.61 × 1 0 6
0.2 1.3391 × 1 0 6 7.2656 × 1 0 5 5.60 × 1 0 5 2.92 × 1 0 5 1.48 × 1 0 7 1.39 × 1 0 6
0.4 3.0578 × 1 0 6 4.0056 × 1 0 5 2.75 × 1 0 5 5.10 × 1 0 6 1.85 × 1 0 7 6.00 × 1 0 7
0.6 2.9100 × 1 0 6 3.6618 × 1 0 5 1.16 × 1 0 5 1.87 × 1 0 5 1.86 × 1 0 7 6.93 × 1 0 7
0.8 1.3890 × 1 0 6 7.1999 × 1 0 5 4.65 × 1 0 6 3.96 × 1 0 5 1.47 × 1 0 7 1.37 × 1 0 6
1 7.8391 × 1 0 9 2.9045 × 1 0 5 1.62 × 1 0 6 2.27 × 1 0 3 2.71 × 1 0 12 7.65 × 1 0 6
J [ x , u ] 0.19290929598 0.19290929809
Table 8

Maximum absolute errors of x ( t ) and u ( t ) and estimated values of J [ x , u ] for N = 8 , and various values of θ ( t ) of Example 6.3

Present method θ ( t ) = 1 0.05 t θ ( t ) = 1 0.03 t θ ( t ) = 1 0.01 t
Error of x ( t ) 4.6499 × 1 0 3 2.8138 × 1 0 3 9.9235 × 1 0 4
Error of u ( t ) 5.7571 × 1 0 3 3.5361 × 1 0 3 1.8784 × 1 0 3
J [ x , u ] 0.19395417611 0.19353733279 0.19311893574
Method in [19] θ ( t ) = 1 0.05 t θ ( t ) = 1 0.03 t θ ( t ) = 1 0.01 t
Error of x ( t ) 1.13 × 1 0 2 6.80 × 1 0 3 2.27 × 1 0 3
Error of u ( t ) 6.30 × 1 0 3 3.71 × 1 0 3 1.21 × 1 0 3
J [ x , u ] 0.1933774618 0.19319043961 0.19300305529
Figure 4 
               Plots of approximate solutions of (a) 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           10
                        
                        N=10
                     
                  , and various values of 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        \theta \left(t)
                     
                   of Example 6.3.
Figure 4

Plots of approximate solutions of (a) x ( t ) , (b) u ( t ) for N = 10 , and various values of θ ( t ) of Example 6.3.

Figure 5 
               Plots of approximate solutions of (a) 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           8
                        
                        N=8
                     
                  , and various values of 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        \theta \left(t)
                     
                   of Example 6.3.
Figure 5

Plots of approximate solutions of (a) x ( t ) , (b) u ( t ) for N = 8 , and various values of θ ( t ) of Example 6.3.

Example 6.4

Consider the following VOCP [19,24]:

Min J [ x , u ] = 0 1 ( x ( t ) t 2 ) 2 + ( u ( t ) t e t + 1 2 e t 2 t ) 2 d t , D t θ ( t ) 0 C x ( t ) e x ( t ) 2 e t u ( t ) = 0 , 0 < θ ( t ) 1 ,

with the initial condition

x ( 0 ) = 0 .

If θ ( t ) = 1 , then the exact solutions are ( x ( t ) , u ( t ) , J [ x , u ] ) = ( t 2 , t e t 1 2 e t 2 t , 0 ) . The approximate values of J [ x , u ] are listed in Table 9 for N = 6 and different values of θ ( t ) and compared to the results reported in [19]. Also, the obtained approximate values of functional J [ x , u ] are listed in Table 10 for N = 6 and θ ( t ) = 0.85 , 0.9 , 0.95 , 1 . The approximate values of x ( t ) and u ( t ) at the points t i , 0 i 5 , and the estimated values of J [ x , u ] are computed and observed in Table 11 for N = 4 , 6 and θ = 1 . As shown, by increasing the value of N , the accuracy of the scheme increases as well. The figures of the approximate solutions are plotted in Figure 6 for N = 6 and θ ( t ) = 0.85 , 0.9 , 0.95 , 1 . Figure 7 displays exact and approximate solutions for N = 10 and θ ( t ) = 0.75 + 0.2 sin ( 10 t ) , θ ( t ) = 0.75 + 0.2 sin ( 30 t ) , θ ( t ) = 0.75 + 0.2 sin ( 50 t ) . The convergence rate is computed by the following formula:

C R z = ln ( E 2 i E 2 i 2 ) ln ( 2 i 2 i 2 ) ,

where E j is computed by the absolute error calculated for series solution including j + 1 basis functions and z = x ( t ) or u ( t ) . Convergence rates of obtained solutions are listed in Table 12 for θ ( t ) = 1 and diverse values of N .

Table 9

Estimated values of J [ x , u ] for N = 6 , and various values of θ ( t ) of Example 6.4

θ ( t ) = 0.75 + 0.2 sin ( 50 t ) θ ( t ) = 0.75 + 0.2 sin ( 30 t ) θ ( t ) = 0.75 + 0.2 sin ( 10 t ) θ ( t ) = 1
Present method 1.1661 × 1 0 2 9.1085 × 1 0 3 7.1967 × 1 0 3 1.2905 × 1 0 13
Method in [19] 3.7253 × 1 0 3 1.2466 × 1 0 3 5.7619 × 1 0 3 4.2655 × 1 0 9
Table 10

Estimated values of J [ x , u ] for N = 6 and different values of θ ( t ) of Example 6.4

θ ( t ) = 0.85 θ ( t ) = 0.9 θ ( t ) = 0.95 θ ( t ) = 1
J [ x , u ] 1.4602 × 1 0 3 6.6526 × 1 0 4 1.7033 × 1 0 4 1.2905 × 1 0 13
Table 11

Errors of optimal approximate solutions at selected points and estimated values of J [ x , u ] for N = 4 , 6 and θ ( t ) = 1 of Example 6.4

N = 4 N = 6
t i x N ( t ) u N ( t ) x N ( t ) u N ( t )
0 0 1.9608 × 1 0 4 0 1.6891 × 1 0 6
0.2 7.0998 × 1 0 7 1.4569 × 1 0 5 4.6029 × 1 0 8 3.4978 × 1 0 7
0.4 4.0818 × 1 0 6 3.5354 × 1 0 5 6.9652 × 1 0 8 1.9184 × 1 0 7
0.6 1.4641 × 1 0 5 2.8243 × 1 0 5 1.0007 × 1 0 7 3.2709 × 1 0 8
0.8 3.2017 × 1 0 6 2.5048 × 1 0 5 3.7045 × 1 0 8 2.1652 × 1 0 7
1 3.9543 × 1 0 6 4.7536 × 1 0 7 7.0014 × 1 0 8 1.2514 × 1 0 6
J [ x , u ] 1.4754 × 1 0 9 1.2905 × 1 0 13
Table 12

Convergence rate of obtained solutions for θ ( t ) = 1 and various values of N for Example 6.4

N x N ( t ) C R x u N ( t ) C R u
2 9.5990 × 1 0 4 1.7353 × 1 0 2
3 8.3673 × 1 0 4 5.9933 × 1 0 3
4 1.4743 × 1 0 5 6.0248 1.9609 × 1 0 4 6.4675
5 1.2929 × 1 0 5 8.5517 × 1 0 5
6 1.0014 × 1 0 7 12.4675 1.6891 × 1 0 6 11.7257
7 1.2140 × 1 0 8 1.8502 × 1 0 7
8 1.2027 × 1 0 9 15.3711 2.1180 × 1 0 8 15.2213
Figure 6 
               Plots of approximate solutions of (a) 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           6
                        
                        N=6
                     
                  , and various values of 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        \theta \left(t)
                     
                   of Example 6.4.
Figure 6

Plots of approximate solutions of (a) x ( t ) , (b) u ( t ) for N = 6 , and various values of θ ( t ) of Example 6.4.

Figure 7 
               Plots of approximate solutions of (a) 
                     
                        
                        
                           x
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{x}}\left(t)
                     
                  , (b) 
                     
                        
                        
                           u
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {\rm{u}}\left(t)
                     
                   for 
                     
                        
                        
                           N
                           =
                           10
                        
                        N=10
                     
                  , and various values of 
                     
                        
                        
                           θ
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        \theta \left(t)
                     
                   of Example 6.4.
Figure 7

Plots of approximate solutions of (a) x ( t ) , (b) u ( t ) for N = 10 , and various values of θ ( t ) of Example 6.4.

7 Conclusion

The present paper introduced an operational collocation approach established upon the SCPs to deal with a category of optimal control problems involving a VODS. As a result, the objective function is replaced by an algebraic equation, and the VODS is replaced by a system of algebraic equations. By using the Lagrange multipliers method, the constrained equations derived from joining the objective function to the VODS are optimized. Using a Chebyshev-weighted Sobolev space, convergence bounds showed that the method error will be small enough when N is large enough. The obtained results were compared to the exact solutions and the results reported by the other authors. Tables and figures clearly demonstrate that the proposed method can be utilized as a reliable and efficient tool for solving variable-order functional equations.



Acknowledgement

Authors are very grateful to anonymous referees for their careful reading and valuable comments which led to the improvement of this study.

  1. Funding information: Not applicable.

  2. Author contributions: Data curation, formal analysis, investigation, methodology, software, and writing – original draft: Khadijeh Sadri; data curation, resources, validation, and writing – review and editing: Kamyar Hosseini; resources, supervision, visualization, and writing – review and editing: Soheil Salahshour, Dumitru Baleanu, Ali Ahmadian, and Choonkil Park; and funding acquisition: Choonkil Park. Authors declare that the study was carried out collaboratively with a division of responsibilities. All authors read and approved the final manuscript.

  3. Conflict of interest: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this article.

  4. Ethical approval: The conducted research is not related to either human or animal use.

  5. Data availability statement: Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

Appendix

An upper bound can be presented to estimate the error of the operational matrix in Theorem 3.2.

Consider the following error vector:

( t ) = 0 t Y ( s ) d s P Y ( t ) = [ E 0 ( t ) , E 1 ( t ) , , E N ( t ) ] T ,

where

E j ( t ) = 0 t Y j ( s ) d s P j Y ( t ) , j = 0 , 1 , , N ,

and P j is the j th row of the operational matrix P . Let g j ( t ) = 0 t Y j ( s ) d s . According to the definition of the semi-norm in the space Cℋ w ϖ ( J ) , one obtains

g j ( t ) Cℋ w ϖ , N ( J ) 2 = k = min { ϖ , N + 1 } ϖ d k d t k 0 t Y j ( s ) d s L w 2 ( J ) 2 = k = min { ϖ , N + 1 } ϖ r = k 1 j ς r , j Γ ( r + 1 ) t r k + 1 Γ ( r k + 2 ) L w 2 ( J ) 2 = k = min { ϖ , N + 1 } ϖ r = k 1 j s = k 1 j ς r , j ς s , j Γ ( r + 1 ) Γ ( s + 1 ) Γ ( r k + 2 ) Γ ( s k + 2 ) × 0 1 4 t r + s 2 k + 9 2 4 t r + s 2 k + 7 2 + t r + s 2 k + 5 2 ( 1 t ) 1 2 d t = k = min { ϖ , N + 1 } ϖ r = k 1 j s = k 1 j ς r , j ς s , j Γ ( r + 1 ) Γ ( s + 1 ) Γ ( 3 2 ) Γ ( r k + 2 ) Γ ( s k + 2 ) 4 Γ ( r + s 2 k + 11 2 ) Γ ( r + s 2 k + 7 ) 4 Γ ( r + s 2 k + 9 2 ) Γ ( r + s 2 k + 6 ) + Γ r + s 2 k + 7 2 Γ ( r + s 2 k + 5 ) = Z j ϖ 2 , j = 0 , 1 , , N .

Now, by utilizing Theorem 5.1, one yields the following error bound:

E j L w 2 ( J ) β N ϖ Z j , j = 0 , 1 , , N .

Similarly, a bound for the error of this approximation can be obtained.

References

[1] L. Beghin and M. Caputo, Commutative properties of the Caputo fractional derivative and its generalizing convolution operator, Commun. Nonlinear Sci. Numer. Simul. 89 (2020), 105338, DOI: https://doi.org/10.1016/j.cnsns.2020.105338. 10.1016/j.cnsns.2020.105338Search in Google Scholar

[2] T. Blaszczyk, K. Bekus, K. Szajek, and W. Sumelko, On numerical approximation of the Riesz-Caputo operator with the fixed/short memory length, J. King Saud Univ. Sci. 33 (2021), no. 1, 101220, DOI: https://doi.org/10.1016/j.jksus.2020.10.017. 10.1016/j.jksus.2020.10.017Search in Google Scholar

[3] M. C. Neel, A. Abdennadher, and J. Solofoniaina, A continuous variant for Grunwald-Letnikov fractional derivatives, Phys. A 387 (2008), no. 12, 2750–2760, DOI: https://doi.org/10.1016/j.physa.2008.01.090. 10.1016/j.physa.2008.01.090Search in Google Scholar

[4] A. Haq and N. Sukavanam, Existence and approximate controllability of Riemann-Liouville fractional integro-differential systems with damping, Chaos Solitons Fractals 139 (2020), 110043, DOI: https://doi.org/10.1016/j.chaos.2020.110043. 10.1016/j.chaos.2020.110043Search in Google Scholar

[5] G. Wang, K. Pei, R. P. Agarwal, L. Zhang, and B. Ahmad, Nonlocal Hadamard fractional boundary value problem with Hadamard integral and discrete boundary conditions on a half-line, J. Comput. Appl. Math. 343 (2018), 230–239, DOI: https://doi.org/10.1016/j.cam.2018.04.062. 10.1016/j.cam.2018.04.062Search in Google Scholar

[6] K. Tao, H. Chen, W. L. Peng, J. Yao, and Y. Wu, A new method on Box dimension of Weyl-Marchaud fractional derivative of Weierstrass function, Chaos Soliton Fractals 142 (2021), 110317, DOI: https://doi.org/10.1016/j.chaos.2020.110317. 10.1016/j.chaos.2020.110317Search in Google Scholar

[7] X. Zheng, H. Wang, and H. Fu, Analysis of a physically-relevant variable-order time-fractional reaction-diffusion model with Mittag-Leffler kernel, Appl. Math. Lett. 112 (2021), 106804, DOI: https://doi.org/10.1016/j.aml.2020.106804. 10.1016/j.aml.2020.106804Search in Google Scholar

[8] H. Tajadodi, Efficient technique for solving variable order fractional optimal control problems, Alex. Eng. J. 59 (2020), no. 6, DOI: https://doi.org/10.1016/j.aej.2020.09.047. 10.1016/j.aej.2020.09.047Search in Google Scholar

[9] L. Wei and Y. Yang, Optimal order finite difference/local discontinuous Galerkin method for variable-order time-fractional diffusion equation, J. Comput. Appl. Math. 383 (2021), 113129, DOI: https://doi.org/10.1016/j.cam.2020.113129. 10.1016/j.cam.2020.113129Search in Google Scholar

[10] Z. Yang, X. Zheng, Z. Zheng, and H. Wang, Strong convergence of an Euler-Maruyama scheme to a variable-order fractional stochastic differential equation driven by a multiplicative white noise, Chaos Solitons Fractals 142 (2021), 110392, DOI: https://doi.org/10.1016/j.chaos.2020.110392. 10.1016/j.chaos.2020.110392Search in Google Scholar

[11] N. H. Sweilam, S. M. Al-Mekhlafi, Z. N. Mohammed, and D. Baleanu, Optimal control for variable order fractional HIV/AIDS and Malaria mathematical models with multi-time delay, Alex. Eng. J. 59 (2020), no. 5, 3149–3162, DOI: https://doi.org/10.1016/j.aej.2020.07.021. 10.1016/j.aej.2020.07.021Search in Google Scholar

[12] F. Wu, R. Gao, and C. Li, New fractional variable-order creep model with short memory, Appl. Math. Comput. 380 (2020), 125278, DOI: https://doi.org/10.1016/j.amc.2020.125278. 10.1016/j.amc.2020.125278Search in Google Scholar

[13] N. Sweilam, S. Al-Mekhlafi, S. Shatta, and D. Baleanu, Numerical study for two type variable-order Burgers’ equations with proportional delay, Appl. Numer. Math. 156 (2020), 364–376, DOI: https://doi.org/10.1016/j.apnum.2020.05.006. 10.1016/j.apnum.2020.05.006Search in Google Scholar

[14] H. Dehestani, Y. Ordokhani, and M. Razzaghi, Application of fractional of Gegenbauer functions in variable-order fractional delay-type equations with non-singular kernel derivatives, Chaos Solitons Fractals 140 (2020), 110111, DOI: https://doi.org/10.1016/j.chaos.2020.110111. 10.1016/j.chaos.2020.110111Search in Google Scholar

[15] X. Li and B. Wu, Reproducing kernel functions-based meshless method for variable order fractional advection-diffusion-reaction equations, Alex. Eng. J. 59 (2020), no. 5, 3181–3186, DOI: https://doi.org/10.1016/j.aej.2020.07.034. 10.1016/j.aej.2020.07.034Search in Google Scholar

[16] M. Kashif, P. Pandey, and H. Jafari, A novel numerical manner for non-linear coupled variable order reaction-diffusion equation, Therm. Sci. 27 (2023), no. 1, 353–363, DOI: https://doi.org/10.2298/TSCI23S1353K. 10.2298/TSCI23S1353KSearch in Google Scholar

[17] R. M. Ganji and H. Jafari, A numerical approach for multi-variable orders differential equations using Jacobi polynomials, Int. J. Appl. Comput. Math. 5 (2019), 34, DOI: https://doi.org/10.1007/s40819-019-0610-6. 10.1007/s40819-019-0610-6Search in Google Scholar

[18] H. Jafari, S. Nemati, and R. M. Ganji, Operational matrices based on the shifted fifth-kind Chebyshev polynomials for solving nonlinear variable order integro-differential equations, Adv. Differential Equations 2021 (2021), 435, DOI: https://doi.org/10.1186/s13662-021-03588-2. 10.1186/s13662-021-03588-2Search in Google Scholar PubMed PubMed Central

[19] H. Dehestani, Y. Ordokhani, and M. Razzaghi, Fractional-order Bessel wavelet functions for solving variable order fractional optimal control problems with estimation error, Internat. J. Systems Sci. 56 (2020), no. 6, 1032–1052, DOI: https://doi.org/10.1080/00207721.2020.1746980. 10.1080/00207721.2020.1746980Search in Google Scholar

[20] M. H. Heydari, M. R. Mahmoudi, Z. Avazzadeh, and D. Baleanu, Chebyshev cardinal functions for a new class of nonlinear optimal control problems with dynamical systems of weakly singular variable-order fractional integral equations, J. Vib. Control 26 (2020), no. 9–10, DOI: https://doi.org/10.1177/1077546319889862. 10.1177/1077546319889862Search in Google Scholar

[21] O. P. Agrawal, A general formulation and solution scheme for fractional optimal control problem, Nonlinear Dyn. 38 (2004), 323–337, DOI: https://doi.org/10.1007/s11071-004-3764-6. 10.1007/s11071-004-3764-6Search in Google Scholar

[22] H. Hassani and Z. Avazzadeh, Transcendental Bernstein series for solving non-linear variable-order fractional optimal control problems, Appl. Math. Comput. 362 (2019), 124563, DOI: https://doi.org/10.1016/j.amc.2019.124563. 10.1016/j.amc.2019.124563Search in Google Scholar

[23] M. H. Heydari, A new direct method based on the Chebyshev cardinal functions for variable-order fractional optimal control problems, J. Franklin Inst. 355 (2018), no. 12, 4970–4995, DOI: https://doi.org/10.1016/j.jfranklin.2018.05.025. 10.1016/j.jfranklin.2018.05.025Search in Google Scholar

[24] M. H. Heydari and Z. Avazzadeh, A new wavelet method for variable-order fractional optimal control problems, Asian J. Control 20 (2018), no. 5, 1804–1817, DOI: https://doi.org/10.1002/asjc.1687. 10.1002/asjc.1687Search in Google Scholar

[25] M. A. Zaky and A Legendre collocation method for distributed-order fractional optimal control problems, Nonlinear Dyn. 91 (2018), 2667–2681, DOI: https://doi.org/10.1007/s11071-017-4038-4. 10.1007/s11071-017-4038-4Search in Google Scholar

[26] M. A. Zaky, A research note on the nonstandard finite difference method for solving variable-order fractional optimal control problems, J. Vib. Control 24 (2018), no. 11, 2109–2111, DOI: https://doi.org/10.1177/1077546318761443. 10.1177/1077546318761443Search in Google Scholar

[27] M. R. A. Sarkan, Numerical solutions of integral and integro-differential equations using Chebyshev polynomials of the third kind, Appl. Math. Comput. 351 (2019), 66–82, DOI: https://doi.org/10.1016/j.amc.2019.01.030. 10.1016/j.amc.2019.01.030Search in Google Scholar

[28] D. S. Mohamed and R. A. Taher, Comparison of Chebyshev and Legendre polynomials methods for solving two dimensional Volterra-Fredholm integral equations, J. Egyptian Math. Soc. 25 (2017), no. 3, 302–307, DOI: https://doi.org/10.1016/j.joems.2017.03.002. 10.1016/j.joems.2017.03.002Search in Google Scholar

[29] H. Singh and C. S. Singh, A reliable method based on second kind Chebyshev polynomial for the fractional model of Bloch equation, Alex. Eng. J. 57 (2018), no. 3, 1425–1432, DOI: https://doi.org/10.1016/j.aej.2017.07.002. 10.1016/j.aej.2017.07.002Search in Google Scholar

[30] N. H. Sweilam, A. M. Nagy, and A. A. El-Sayed, Second kind shifted Chebyshev polynomials for solving space fractional order diffusion equation, Chaos Solitons Fractals 73 (2015), 141–147, DOI: https://doi.org/10.1016/j.chaos.2015.01.010. 10.1016/j.chaos.2015.01.010Search in Google Scholar

[31] N. H. Sweilam, A. M. Nagy, and A. A. El-sayed, On the numerical solution of space fractional order diffusion equation via shifted Chebyshev polynomials of the third kind, J. King Saud Univ. Sci. 28 (2016), no. 1, 41–47, DOI: https://doi.org/10.1016/j.jksus.2015.05.002. 10.1016/j.jksus.2015.05.002Search in Google Scholar

[32] M. Gulsu, Y. Ozturk, and M. Sezer, On the solution of the Abel equation of the second kind by the shifted Chebyshev polynomials, Appl. Math. Comput. 217 (2011), no. 9, 4827–4833, DOI: https://doi.org/10.1016/j.amc.2010.11.044. 10.1016/j.amc.2010.11.044Search in Google Scholar

[33] B. K. Gimire, X. Li, C. S. Chen, and A. R. Lami Chhane, Hybrid Chebyshev polynomials scheme for solving elliptic partial differential equations, J. Comput. Appl. Math. 364 (2020), 112324, DOI: https://doi.org/10.1016/j.cam.2019.06.040. 10.1016/j.cam.2019.06.040Search in Google Scholar

[34] W. M. Abd-Elhameed and Y. H. Youssri, Fifth-kind orthonormal Chebyshev polynomial solutions for fractional differential equations, Comput. Appl. Math. 37 (2018), 2897–2921, DOI: https://doi.org/10.1007/s40314-017-0488-z. 10.1007/s40314-017-0488-zSearch in Google Scholar

[35] R. M. Ganji, H. Jafari, and D. Baleanu, A new approach for solving multi variable orders differential equations with Mittag-Leffler kernel, Chaos Solitons Fractals 130 (2020), 109405, DOI: https://doi.org/10.1016/j.chaos.2019.109405. 10.1016/j.chaos.2019.109405Search in Google Scholar

[36] W. M., Abd-Elhameed and Y. H. Youssri, Sixth-kind Chebyshev spectral approach for solving fractional differential equations, Int. J. Nonlinear Sci. Numer. Simul. 20 (2019), no. 2, 191–203, DOI: https://doi.org/10.1515/ijnsns-2018-0118. 10.1515/ijnsns-2018-0118Search in Google Scholar

[37] M. Masjed-Jamei, Some new classes of orthogonal polynomials and special functions: A symmetric generalization of Sturm-Liouville problems and its consequences, Department of Mathematics, University of Kassel, 2006. 10.1080/10652460701510949Search in Google Scholar

[38] H. Jafari, A. Babaei, S. Banihashemi, and A Novel Approach for Solving an Inverse Reaction-Diffusion-Convection Problem, J. Optim. Theory Appl. 183 (2019), 688–704, DOI: https://doi.org/10.1007/s10957-019-01576-x. 10.1007/s10957-019-01576-xSearch in Google Scholar

[39] A. Babaei, H. Jafari, and S. Banihashemi, Numerical solution of variable order fractional nonlinear quadratic integro-differential equations based on the sixth-kind Chebyshev collocation method, J. Comput. Appl. Math. 377 (2020), 112908, DOI: https://doi.org/10.1016/j.cam.2020.112908. 10.1016/j.cam.2020.112908Search in Google Scholar

[40] A. G. Atta, W. M. Abd-Elhameed, G. M. Moatimid, and Y. H. Youssri A fast Galerkin approach for solving the fractional Rayleigh-Stokes problem via sixth-kind Chebyshev polynomials, Mathematics 20 (2022), no. 11, 1843, DOI: https://doi.org/10.3390/math10111843. 10.3390/math10111843Search in Google Scholar

[41] A. G. Atta, W. M. Abd-Elhameed, G. M. Moatimid, and Y. H. Youssri, Advanced shifted sixth-kind Chebyshev Tau approach for solving linear one-dimensional hyperbolic telegraph type problem, Math. Sci. 17 (2023), 415–429. 10.1007/s40096-022-00460-6Search in Google Scholar

[42] K. Rabiei, Y. Ordokhani, and E. Babolian, Numerical solution of 1D and 2D fractional optimal control of system via Bernoulli polynomials, Int. J. Appl. Comput. Math. 4 (2018), DOI: https://doi.org/10.1007/s40819-017-0435-0. 10.1007/s40819-017-0435-0Search in Google Scholar

[43] K. Sadri and H. Aminikhah, An efficient numerical method for solving a class of fractional mobile-immobile advection-dispersion equations and its convergence analysis, Chaos Solitons Fractals 146 (2021), 110896, DOI: https://doi.org/10.1016/j.chaos.2021.110896. 10.1016/j.chaos.2021.110896Search in Google Scholar

[44] A. Borhanifar and Kh. Sadri, A new operational approach for numerical solution of generalized functional integro-differential equations, J. Comput. Appl. Math. 279 (2015), 80–96, DOI: https://doi.org/10.1016/j.cam.2014.09.031. 10.1016/j.cam.2014.09.031Search in Google Scholar

[45] G. W. Stewart, Matrix Algorithms, SIAM, Philadelphia, 1998. 10.1137/1.9781611971408Search in Google Scholar

[46] C. Canuto, M. Y. Hussaini, A. Quarteroni, and T. A. K. Zang, Spectral methods: Fundamentals in Single Domains, Springer, Berlin, Heidelberg, 2006, DOI: https://doi.org/10.1007/978-3-540-30726-6. 10.1007/978-3-540-30726-6Search in Google Scholar

[47] N. H. Sweilam and T. M. Al-Ajami, Legendre spectral-collocation method for solving some types of fractional optimal control problems, J. Adv. Res. 6 (2015), no. 3, 393–403, DOI: https://doi.org/10.1016/j.jare.2014.05.004. 10.1016/j.jare.2014.05.004Search in Google Scholar PubMed PubMed Central

[48] M. H. Heydari, M. R. Hooshmandasl, F. M. Maalek Ghaini, and C. Cattani, Wavelets method for solving fractional optimal control problems, Appl. Math. Comput. 286 (2016), 139–154, DOI: https://doi.org/10.1016/j.amc.2016.04.009. 10.1016/j.amc.2016.04.009Search in Google Scholar

Received: 2022-09-12
Revised: 2023-11-18
Accepted: 2024-05-24
Published Online: 2024-11-22

© 2024 the author(s), published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Articles in the same Issue

  1. Regular Articles
  2. On the p-fractional Schrödinger-Kirchhoff equations with electromagnetic fields and the Hardy-Littlewood-Sobolev nonlinearity
  3. L-Fuzzy fixed point results in -metric spaces with applications
  4. Solutions of a coupled system of hybrid boundary value problems with Riesz-Caputo derivative
  5. Nonparametric methods of statistical inference for double-censored data with applications
  6. LADM procedure to find the analytical solutions of the nonlinear fractional dynamics of partial integro-differential equations
  7. Existence of projected solutions for quasi-variational hemivariational inequality
  8. Spectral collocation method for convection-diffusion equation
  9. New local fractional Hermite-Hadamard-type and Ostrowski-type inequalities with generalized Mittag-Leffler kernel for generalized h-preinvex functions
  10. On the asymptotics of eigenvalues for a Sturm-Liouville problem with symmetric single-well potential
  11. On exact rate of convergence of row sequences of multipoint Hermite-Padé approximants
  12. The essential norm of bounded diagonal infinite matrices acting on Banach sequence spaces
  13. Decay rate of the solutions to the Cauchy problem of the Lord Shulman thermoelastic Timoshenko model with distributed delay
  14. Enhancing the accuracy and efficiency of two uniformly convergent numerical solvers for singularly perturbed parabolic convection–diffusion–reaction problems with two small parameters
  15. An inertial shrinking projection self-adaptive algorithm for solving split variational inclusion problems and fixed point problems in Banach spaces
  16. An equation for complex fractional diffusion created by the Struve function with a T-symmetric univalent solution
  17. On the existence and Ulam-Hyers stability for implicit fractional differential equation via fractional integral-type boundary conditions
  18. Some properties of a class of holomorphic functions associated with tangent function
  19. The existence of multiple solutions for a class of upper critical Choquard equation in a bounded domain
  20. On the continuity in q of the family of the limit q-Durrmeyer operators
  21. Results on solutions of several systems of the product type complex partial differential difference equations
  22. On Berezin norm and Berezin number inequalities for sum of operators
  23. Geometric invariants properties of osculating curves under conformal transformation in Euclidean space ℝ3
  24. On a generalization of the Opial inequality
  25. A novel numerical approach to solutions of fractional Bagley-Torvik equation fitted with a fractional integral boundary condition
  26. Holomorphic curves into projective spaces with some special hypersurfaces
  27. On Periodic solutions for implicit nonlinear Caputo tempered fractional differential problems
  28. Approximation of complex q-Beta-Baskakov-Szász-Stancu operators in compact disk
  29. Existence and regularity of solutions for non-autonomous integrodifferential evolution equations involving nonlocal conditions
  30. Jordan left derivations in infinite matrix rings
  31. Nonlinear nonlocal elliptic problems in ℝ3: existence results and qualitative properties
  32. Invariant means and lacunary sequence spaces of order (α, β)
  33. Novel results for two families of multivalued dominated mappings satisfying generalized nonlinear contractive inequalities and applications
  34. Global in time well-posedness of a three-dimensional periodic regularized Boussinesq system
  35. Existence of solutions for nonlinear problems involving mixed fractional derivatives with p(x)-Laplacian operator
  36. Some applications and maximum principles for multi-term time-space fractional parabolic Monge-Ampère equation
  37. On three-dimensional q-Riordan arrays
  38. Some aspects of normal curve on smooth surface under isometry
  39. Mittag-Leffler-Hyers-Ulam stability for a first- and second-order nonlinear differential equations using Fourier transform
  40. Topological structure of the solution sets to non-autonomous evolution inclusions driven by measures on the half-line
  41. Remark on the Daugavet property for complex Banach spaces
  42. Decreasing and complete monotonicity of functions defined by derivatives of completely monotonic function involving trigamma function
  43. Uniqueness of meromorphic functions concerning small functions and derivatives-differences
  44. Asymptotic approximations of Apostol-Frobenius-Euler polynomials of order α in terms of hyperbolic functions
  45. Hyers-Ulam stability of Davison functional equation on restricted domains
  46. Involvement of three successive fractional derivatives in a system of pantograph equations and studying the existence solution and MLU stability
  47. Composition of some positive linear integral operators
  48. On bivariate fractal interpolation for countable data and associated nonlinear fractal operator
  49. Generalized result on the global existence of positive solutions for a parabolic reaction-diffusion model with an m × m diffusion matrix
  50. Online makespan minimization for MapReduce scheduling on multiple parallel machines
  51. The sequential Henstock-Kurzweil delta integral on time scales
  52. On a discrete version of Fejér inequality for α-convex sequences without symmetry condition
  53. Existence of three solutions for two quasilinear Laplacian systems on graphs
  54. Embeddings of anisotropic Sobolev spaces into spaces of anisotropic Hölder-continuous functions
  55. Nilpotent perturbations of m-isometric and m-symmetric tensor products of commuting d-tuples of operators
  56. Characterizations of transcendental entire solutions of trinomial partial differential-difference equations in ℂ2#
  57. Fractional Sturm-Liouville operators on compact star graphs
  58. Exact controllability for nonlinear thermoviscoelastic plate problem
  59. Improved modified gradient-based iterative algorithm and its relaxed version for the complex conjugate and transpose Sylvester matrix equations
  60. Superposition operator problems of Hölder-Lipschitz spaces
  61. A note on λ-analogue of Lah numbers and λ-analogue of r-Lah numbers
  62. Ground state solutions and multiple positive solutions for nonhomogeneous Kirchhoff equation with Berestycki-Lions type conditions
  63. A note on 1-semi-greedy bases in p-Banach spaces with 0 < p ≤ 1
  64. Fixed point results for generalized convex orbital Lipschitz operators
  65. Asymptotic model for the propagation of surface waves on a rotating magnetoelastic half-space
  66. Multiplicity of k-convex solutions for a singular k-Hessian system
  67. Poisson C*-algebra derivations in Poisson C*-algebras
  68. Signal recovery and polynomiographic visualization of modified Noor iteration of operators with property (E)
  69. Approximations to precisely localized supports of solutions for non-linear parabolic p-Laplacian problems
  70. Solving nonlinear fractional differential equations by common fixed point results for a pair of (α, Θ)-type contractions in metric spaces
  71. Pseudo compact almost automorphic solutions to a family of delay differential equations
  72. Periodic measures of fractional stochastic discrete wave equations with nonlinear noise
  73. Asymptotic study of a nonlinear elliptic boundary Steklov problem on a nanostructure
  74. Cramer's rule for a class of coupled Sylvester commutative quaternion matrix equations
  75. Quantitative estimates for perturbed sampling Kantorovich operators in Orlicz spaces
  76. Review Articles
  77. Penalty method for unilateral contact problem with Coulomb's friction in time-fractional derivatives
  78. Differential sandwich theorems for p-valent analytic functions associated with a generalization of the integral operator
  79. Special Issue on Development of Fuzzy Sets and Their Extensions - Part II
  80. Higher-order circular intuitionistic fuzzy time series forecasting methodology: Application of stock change index
  81. Binary relations applied to the fuzzy substructures of quantales under rough environment
  82. Algorithm selection model based on fuzzy multi-criteria decision in big data information mining
  83. A new machine learning approach based on spatial fuzzy data correlation for recognizing sports activities
  84. Benchmarking the efficiency of distribution warehouses using a four-phase integrated PCA-DEA-improved fuzzy SWARA-CoCoSo model for sustainable distribution
  85. Special Issue on Application of Fractional Calculus: Mathematical Modeling and Control - Part II
  86. A study on a type of degenerate poly-Dedekind sums
  87. Efficient scheme for a category of variable-order optimal control problems based on the sixth-kind Chebyshev polynomials
  88. Special Issue on Mathematics for Artificial intelligence and Artificial intelligence for Mathematics
  89. Toward automated hail disaster weather recognition based on spatio-temporal sequence of radar images
  90. The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application
  91. Neural network quaternion-based controller for port-Hamiltonian system
  92. Matching ontologies with kernel principle component analysis and evolutionary algorithm
  93. Survey on machine vision-based intelligent water quality monitoring techniques in water treatment plant: Fish activity behavior recognition-based schemes and applications
  94. Artificial intelligence-driven tone recognition of Guzheng: A linear prediction approach
  95. Transformer learning-based neural network algorithms for identification and detection of electronic bullying in social media
  96. Squirrel search algorithm-support vector machine: Assessing civil engineering budgeting course using an SSA-optimized SVM model
  97. Special Issue on International E-Conference on Mathematical and Statistical Sciences - Part I
  98. Some fixed point results on ultrametric spaces endowed with a graph
  99. On the generalized Mellin integral operators
  100. On existence and multiplicity of solutions for a biharmonic problem with weights via Ricceri's theorem
  101. Approximation process of a positive linear operator of hypergeometric type
  102. On Kantorovich variant of Brass-Stancu operators
  103. A higher-dimensional categorical perspective on 2-crossed modules
  104. Special Issue on Some Integral Inequalities, Integral Equations, and Applications - Part I
  105. On parameterized inequalities for fractional multiplicative integrals
  106. On inverse source term for heat equation with memory term
  107. On Fejér-type inequalities for generalized trigonometrically and hyperbolic k-convex functions
  108. New extensions related to Fejér-type inequalities for GA-convex functions
  109. Derivation of Hermite-Hadamard-Jensen-Mercer conticrete inequalities for Atangana-Baleanu fractional integrals by means of majorization
  110. Some Hardy's inequalities on conformable fractional calculus
  111. The novel quadratic phase Fourier S-transform and associated uncertainty principles in the quaternion setting
  112. Special Issue on Recent Developments in Fixed-Point Theory and Applications - Part I
  113. A novel iterative process for numerical reckoning of fixed points via generalized nonlinear mappings with qualitative study
  114. Some new fixed point theorems of α-partially nonexpansive mappings
  115. Generalized Yosida inclusion problem involving multi-valued operator with XOR operation
  116. Periodic and fixed points for mappings in extended b-gauge spaces equipped with a graph
  117. Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization
  118. Topological structure of the solution sets to neutral evolution inclusions driven by measures
  119. (α, F)-Geraghty-type generalized F-contractions on non-Archimedean fuzzy metric-unlike spaces
  120. Solvability of infinite system of integral equations of Hammerstein type in three variables in tempering sequence spaces c 0 β and 1 β
  121. Special Issue on Nonlinear Evolution Equations and Their Applications - Part I
  122. Fuzzy fractional delay integro-differential equation with the generalized Atangana-Baleanu fractional derivative
  123. Klein-Gordon potential in characteristic coordinates
  124. Asymptotic analysis of Leray solution for the incompressible NSE with damping
  125. Special Issue on Blow-up Phenomena in Nonlinear Equations of Mathematical Physics - Part I
  126. Long time decay of incompressible convective Brinkman-Forchheimer in L2(ℝ3)
  127. Numerical solution of general order Emden-Fowler-type Pantograph delay differential equations
  128. Global smooth solution to the n-dimensional liquid crystal equations with fractional dissipation
  129. Spectral properties for a system of Dirac equations with nonlinear dependence on the spectral parameter
  130. A memory-type thermoelastic laminated beam with structural damping and microtemperature effects: Well-posedness and general decay
  131. The asymptotic behavior for the Navier-Stokes-Voigt-Brinkman-Forchheimer equations with memory and Tresca friction in a thin domain
  132. Absence of global solutions to wave equations with structural damping and nonlinear memory
  133. Special Issue on Differential Equations and Numerical Analysis - Part I
  134. Vanishing viscosity limit for a one-dimensional viscous conservation law in the presence of two noninteracting shocks
  135. Limiting dynamics for stochastic complex Ginzburg-Landau systems with time-varying delays on unbounded thin domains
  136. A comparison of two nonconforming finite element methods for linear three-field poroelasticity
Downloaded on 14.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dema-2024-0034/html
Scroll to top button