Next Article in Journal
Real-Time Interval Type-2 Fuzzy Control of an Unmanned Aerial Vehicle with Flexible Cable-Connected Payload
Next Article in Special Issue
ω-Circulant Matrices: A Selection of Modern Applications from Preconditioning of Approximated PDEs to Subdivision Schemes
Previous Article in Journal
Enhancing Social Media Platforms with Machine Learning Algorithms and Neural Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Communication

Algorithm for Approximate Solving of a Nonlinear Boundary Value Problem for Generalized Proportional Caputo Fractional Differential Equations

1
Department of Software Technologies, Plovdiv University “P. Hilendarski”, 4000 Plovdiv, Bulgaria
2
Department of Computer Technologies, Plovdiv University “P. Hilendarski”, 4000 Plovdiv, Bulgaria
*
Author to whom correspondence should be addressed.
Algorithms 2023, 16(6), 272; https://doi.org/10.3390/a16060272
Submission received: 25 April 2023 / Revised: 24 May 2023 / Accepted: 27 May 2023 / Published: 29 May 2023

Abstract

:
In this paper an algorithm for approximate solving of a boundary value problem for a nonlinear differential equation with a special type of fractional derivative is suggested. This derivative is called a generalized proportional Caputo fractional derivative. The new algorithm is based on the application of the monotone-iterative technique combined with the method of lower and upper solutions. In connection with this, initially, the linear fractional differential equation with a boundary condition is studied, and its explicit solution is obtained. An appropriate integral fractional operator for the nonlinear problem is constructed and it is used to define the mild solutions, upper mild solutions and lower mild solutions of the given problem. Based on this integral operator we suggest a scheme for obtaining two monotone sequences of successive approximations. Both sequences consist of lower mild solutions and lower upper solutions of the studied problem, respectively. The monotonic uniform convergence of both sequences to mild solutions is proved. The algorithm is computerized and applied to a particular example to illustrate the theoretical investigations.

1. Introduction

Fractional derivatives of any type are adequate models of the dynamics of many phenomena and process in engineering, population dynamics, ecology, etc. In the literature there are several types of fractional derivatives such as Caputo fractional derivative, Riemann–Liouville fractional derivative [1,2], proportional fractional derivative with respect to other functions [3], Caputo–Fabrizio fractional derivative [4] and ABC fractional derivative [5]. Some of the basic types of fractional derivatives are applied to models such as the fractional models of gas dynamics [6], the fractional model in the dynamics of particles [7], the computer virus fractional-order model [8] and the fractional models in geo-hydrology [9].
In the last decade the generalized proportional fractional derivative of Caputo type (PFD) was introduced [10,11] and applied to differential equations. Several qualitative properties of the solutions of differential equations with PFD are well studied. We could mention the existence results [12], the existence and Ulam-type stability [13,14] results, some numerical solutions [15] and explicit solutions in the cases with and without impulses [16].
Note that when PFD is applied to nonlinear differential equations it is very difficult to obtain the solution in an explicit form. It leads to more complicated practical application and investigation of the properties of the solutions. It requires the use of numerical and approximate methods for obtaining the solutions of the studied differential equations with initial and boundary conditions. One of the approximate methods giving solutions as a limit of a sequence of functions is the monotone iterative method. It is theoretically proved and applied to initial value problems for various types of fractional differential equations such as the Caputo fractional evolution problem [17], fractional-order neutral differential equations [18] and Riemann–Liouville fractional differential equations [19]. These method is also successfully applied to some boundary value problems for Riemann–Liouville fractional differential equations [20,21,22,23] and for the ψ -Caputo fractional differential equation [24]. To the best of our knowledge, the monotone-iterative technique is not applied to a nonlinear boundary value problem for differential equations with PFD.
The aim of this paper is to present a new algorithm for approximate solving of a nonlinear boundary value problem (BVP) for a scalar nonlinear differential equation with PFD of Caputo type. A new type of integral fractional operator is suggested and it is used to define lower and upper mild solutions of the studied problem. Based on this integral fractional operator two sequences of successive approximations are constructed and their convergence to the mild solution of the studied problem is proved. The proposed scheme is based on the monotone-iterative technique. Initially, the BVP for the linear differential equation with PFD is studied and its explicit solution is given. The suggested scheme for approximate solutions is computerized and applied to a particular example.
The paper is organized in the following manner. In Section 2 well-known literature definitions, lemmas and propositions for PGDs of Caputo type are given. The main results are presented in Section 3. In Section 3.1, the initial value problem for a linear differential equation with PFD of Caputo type is considered and its explicit solution is provided. Then mild solutions, mild lower and upper solutions of the studied nonlinear problem are defined. In Section 3.2 the monotone-iterative technique is applied to the BVP for nonlinear differential equations with PDE of Caputo type. Theoretically some claims about the sequences of successive approximations are proved. In Section 4 the new algorithm is briefly described. In Section 5 the suggested algorithm for successive approximations is illustrated on an example by the application of the appropriate computer program which ideas are presented in Section 6. Some concluding remarks are given in the Section 7.

2. Preliminary Notes

In this paper we apply the generalized proportional fractional derivative of Caputo type to differential equations. For better understanding of the results we will give some known-in-the-literature definitions and results about this type of derivative.
( 0 I γ , ξ y ) ( σ ) = 1 ξ γ Γ ( γ ) 0 σ e ξ 1 ξ σ τ σ τ γ 1 y ( τ ) d τ , σ ( 0 , a ] , γ 0 , ξ ( 0 , 1 ] ,
Suppose we have a point a R : a < and the function y : [ 0 , a ] .
The generalized proportional fractional integral (GPFI) of the function y is defined by [10,11].
( 0 I γ , ξ y ) ( σ ) = 1 ξ γ Γ ( γ ) 0 σ e ξ 1 ξ σ τ σ τ γ 1 y ( τ ) d τ , σ ( 0 , a ] , γ 0 , ξ ( 0 , 1 ] ,
and the generalized proportional Caputo fractional derivative (PFD) of function y is defined by the equality [10,11].
( 0 C D γ , ξ y ) ( σ ) = 1 ξ ξ 1 γ Γ ( 1 γ ) 0 σ e ξ 1 ξ σ τ σ τ γ y ( τ ) d τ + ξ γ Γ ( 1 γ ) 0 σ e ξ 1 ξ σ τ σ τ γ y ( τ ) d τ , σ ( 0 , a ] , γ ( 0 , 1 ) , ξ ( 0 , 1 ] .
The defined above PFD and GPFI are generalizations of the classical Caputo fractional derivative of order γ ( 0 , 1 ) and Riemann–Liouville fractional integral of order γ > 0 , respectively (for more information, see, for example, the classical book [25]).
Remark 1 
(see [10] [Remark 3.2]). The relations ( 0 C D γ , ξ K ) ( σ ) 0 with K 0 being a constant and ( 0 C D γ , ξ e ξ 1 ξ ( . ) ) ( σ ) = 0 for σ > 0 hold. Note that these properties of PFD are totally different than the well known properties of ordinary derivatives of a constant. These properties, combined with the memory properties of PFD, gives us additionally better opportunities in the application for modeling real world phenomena.
Lemma 1 
(Proposition 5.2 [10]). For ξ ( 0 , 1 ] and γ ( 0 , 1 ) we have the equality for PFD
0 C D γ , ξ ( e ξ 1 ξ t t β 1 ) ( σ ) = ξ γ Γ ( β ) Γ ( β γ ) e ξ 1 ξ σ σ β 1 γ , β > 0 .
Lemma 2 
(Lemma 5 [26]). If we have a function φ C ( [ 0 , a ] , ) , and there exists a number η ( 0 , a ) : φ ( η ) = 0 , and φ ( σ ) < 0 for 0 σ < η . Then if there exists ( 0 c D γ , ξ φ ) ( η ) , then the inequality ( 0 c D γ , ξ φ ) ( η ) > 0 holds.
Consider the classes of functions:
C γ , ξ [ 0 , a ] = { φ : [ 0 , a ] : ( 0 C D γ , ξ φ ) ( σ ) exists   for   all σ ( 0 , a ] } , I γ , ξ [ 0 , a ] = { φ : [ 0 , a ] : ( 0 I γ , ξ φ ) ( σ ) exists   for   all   σ ( 0 , a ] } .
For any function φ C γ , ξ [ 0 , a ] and 0 D γ , ξ φ ( . ) I γ , ξ [ 0 , a ] with ξ ( 0 , 1 ] , γ ( 0 , 1 ) we have the following result:
Proposition 1 
(Theorem 5.3 [10]). Let ξ ( 0 , 1 ] and γ ( 0 , 1 ) . Then the equality
( 0 I γ , ξ ( 0 C D γ , ξ φ ) ) ( σ ) = φ ( σ ) φ ( 0 ) e ξ 1 ξ σ , σ ( 0 , a ]
holds.
For any function φ I γ , ξ [ 0 , a ] and 0 I γ , ξ φ ( . ) C γ , ξ [ 0 , a ] with ξ ( 0 , 1 ] , γ ( 0 , 1 ) we have the following result:
Proposition 2 
([10]). Let γ ( 0 , 1 ) and γ ( 0 , 1 ) . Then
( 0 C D γ , ξ ( 0 I γ , ξ φ ) ) ( σ ) = φ ( σ ) , σ ( 0 , a ] .

3. Main Theoretical Results

3.1. Mild Solutions of the Generalized Proportional Caputo Fractional Differential Equation

First, we will investigate the linear case and we will provide an explicit solution to the corresponding initial value problem.
Consider the linear scalar fractional differential equation with the PFD and an initial condition (IVPL)
( 0 C D γ , ξ φ ) ( σ ) = λ φ ( t ) + Φ ( t ) , σ ( 0 , a ] , φ ( 0 ) = φ 0
where φ 0 , ξ ( 0 , 1 ] , γ ( 0 , 1 ) , λ is a constant, Φ C ( [ 0 , a ] , ) .
Lemma 3 
(see Example 5.7 [10]). Let the function Φ I γ , ξ [ 0 , a ] . Then the IVPL (2) has a unique solution φ C γ , ξ [ 0 , a ] given by the equality
φ ( σ ) = φ 0 e ( ξ 1 ) σ ξ E γ λ σ ξ γ + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) Φ ( τ ) d τ , σ ( 0 , a ] ,
where the notations E γ ( . ) and E γ , γ ( . ) are used for the Mittag-Leffler functions with one and two parameters, respectively.
Consider the nonlinear scalar differential equation with PFD and a nonlinear boundary condition (GPDE):
( 0 C D γ , ξ y ) ( σ ) = ϑ σ , y ( σ ) , σ ( 0 , a ] , Δ y ( 0 ) , y ( a ) = 0 ,
where ξ ( 0 , 1 ] , γ ( 0 , 1 ) , ϑ : [ 0 , a ] × R R and Δ : R × R R .
Remark 2.
Any function y C γ , ξ [ 0 , a ] satisfying both equalities (4) is called a solution of GPDE (4).
Let λ , μ > 0 be constants (to be determined later). For any solution y C γ , ξ [ 0 , T ] of GPDE (4) we define ψ y = y ( 0 ) 1 μ Δ ( y ( 0 ) , y ( a ) ) . Then GPDE (4) can be equivalently written in the form
( 0 C D γ , ξ y ) ( σ ) = λ y ( σ ) + Y σ , y ( σ ) , σ [ 0 , a ] , y ( 0 ) = ψ y ,
where
Y σ , y = ϑ σ , y + λ y , y , σ ( 0 , a ] .
Note the problem (5) is an initial value problem for the nonlinear differential equation with PFD. Based on the explicit solution (3) of the IVPL (2) we will define a mild solution of (5) and its equivalent GPDE (4).
Define the integral fractional operator Ω : C [ 0 , a ] C [ 0 , a ] by
( Ω φ ) ( σ ) = φ ( 0 ) 1 μ Δ ( φ ( 0 ) , φ ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , φ ( τ ) ) + λ φ ( τ ) d τ , σ [ 0 , a ] ,
where λ , μ are given positive constants (we will define them later).
The mild solutions of fractional differential equations play an important role in the study of various qualitative properties of the solutions. Mild solutions are defined by the application of an appropriate integral operator deeply connected with the studied fractional differential equation (see, for example, Definition 3.1. Ref. [27] for fractional neutral evolution equations, Ref. [28] for fractional evolution equation, Ref. [29] for Caputo–Hadamard fractional differential equations).
Definition 1.
Any fixed point φ C [ 0 , a ] (if any) of the operator Ω is called a mild solution of GPDE (4).
Theorem 1.
Let for any function φ C γ , ξ [ 0 , a ] the function f ( . , φ ( . ) ) I γ , ξ [ 0 , a ] . Then any solution x C γ , ξ [ 0 , a ] of (4) is a mild solution of (4) and vice versa.
Proof. 
Let y C γ , ξ [ 0 , a ] be a mild solution of (4). According to Definition 1 and (7) the equality
y ( σ ) = y ( 0 ) 1 μ Δ ( y ( 0 ) , y ( T ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , y ( τ ) ) + λ y ( τ ) d τ , σ [ 0 , a ] ,
holds.
For σ = 0 from (8) we have y ( 0 ) = y ( 0 ) 1 μ Δ ( y ( 0 ) , y ( a ) ) or Δ ( y ( 0 ) , y ( a ) ) = 0 .
The equality (8) is of the form (3) with φ = y , φ 0 = y ( 0 ) 1 μ Δ ( y ( 0 ) , y ( a ) ) , Φ ( σ ) = ϑ ( σ , y ( σ ) ) + λ y ( σ ) and according to Lemma 3 the function y is satisfying (2), i.e.,
( 0 C D γ , ξ φ ) ( σ ) = λ φ ( σ ) + Φ ( σ ) = λ ϑ ( σ , y ( σ ) ) + λ y ( σ ) = ϑ ( σ , y ( σ ) ) .
Definition 2.
The function y C [ 0 , a ] is a mild lower (a mild upper) solution of the GPDE (4) if it satisfies the integral inequality y ( t ) ( ) ( Ω y ) ( t ) , t [ 0 , a ] .

3.2. Monotone-Iterative Technique

As is mentioned in Remark 1 the PFD gives wider opportunity for more adequate modeling. At the same time, only a small part of differential equations with PFD could be solved in explicit form and its causes some difficulties in the application. It requires some approximate methods to be used for their solution. One of these methods is the main goal of this paper.
We will recall the main idea of the monotone-iterative technique. Starting from a given arbitrary lower solution of the studied problem we construct recursively in an appropriate way, by the help of an integral operator, a sequence of lower solutions which is increasing and convergent to a solution of the given problem. Similarly, starting from a given upper solution we construct a monotone decreasing sequence of upper solution which is decreasing and convergent to a solution of the studied problem.
Note that this method is applied to various types of differential equations as well as to some types of fractional differential equations. In the case of fractional differential equations it is necessary that there be defined mild solutions, mild lower and mild upper solutions which can be used in the application of the monotone-iterative technique. Specially for the generalized proportional fractional differential equations this method is applied in [16]. However, the used fractional derivative is the Riemann–Liouville type of generalized proportional fractional derivative. This derivative, unlike the Caputo type derivative, requires a special type of initial conditions and this leads to the necessity of a definition of a particular integral operator and particular types of lower and upper solutions. Neither the integral operator nor the mild solutions and mild lower/ upper solutions could be applied to the Caputo-type generalized proportional fractional derivative studied in this paper. Additionally, in [16] the initial condition is studied, which is different to the nonlinear boundary condition in this paper and it has a huge influence on the construction of the algorithm for the successive approximations. It determines the necessity of independent essential study of the application of the monotone-iterative method to the GPDE (4). To the best of our knowledge, it is the first paper suggesting an approximate method for the generalized proportional Caputo fractional differential equation.
Theorem 2.
Let the following conditions be fulfilled:
1.
The functions ς ( 0 ) , ϖ ( 0 ) C ( [ 0 , a ] ) are a mild lower solution and a mild upper solution of the GPDE (4), respectively, and ς ( 0 ) ( t ) ϖ ( 0 ) ( t ) for t ( 0 , a ] .
2.
The function ϑ C ( [ 0 , a ] × , ) and
ϑ ( σ , x ) ϑ ( σ , y ) λ ( y x ) , σ [ 0 , a ] , x , y : ς ( t ) x y ϖ ( t ) ,
 holds, where λ > 0 .
3.
The function Δ C ( × , ) , and
Δ ( x 2 , y 2 ) Δ ( x 1 , y 1 ) μ ( x 2 x 1 ) + δ ( y 1 y 2 ) , f o r x 1 , x 2 , y 1 , y 2 : ς ( 0 ) x 1 x 2 w ( 0 ) , ς ( a ) y 1 y 2 ϖ ( a )
 holds, where μ , δ > 0 .
Then there exist sequences { ς ( n ) ( · ) } n = 0 and { ϖ ( n ) ( · ) } n = 0 , such that:
[a] 
The sequence { ς ( k ) ( σ ) } k = 0 : ς ( n + 1 ) ( σ ) = Ω ( ς ( n ) ) ( σ ) f o r σ [ 0 , a ] , n = 0 , 1 , 2 , , consists of mild lower solutions of the GPDE (4) on [ 0 , a ] , it is increasing and it approaches uniformly on [ 0 , a ] to χ C ( [ 0 , a ] ) and the limit function χ is a mild solution of the GPDE (4) on [ 0 , a ] , where the operator Ω is defined by (7).
[b] 
The sequence { ϖ ( k ) ( σ ) } k = 0 : ϖ ( n + 1 ) ( σ ) = Ω ( ϖ ( n ) ) ( σ ) f o r σ [ 0 , a ] , n = 0 , 1 , 2 , , consists of mild upper solutions of the GPDE (4) on [ 0 , a ] , it is decreasing and it approaches uniformly on [ 0 , a ] to W C ( [ 0 , a ] ) and the limit function W is a mild solution of the GPDE (4) on [ 0 , a ] , where the operator Ω is defined by (7).
[c] 
The inequalities ς ( k ) ( σ ) ϖ ( k ) ( σ ) and χ ( σ ) W ( σ ) are satisfied for t [ 0 , a ] , k = 1 , 2 , , i.e., the inequalities
ς ( 0 ) ( σ ) ς ( 1 ) ( σ ) ς ( 2 ) ( σ ) χ ( σ ) W ( σ ) ϖ ( 2 ) ( σ ) ϖ ( 1 ) ( σ ) ϖ ( 0 ) ( σ )
hold.
Proof. 
We will use the operator Ω given by Equation (7) with constants λ , μ defined in conditions 2 and 3 of Theorem 2.
By induction we will prove the monotonicity of the sequence { ς ( k ) ( σ ) } k = 0 .
Let n = 1 . The function ς ( 0 ) ( · ) is a mild lower solution of GPDE (4). Thus, we have
ς ( 0 ) ( σ ) ς ( 0 ) ( 0 ) 1 μ Δ ( ς ( 0 ) ( 0 ) , ς ( 0 ) ( T ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , ς ( 0 ) ( τ ) ) + λ ς ( 0 ) ( τ ) d τ = ς ( 1 ) ( σ ) , σ [ 0 , a ] .
Then, from condition 2, we obtain
0 σ ( σ τ ) γ 1 e ( ξ 1 ) σ τ ξ E γ , γ λ σ τ ξ γ ϑ τ , ς ( 0 ) ( τ ) + μ ς ( 0 ) ( τ ) d τ = 0 σ ( σ τ ) γ 1 e ( ξ 1 ) σ τ ξ E γ , γ λ σ τ ξ γ ϑ τ , ς ( 1 ) ( τ ) + λ ς ( 1 ) ( τ ) d τ + 0 σ ( σ τ ) γ 1 e ( ξ 1 ) σ τ ξ E γ , γ λ σ τ ξ γ × ϑ ( τ , ς ( 0 ) ( τ ) ) ϑ ( τ , ς ( 1 ) ( τ ) ) + λ ( ς ( 0 ) ( τ ) ς ( 1 ) ( τ ) ) d τ 0 σ ( σ τ ) γ 1 e ( ξ 1 ) σ τ ξ E γ , γ λ σ τ ξ γ ϑ ( τ , ς ( 1 ) ( τ ) ) + λ ς ( 1 ) ( τ ) d τ .
From condition 3 we obtain the inequality
ς ( 0 ) ( 0 ) 1 μ Δ ( ς ( 0 ) ( 0 ) , ς ( 0 ) ( a ) ) ς ( 1 ) ( 0 ) + 1 μ Δ ( ς ( 1 ) ( 0 ) , ς ( 1 ) ( a ) ) ς ( 0 ) ( 0 ) ς ( 1 ) ( 0 ) + ( ς ( 1 ) ( 0 ) ς ( 0 ) ( 0 ) ) + δ μ ( ς ( 0 ) ( a ) ς ( 1 ) ( a ) ) 0 .
Applying the inequalities (9) and (10) we obtain ς ( 1 ) ( σ ) ς ( 2 ) ( σ ) , σ [ 0 , a ] .
Inductively we prove the inequalities
ς ( n ) ( σ ) ς ( n + 1 ) ( σ ) , σ [ 0 , a ] , n = 0 , 1 , 2 , .
Similarly, by induction we prove the monotonicity of the sequence { ϖ ( k ) ( t ) } k = 0 , i.e.,
ϖ ( n ) ( σ ) ϖ ( n + 1 ) ( σ ) , σ [ 0 , a ] , n = 0 , 1 , 2 , .
We use condition 1 and obtain ς ( 0 ) ( σ ) ϖ ( 0 ) ( σ ) , for σ [ 0 , a ] . Therefore, from conditions 1, 2 we obtain inequalities
ς ( 1 ) ( σ ) ϖ ( 1 ) ( σ ) = ς ( 0 ) ( 0 ) ϖ ( 0 ) ( 0 ) 1 μ Δ ( ς ( 0 ) ( 0 ) , ς ( 0 ) ( a ) ) + g ( ϖ ( 0 ) ( 0 ) , ϖ ( 0 ) ( a ) ) × e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ( ϑ ( τ , ς ( 0 ) ( τ ) ) ϑ ( τ , ϖ ( 0 ) ( τ ) ) + λ ς ( 0 ) ( τ ) ϖ ( 0 ) ( τ ) ) d s ς ( 0 ) ( 0 ) ϖ ( 0 ) ( 0 ) + 1 μ μ ( ϖ ( 0 ) ( 0 ) ς ( 0 ) ( 0 ) ) + δ ( ς ( 0 ) ( a ) ϖ ( 0 ) ( a ) ) × e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ( λ ( ϖ ( 0 ) ( τ ) ) ς ( 0 ) ( τ ) ) + λ ς ( 0 ) ( τ ) ϖ ( 0 ) ( τ ) ) d τ 0 , σ [ 0 , a ] .
Inductively we prove the inequalities
ς ( n ) ( σ ) ϖ ( n ) ( σ ) , σ [ 0 , a ] , n = 0 , 1 , 2 , .
Therefore, the sequence { ς ( k ) ( · ) } k = 0 is increasing, bounded by ς ( 0 ) ( · ) and ϖ ( 0 ) ( · ) and equicontinuous on [ 0 , a ] . Thus, it is convergent uniformly on [ 0 , a ] . Denote χ ( t ) = lim n ς ( n ) ( t ) , t [ 0 , a ] . According to what was proved above, the inequalities
ς ( m ) ( σ ) χ ( σ ) , σ [ 0 , a ] , m = 0 , 1 , 2 , ,
hold. We take the limit as m in the definition of functions ς ( m ) ( . ) , use the continuity of the functions ϑ , Δ and we obtain the fractional integral equation
χ ( σ ) = lim m ς ( m ) ( σ ) = lim m { ς ( m 1 ) ( 0 ) 1 μ Δ ( ς ( m 1 ) ( 0 ) , ς ( m 1 ) ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) × ϑ ( τ , ς ( m 1 ) ( τ ) ) + λ ς ( m 1 ) ( τ ) d τ } = χ ( 0 ) 1 μ Δ ( χ ( 0 ) , χ ( T ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , χ ( τ ) ) + λ χ ( τ ) d τ f o r σ ( 0 , a ] .
Thus, the function χ C ( [ 0 , a ] ) is a mild solution of the GPDE (4) on [ 0 , a ] .
Similarly, the sequence { ϖ ( k ) ( · ) } k = 0 is monotone, bounded and equicontinuous on [ 0 , a ] . Thefore, it is convergent uniformly to W ( σ ) = lim n ϖ ( n ) ( σ ) and W ( σ ) is a mild solution of the GPDE (4) on [ 0 , a ] and χ ( σ ) W ( σ ) , σ [ 0 , a ] . □
Remark 3.
In Theorem 2 the existence of mild solutions of GPDE (4) is indirectly proved.
Corollary 1.
Let the conditions 1 and 2 of Theorem 2 be fulfilled and the function Δ C ( × , ) , be non-increasing with respect to both of its arguments. Then the claims of Theorem 2 are satisfied with μ = 1 in Equation (7) of the operator Ω.
Remark 4.
If additionally in Theorem 2 we assume that any mild solution of GPDE (4) y C γ , ξ [ 0 , a ] then according to Theorem 1 any mild solution of GPDE (4) is a solution of the same problem and the sequences of mild lower solutions and mild upper solution in Theorem 2 will converge to a solution of GPDE (4).
Remark 5.
If GPDE (4) has a unique solution, then operator Ω has a unique fixed point and GPDE (4) has a unique mild solution.
Corollary 2.
Let the conditions of Theorem 2 be fulfilled and GPDE (4) have unique solution y C γ , ξ [ 0 , a ] . Then additionally to the claims of Theorem 2 both sequences { ς ( k ) ( σ ) } k = 0 and { ϖ ( k ) ( σ ) } k = 0 aproach this solution of GPDE (4).

4. Algorithm for Successive Approximations

Shortly we will describe the above-presented algorithm for obtaining approximate mild solutions of the GPDE (4). Assume all conditions of Corollary 2 are satisfied.
Step 1. Find a lower mild solution ς ( 0 ) ( t ) , t [ 0 , a ] and an upper mild solution ϖ ( 0 ) ( t ) , t [ 0 , a ] of the GPDE (4), i.e., find functions, satisfying the inequalities (see Definition 1):
ς ( 0 ) σ ς ( 0 ) ( 0 ) 1 μ Δ ( ς ( 0 ) ( 0 ) , ς ( 0 ) ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , ς ( 0 ) ( τ ) ) + λ ς ( 0 ) ( τ ) d τ , ϖ ( 0 ) σ ϖ ( 0 ) ( 0 ) 1 μ Δ ( ϖ ( 0 ) ( 0 ) , ϖ ( 0 ) ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , ϖ ( 0 ) ( τ ) ) + λ ϖ ( 0 ) ( τ ) d τ , σ [ 0 , a ] ,
where λ , μ are Lipschitz constants defined in Conditions 2 and 3 of Theorem 2.
Step 2. For n = 0 obtain ς ( n + 1 ) ( t ) and ϖ ( n + 1 ) ( t ) , t [ 0 , a ] by the equalities ς ( n + 1 ) ( t ) = Ω ( ς ( n ) ( t ) ) and ϖ ( n + 1 ) ( t ) = Ω ( ϖ ( n ) ( t ) ) for t [ 0 , a ] , i.e., use the equalities
ς ( n + 1 ) σ = ς ( n ) ( 0 ) 1 μ Δ ( ς ( n ) ( 0 ) , ς ( n ) ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , ς ( n ) ( τ ) ) + λ ς ( n ) ( τ ) d τ ,
and
ϖ ( n + 1 ) σ = ϖ ( n ) ( 0 ) 1 μ Δ ( ϖ ( n ) ( 0 ) , ϖ ( n ) ( a ) ) e ( ξ 1 ) σ ξ E γ ( λ σ ξ γ ) + 1 ξ γ Γ ( γ ) 0 σ ( σ τ ) γ 1 e ( ξ 1 ) ( σ τ ξ ) E γ , γ ( λ σ τ ξ γ ) ϑ ( τ , ϖ ( n ) ( τ ) ) + λ ϖ ( n ) ( τ ) d τ , σ [ 0 , a ] .
Step 3. For the current value n = k , k = 0 , 1 , 2 , , if the inequality
max { max σ [ 0 , a ] ς ( n + 1 ) ( σ ) ς ( n ) ( σ ) | , max σ [ 0 , a ] ϖ ( n + 1 ) ( σ ) ϖ ( n ) ( σ ) | } < ϵ
holds with the initially given small-enough number ϵ > 0 , then go to Step 4. If the inequality is not satisfied, then we go to Step 2 with n = k instead of n = 0 .
Step 4. Stop. The mild solution of the GPDE (4) is x ( σ ) = 0.5 ς ( k + 1 ) ( σ ) ϖ ( k + 1 ) ( σ ) for σ [ 0 , a ] .

5. Example

We will illustrate the application of the suggested above algorithm for successive approximations on a particular example. Consider the GPDE
( 0 C D 0.3 , 0.5 u ) ( t ) = sin ( u ( t ) ) t + 1 f o r t ( 0 , 4 ] , u ( 0 ) u ( 4 ) = 0 ,
with ϑ ( t , x ) = sin ( x ) t + 1 , Δ ( x , y ) = x y , γ = 0.3 , ξ = 0.5 .
Note that GPDE (16) is a periodic boundary value problem.
The function ϑ ( σ , x ) satisfies condition 2 of Theorem 2 with λ = 1 .
The function Δ ( x , y ) satisfies condition 3 with μ = δ = 1 .
The fractional operator Ω , defined by (7), in this case is given by the following integral equation
( Ω u ) ( σ ) = u ( 4 ) e t E 0.3 ( 2 σ 0.3 ) + 1 0 . 5 0.3 Γ ( 0.3 ) 0 σ ( σ τ ) 0.7 e τ σ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( u ( τ ) ) τ + 1 + u ( τ ) d τ , σ [ 0 , 4 ] .
The function u ( t ) 0 is a mild solution of GPDE (16). According to Theorem 1 zero is a solution of GPDE (16).
Consider the function ϖ ( 0 ) ( σ ) = e σ . Applying the inequality 1 0 . 5 0.3 Γ ( 0.3 ) ( σ τ ) 0.7 e τ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 + e τ 0.012 for τ [ 0 , 4 ] (see Figure 1) we obtain
e σ e σ 4 E 0.3 ( 2 σ 0.3 ) + 1 0 . 5 0.3 Γ ( 0.3 ) 0 σ ( σ τ ) 0.7 e τ σ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 + e τ d τ , σ [ 0 , 4 ] .
or (see Figure 2)
1 e 4 E 0.3 ( 2 σ 0.3 ) + 0.012 e 4 E 0.3 ( 2 σ 0.3 ) + 1 0 . 5 0.3 Γ ( 0.3 ) 0 σ ( σ τ ) 0.7 e τ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 + e τ d τ , σ [ 0 , 4 ] .
Furthermore, ϖ ( 0 ) ( 0 ) ϖ ( 0 ) ( 4 ) = 1 e 4 > 0 and therefore, the function ϖ ( 0 ) ( σ ) is a mild upper solution of GPDE (16).
For n 0 the approximation ϖ ( n + 1 ) ( t ) is obtained on [ 0 , 4 ] by
ϖ ( n + 1 ) ( σ ) = ϖ ( n ) ( 4 ) e σ E 0.3 ( 2 σ 0.3 ) + 1 0 . 5 0.3 Γ ( 0.3 ) 0 σ ( σ τ ) 0.7 e ( τ σ ) E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( ϖ ( n ) ( τ ) ) τ + 1 + ϖ ( n ) ( τ ) d τ .
Then the inequalities ϖ ( 0 ) ( σ ) = e σ ϖ ( 1 ) ( σ ) ϖ ( 2 ) ( σ ) ϖ ( 3 ) ( σ ) ϖ ( 4 ) ( σ ) 0 hold (see Table 1 and Figure 3). The sequence of successive approximations { w ( n ) ( σ ) } is a decreasing sequence and, according to Theorem 2 and Corollary 2, it is convergent and its limit is 0, i.e., the sequence is approaching the solution of GPDE (16).
Consider the function ς ( 0 ) ( σ ) = e σ , σ [ 0 , 4 ] . From inequality (19) it follows
e σ e σ 4 E 0.3 ( 2 σ 0.3 ) + 1 0 . 5 0.3 Γ ( 0.3 ) 0 σ ( σ τ ) 0.7 e τ σ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 e τ d τ , σ [ 0 , 4 ] ,
and ς ( 0 ) ( 0 ) ς ( 0 ) ( 4 ) = 1 + e 4 < 0 .
Therefore the function ς ( 0 ) ( σ ) = e σ is a mild lower solution of (16).
We construct an increasing sequence { ς ( n ) ( t ) } which, according to Theorem 2 and Corollary 2, is approaching 0, i.e., the sequence is approaching the solution of GPDE (16).

6. Discussions about Computer Realization of the Algorithm

In the computer realization we use series for calculation Mittag-Leffler functions with an initially given error.
Before starting the calculation of the sequence of functions w n ( t ) defined by Equation (15), we obtain the values of the functions E γ ( ( h k ξ ) γ ) and E γ , γ ( ( h k ξ ) γ ) for all h k [ 0 , 4 ] where k 0 is an integer, h is the step of the trapezoid method, γ = 0.3 , ξ = 0.5 . The results are written in two arrays E a [ ] and E a a [ ] , where E a [ t ] = E γ ( ( t ξ ) γ ) and E a a [ t ] = E γ , γ ( ( t ξ ) γ ) . In computer realization we use a one-to-one relation between the real numbers t = h k and the integer array indexes.
For the obtained values of w n ( t ) two dimensional array w [ ] [ ] is used.
Initially, we could calculate t 1 γ e t into e x p r [ t ] , t = h k [ 0 , 4 ] .
Then, Equation (20) is reduced to:
w [ 0 ] [ t ] = e t , w [ n + 1 ] [ t ] = w [ n ] [ 4 ] E a [ t ] + + c o n s t 0 t e x p r [ t s ] E a a [ t s ] sin ( w [ n ] [ s ] ) s + 1 + w [ n ] [ s ] d s ,
where c o n s t = 1 0 . 5 0.3 Γ ( 0.3 ) and t = h k [ 0 , 4 ] .
We obtain the values of w n ( t ) for n = 0 , 1 , 2 , 3 , 4 and for all t = h k [ 0 , 4 ] . We apply the trapezoid method for integral calculation.
Some of the values of the upper mild solutions, obtained by computer application of the above described algorithm, are given in Table 1, and the upper mild solutions are graphed on Figure 1. It could be seen the inequalities w 0 ( t ) w 1 ( t ) w 2 ( t ) w 3 ( t ) 0 hold.

7. Conclusions

The main aim is to present an algorithm for approximate obtaining of a solution of a nonlinear BVP for a scalar nonlinear differential equation with PFD on a finite interval. This algorithm is based on monotone-iterative technique combined by appropriately defined mild lower solutions and mild upper solutions. A new integral fractional operator is defined and applied to construct two sequences of successive approximations. Both sequences are monotone and they consist of lower and upper mild solutions of the studied nonlinear problem, respectively. It is proved that both sequences are convergent to the mild solution of the problem. Theoretical study is combined with a computer realization of the newly suggested algorithm and it is applied to an example to illustrate the convergence to the solution of the studied nonlinear problem.
The suggested scheme for approximate solving of the studied problem could be generalized to a system of differential equations with PFD and it could be applied to solve some particular fractional models.

Author Contributions

Conceptualization, A.G., S.H., and A.R.; methodology, S.H.; software, A.G., and A.R.; validation, A.G., S.H., and A.R.; formal analysis, S.H.; writing—original draft preparation, S.H.; writing—review and editing, A.G., S.H., and A.R.; visualization, A.G. and A.R.; supervision, S.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work is partially supported by the Bulgarian National Science Fund under Project KP-06-PN62/1.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Das, S. Functional Fractional Calculus; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  2. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier B. V.: Amsterdam, The Netherlands, 2006. [Google Scholar]
  3. Abbas, M.I. Non-instantaneous impulsive fractional integro-differential equations with proportional fractional derivatives with respect to another function. Math. Meth. Appl. Sci. 2021, 44, 10432–10447. [Google Scholar] [CrossRef]
  4. Caputo, M.; Fabrizio, M. A new definition of fractional derivative without singular kernel. Prog. Fract. Differ. Appl. 2015, 1, 73–85. [Google Scholar]
  5. Atangana, A.; Baleanu, D. New fractional derivatives with non-local and non-singular kernel: Theory and application to heat transfer model. Thermal Sci. 2016, 20, 763–769. [Google Scholar] [CrossRef]
  6. Srivastava, H.M.; Saad, K.M. Some new models of the time-fractional gas dynamic equation. Adv. Math. Models Appl. 2018, 3, 5–17. [Google Scholar]
  7. Tarasov, V.E. Fractional Dynamics: Application of Fractional Calculus to Dynamics of particles, Fields and Media; Springer: Heidelberg, Germany; Higher Education Press: Beijing, China, 2010. [Google Scholar]
  8. Farman, M.; Akgül, A.; Ahmad, A.; Saleem, M.U.; Ahmad, M. Modeling and analysis of computer virus fractional order model. In Methods of Mathematical Modeling; Elsevier: Amsterdam, The Netherlands, 2022; pp. 137–157. [Google Scholar] [CrossRef]
  9. Atangana, A. Fractional Operators with Constant and Variable Order with Application to Geo-hydrology; Academic Press: New York, NY, USA, 2018. [Google Scholar] [CrossRef]
  10. Jarad, F.; Abdeljawad, T.; Alzabut, J. Generalized fractional derivatives generated by a class of local proportional derivatives. Eur. Phys. J. Spec. Top. 2017, 226, 3457–3471. [Google Scholar] [CrossRef]
  11. Jarad, F.; Abdeljawad, T. Generalized fractional derivatives and Laplace transform. Discret. Contin. Dyn. Syst. Ser. S 2020, 13, 709–722. [Google Scholar] [CrossRef]
  12. Shammakh, W.; Alzumi, H.Z. Existence results for nonlinear fractional boundary value problem involving generalized proportional derivative. Adv. Differ. Equations 2019, 2019, 94. [Google Scholar] [CrossRef]
  13. Abbas, M.I. Existence results and the Ulam Stability for fractional differential equations with hybrid proportional-Caputo derivatives. J. Nonlinear Func. Anal. 2020, 2020, 48. [Google Scholar] [CrossRef]
  14. Abbas, M.I. Controllability and Hyers-Ulam stability results of initial value problems for fractional differential equations via generalized proportional-Caputo fractional derivative. Miskolc Math. Notes 2021, 22, 1–12. [Google Scholar] [CrossRef]
  15. Boucenna, D.; Baleanu, D.; Ben Makhlouf, A.; Nagy, A. Analysis and numerical solution of the generalized proportional fractional Cauchy problem. Appl. Num. Math. 2021, 167, 173–186. [Google Scholar] [CrossRef]
  16. Hristova, S.; Abbas, M.I. Explicit solutions of initial value problems for fractional generalized proportional differential equations with and without impulses. Symmetry 2021, 13, 996. [Google Scholar] [CrossRef]
  17. Mu, J. Monotone Iterative Technique for Fractional Evolution Equations in Banach Spaces. J. Appl. Math. 2011, 2011, 767186. [Google Scholar] [CrossRef]
  18. Somjaiwang, D.; Ngiamsunthorn, P.S. Existence and Monotone Iterative Approximation of Solutions for Neutral Differential Equations with Generalized Fractional Derivatives. J. Math. 2022, 2022, 1239701. [Google Scholar] [CrossRef]
  19. Bai, Z.; Zhang, S.; Sun, S.; Yin, C. Monotone iterative method for fractional differential equations. Electr. J. Diff. Equations 2016, 2016, 1–8. [Google Scholar]
  20. Wang, G. Monotone iterative technique for boundary value problems of a nonlinear fractional differential equation with deviating arguments. J. Comput. Appl. Math. 2012, 236, 2425–2430. [Google Scholar] [CrossRef]
  21. Cui, Y.; Sun, Q.; Su, X. Monotone iterative technique for nonlinear boundary value problems of fractional order p∈(2,3]. Adv. Differ. Equations 2017, 2017, 248. [Google Scholar] [CrossRef]
  22. Chen, P.; Kong, Y. Monotone Iterative Technique for Periodic Boundary Value Problem of Fractional Differential Equation in Banach Spaces. Int. J. Nonlinear Sci. Numer. Simul. 2019, 20, 595–599. [Google Scholar] [CrossRef]
  23. Song, S.; Li, H.; Zou, Y. Monotone Iterative Method for Fractional Differential Equations with Integral Boundary Conditions. J. Fuct. Space 2020, 2020, 7319098. [Google Scholar] [CrossRef]
  24. Baitiche, Z.; Derbazi, C.; Alzabut, J.; Samei, M.E.; Kaabar, M.K.A.; Siri, Z. Monotone Iterative Method for ψ-Caputo Fractional Differential Equation with Nonlinear Boundary Conditions. Fractal Fract. 2021, 5, 81. [Google Scholar] [CrossRef]
  25. Podlubny, I. Fractional Differential Equations; Academic Press: San Diego, CA, USA, 1999. [Google Scholar]
  26. Agarwal, R.; Hristova, S.; O’regan, D. Stability of Generalized Proportional Caputo Fractional Differential Equations by Lyapunov Functions. Fractal Fract. 2022, 6, 34. [Google Scholar] [CrossRef]
  27. Zhou, Y.; Jiao, F. Existence of mild solutions for fractional neutral evolution equations. Comput. Math. Appl. 2010, 59, 1063–1077. [Google Scholar] [CrossRef]
  28. Sousa, J.; Abdeljawad, T.; Oliveira, D.S. SMild and classical solutions for fractional evolution differential equation. Palestine J. Math. 2022, 11, 229–242. [Google Scholar]
  29. Ardjouni, A.; Guerfi, A. On the existence of mild solutions for totally nonlinear Caputo-Hadamard fractional differential equations. Results Nonlin. Anal. 2022, 5, 161–168. [Google Scholar] [CrossRef]
Figure 1. Graphs of the limit 0.012 and 1 0 . 5 0.3 Γ ( 0.3 ) ( σ τ ) 0.7 e τ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 + e τ for σ [ 0 , 4 ] .
Figure 1. Graphs of the limit 0.012 and 1 0 . 5 0.3 Γ ( 0.3 ) ( σ τ ) 0.7 e τ E 0.3 , 0.3 ( 2 ( σ τ ) 0.3 ) sin ( e τ ) τ + 1 + e τ for σ [ 0 , 4 ] .
Algorithms 16 00272 g001
Figure 2. Graphs of the limit 1 and e 4 E 0.3 ( 2 t 0.3 ) + 0.012 for t [ 0 , 4 ] .
Figure 2. Graphs of the limit 1 and e 4 E 0.3 ( 2 t 0.3 ) + 0.012 for t [ 0 , 4 ] .
Algorithms 16 00272 g002
Figure 3. Graphs of upper mild solutions w i ( t ) , i = 0 , 1 , 2 , 3 for t [ 0 , 4 ] .
Figure 3. Graphs of upper mild solutions w i ( t ) , i = 0 , 1 , 2 , 3 for t [ 0 , 4 ] .
Algorithms 16 00272 g003
Table 1. Values of upper mild solutions ϖ ( i ) ( σ ) , i = 0 , 1 , 2 , 3 , 4 for σ [ 0 , 4 ] .
Table 1. Values of upper mild solutions ϖ ( i ) ( σ ) , i = 0 , 1 , 2 , 3 , 4 for σ [ 0 , 4 ] .
σ ϖ ( 0 ) ( σ ) ϖ ( 1 ) ( σ ) ϖ ( 2 ) ( σ ) ϖ ( 3 ) ( σ ) ϖ ( 4 ) ( σ )
0.01.00000.01830.00480.00130.0003
0.10.90480.20090.04510.00990.0021
0.20.81870.20270.05050.01220.0029
0.30.74080.19280.05030.01280.0032
0.40.67030.17930.04800.01250.0032
0.50.60650.16490.04480.01190.0031
0.60.54880.15060.04130.01110.0029
0.70.49660.13710.03770.01020.0027
0.80.44930.12450.03440.00940.0025
0.90.40660.11280.03120.00850.0023
1.00.36790.10210.02820.00770.0021
1.10.33290.09230.02550.00700.0019
1.20.30120.08340.02310.00630.0017
1.30.27250.07540.02080.00570.0016
1.40.24660.06810.01880.00510.0014
1.50.22310.06150.01690.00460.0013
1.60.20190.05550.01530.00420.0011
1.70.18270.05010.01380.00380.0010
1.80.16530.04530.01240.00340.0009
1.90.14960.04090.01120.00310.0008
2.00.13530.03690.01010.00270.0007
2.10.12250.03330.00910.00250.0007
2.20.11080.03010.00820.00220.0006
2.30.10030.02720.00740.00200.0005
2.40.09070.02450.00670.00180.0005
2.50.08210.02220.00600.00160.0004
2.60.07430.02000.00540.00150.0004
2.70.06720.01810.00490.00130.0004
2.80.06080.01630.00440.00120.0003
2.90.05500.01470.00400.00110.0003
3.00.04980.01330.00360.00100.0003
3.10.04500.01200.00320.00090.0002
3.20.04080.01090.00290.00080.0002
3.30.03690.00980.00260.00070.0002
3.40.03340.00890.00240.00060.0002
3.50.03020.00800.00210.00060.0002
3.60.02730.00730.00190.00050.0001
3.70.02470.00660.00170.00050.0001
3.80.02240.00590.00160.00040.0001
3.90.02020.00540.00140.00040.0001
4.00.01830.00480.00130.00030.0001
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

Golev, A.; Hristova, S.; Rahnev, A. Algorithm for Approximate Solving of a Nonlinear Boundary Value Problem for Generalized Proportional Caputo Fractional Differential Equations. Algorithms 2023, 16, 272. https://doi.org/10.3390/a16060272

AMA Style

Golev A, Hristova S, Rahnev A. Algorithm for Approximate Solving of a Nonlinear Boundary Value Problem for Generalized Proportional Caputo Fractional Differential Equations. Algorithms. 2023; 16(6):272. https://doi.org/10.3390/a16060272

Chicago/Turabian Style

Golev, Angel, Snezhana Hristova, and Asen Rahnev. 2023. "Algorithm for Approximate Solving of a Nonlinear Boundary Value Problem for Generalized Proportional Caputo Fractional Differential Equations" Algorithms 16, no. 6: 272. https://doi.org/10.3390/a16060272

APA Style

Golev, A., Hristova, S., & Rahnev, A. (2023). Algorithm for Approximate Solving of a Nonlinear Boundary Value Problem for Generalized Proportional Caputo Fractional Differential Equations. Algorithms, 16(6), 272. https://doi.org/10.3390/a16060272

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