Next Article in Journal
Bayesian Joint Modeling Analysis of Longitudinal Proportional and Survival Data
Next Article in Special Issue
Existence of Solutions for Planar Kirchhoff–Choquard Problems
Previous Article in Journal
Distance-Based Knowledge Measure and Entropy for Interval-Valued Intuitionistic Fuzzy Sets
Previous Article in Special Issue
Towards a Proof of Bahri–Coron’s Type Theorem for Mixed Boundary Value Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bounded Solutions of Semi-Linear Parabolic Differential Equations with Unbounded Delay Terms

by
Allaberen Ashyralyev
1,2,3 and
Sa’adu Bello Mu’azu
4,5,*
1
Department of Mathematics, Bahcesehir University, Istanbul 34353, Turkey
2
Department of Mathematics, Peoples’ Friendship University of Russia, 117198 Moscow, Russia
3
Institute of Mathematics and Mathematical Modeling, Almaty 050010, Kazakhstan
4
Department of Mathematics, Faculty of Arts and Sciences, Near East University, TRNC, Mersin 10, Nicosia 99138, Turkey
5
Department of Mathematics, Faculty of Physical Sciences, Kebbi State University of Science and Technology, Aliero P.O. Box 1144, Nigeria
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(16), 3470; https://doi.org/10.3390/math11163470
Submission received: 12 July 2023 / Revised: 30 July 2023 / Accepted: 3 August 2023 / Published: 10 August 2023
(This article belongs to the Special Issue Nonlinear Equations: Theory, Methods, and Applications III)

Abstract

:
In the present work, an initial boundary value problem (IBVP) for the semi-linear delay differential equation in a Banach space with unbounded positive operators is studied. The main theorem on the uniqueness and existence of a bounded solution (BS) of this problem is established. The application of the main theorem to four different semi-linear delay parabolic differential equations is presented. The first- and second-order accuracy difference schemes (FSADSs) for the solution of a one-dimensional semi-linear time-delay parabolic equation are considered. The new desired numerical results of this paper and their discussion are presented.

1. Introduction

The modeling of biological, physical and sociological processes is carried out by using differential equations (DEs) with delay terms. They are employed to simulate oscillation systems that occur in nature. A sampled data control theory provides a classic illustration of the occurrence of time delay (for instance, see [1,2,3,4]). It is well known that the unbounded delay term present in delay differential equations makes it challenging to analyze these equations. Additionally, for a few studies, analytical solutions are provided. As a result of this, studies on numerical methods make up for the dearth of theoretical research. Particularly, the finite difference method is one of the primary techniques employed in this field.
Lu [5], investigated monotone iterative methods for finite-difference solutions of reaction–diffusion systems with time delays and provided improved iterative schemes by using the upper–lower solution approach of the Gauss–Seidel method or the Jacobi method.
The initial value problem (IVP) for linear DPPDEs was studied by Ashyralyev and Sobolevskii [6]; they provided a sufficient condition for the stability of the solution to this problem and obtained the stability estimates of solutions in Hölder norms. Different types of delay parabolic problems were investigated by Ashyralyev and Ağırseven in [7,8]. They provided convergence and stability theorems.
Finally, theorems on the uniqueness and existence of a BS of nonlinear delay parabolic equations were established by Ashyralyev, Agirseven and Ceylanin in [9]. They provided necessary conditions for the existence of a unique BS of nonlinear delay parabolic equations.
We consider the IVP
d v d t + A v ( t ) = f ( t , B ( t ) v ( t ) , B ( t ) v ( t d ) ) , t [ 0 , ) , v ( t ) = φ ( t ) , t [ d , 0 ]
for the semi-linear differential equation in a Banach space E with linear unbounded operators A and B ( t ) with dense domains D ( A ) D ( B ( t ) ) in any arbitrary Banach space E. Assume that A is a very positive operator in E . That means A is the generator of the analytic semigroup exp { t A } t [ 0 , ) of the linear bounded operators with exponentially decreasing norm when t . The following estimates are valid:
exp { t A } E E P e δ t , t A exp { t A } E E P , t ( 0 , )
for some P > 0 , δ > 0 . Let B ( t ) be closed operators. The operator function B ( t ) is strongly continuous on D ( A ) and B ( t ) A 1 / 2 E E H .
A function v ( t ) is called a solution to problem (1) if it satisfied the following conditions:
  • v ( t ) is a continuously differentiable function on [ d , ) .
  • The element v ( t ) D ( A ) t [ d , ) , and the function A v ( t ) is continuous on [ d , ) .
  • v ( t ) satisfies the equation and the initial condition (1).
In the present work, we aim to provide necessary conditions for the existence of a unique BS to problem (1). A semi-linear parabolic differential equation with an unbounded delay term is used to establish a theorem on the uniqueness and existence of a BS for problem (1). Four different semi-linear DPPDEs are used to illustrate the main theorem’s application. Overall, it is precisely difficult to obtain the solution of semi-linear problems. Consequently, the FSADSs for the solution of semi-linear one-dimensional DPPDE are shown. Numerical results are provided. It should be noted that past publications [10,11,12,13,14] have looked into the BS of nonlinear one-dimensional parabolic and hyperbolic differential equations with time delay. However, due to the generality of the strategy used in this research, a larger class of multidimensional delay semi-linear DEs can be treated.

2. Theorem on Existence and Uniqueness

We reduced problem (1) into an integral equation of the form
v ( t ) = e A ( t ( m 1 ) θ ) v ( ( m 1 ) d ) + ( m 1 ) d t e A ( t s ) f ( s , B ( s ) v ( s ) , B ( s ) v ( s d ) ) d s ,
t [ ( m 1 ) d , m d ] , m N , v ( t ) = φ ( t ) , t [ d , 0 ]
in [ 0 , ) × E , and the recursive formula for the solution of problem (1) by using successive approximations is
v i ( t ) = e A ( t ( m 1 ) d ) v i ( ( m 1 ) d ) + ( m 1 ) d t e A ( t s ) f ( s , B ( s ) v i 1 ( s ) , B ( s ) v i ( s d ) ) d s , v 0 ( t ) = e A ( t ( m 1 ) d ) v ( ( m 1 ) d ) , t [ ( m 1 ) d , m d ] , m N , i N ,
v ( t ) = φ ( t ) , t [ d , 0 ] .
Here, N is the set of natural numbers.
Theorem 1.
Assume that the hypotheses below are fulfilled:
1. 
φ : [ d , 0 ] × D A 1 2 E be continuous function and
φ ( t ) D A 1 2 H .
2. 
f : [ 0 , ) × D A 1 2 × D A 1 2 E is a bounded and continuous function, i.e.,
f ( A 1 2 v , A 1 2 u ) E H ¯
and with respect to z, the Lipschitz condition holds:
f ( A 1 2 v , A 1 2 z ) f ( A 1 2 u , A 1 2 z ) E L A 1 2 v A 1 2 u E .
Here, H , H ¯ , L are positive constants and L < 1 2 P d 1 2 . Then, the problem (1) has a unique BS in [ 0 , ) × E .
Proof of Theorem 1.
Using the interval t [ 0 , d ] , we can written problem (1) as
d v d t + A v ( t ) = f ( t , B ( t ) v ( t ) , B ( t ) φ ( t d ) ) , v ( 0 ) = φ ( 0 )
which in an equivalent integral form, becomes
v ( t ) = e A t φ ( 0 ) + 0 t e A ( t s ) f ( s , B ( s ) v ( s ) , B ( s ) φ ( s d ) ) d s .
In accordance with the recursive approximation approach (3), we obtain
v i ( t ) = e A t φ ( 0 ) + 0 t e A ( t s ) f ( s , B ( s ) v i 1 ( s ) , B ( s ) φ ( s d ) ) d s , i = 1 , 2 ,
Consequently,
v ( t ) = v 0 ( t ) + i = 0 ( v i + 1 ( t ) v i ( t ) ) ,
where
v 0 ( t ) = e A t φ ( 0 ) .
From (2) and (4), it follows that
A 1 2 v 0 ( t ) E = e A t E E A 1 / 2 φ ( 0 ) E H P .
Using Equation (8) along with estimates (2) and (5), we obtain
A 1 2 v 1 ( t ) A 1 2 v 0 ( t ) E 0 t A 1 2 e A ( t s ) f ( s , B ( s ) A 1 2 A 1 2 u 0 , B ( s ) A 1 2 A 1 2 φ ( s d ) ) E d s 2 H ¯ P t 1 2 .
By triangle inequality, we have
A 1 2 v 1 ( t ) E H P + 2 H ¯ P t 1 2 .
Using Formula (8) along with estimates (2), (5), and (6), we obtain
A 1 2 v 2 ( t ) A 1 2 v 1 ( t ) E 0 t A 1 2 e A ( t s ) f ( s , B ( s ) v 1 , B ( s ) φ ( s d ) ) f ( s , B ( s ) v 0 , B ( s ) φ ( s d ) ) E d s L P 0 t 1 ( t s ) 1 2 B ( s ) v 1 ( s ) B ( s ) v 0 ( s ) E d s 2 L P 2 H ¯ 0 t 1 ( t s ) 1 2 s 1 2 d s 4 L P 2 H ¯ t .
Then,
A 1 2 v 2 ( t ) E H P + 2 H ¯ P t 1 2 + 4 L P 2 H ¯ t .
Let
A 1 2 v n ( t ) A 1 2 v n 1 ( t ) E H ¯ L ( 2 L P t 1 2 ) n .
Therefore, we obtain
A 1 2 v n + 1 ( t ) A 1 2 v n ( t ) E 0 t A 1 2 e A ( t s ) f ( B ( s ) v n , B ( s ) φ ( s d ) ) f ( B ( s ) v n 1 , B ( s ) φ ( s d ) ) E d s P 0 t L B ( s ) v n ( s ) B ( s ) v n 1 ( s ) E d s P 0 t L H ¯ L ( 2 L P s 1 2 ) n d s H ¯ L ( 2 L P t 1 2 ) n + 1 .
Henceforth, for any n , n 1 , we obtain
A 1 2 v n + 1 ( t ) A 1 2 v n ( t ) E M ¯ L ( 2 L P t 1 2 ) n + 1
and
A 1 2 v n + 1 ( t ) E M P + 2 M ¯ P t 1 2 + + M ¯ L ( 2 L P t 1 2 ) n + 1
by mathematical induction. It is implied by that equation and Equation (9) that
A 1 2 v ( t ) E A 1 2 v 0 ( t ) E + i = 0 A 1 2 v i + 1 ( t ) A 1 2 v i ( t ) E H P + i = 0 H ¯ L ( 2 L P t 1 2 ) i + 1 < , t [ 0 , d ] .
This shows that problem (1) solution exists and is bounded in [ 0 , d ] × E .
From t [ d , 2 d ] , it follows that 0 t d d . We denote that
φ 1 ( t ) = v ( t d ) , t [ d , 2 d ] ,
and suppose that problem (1) has a BS in [ d , 2 d ] × E . Replacing t and t d , we can write
A 1 2 φ 1 ( t ) H 1
and
f ( A 1 2 v 0 ( t ) , A 1 2 φ 1 ( t ) ) E H ¯ 1 .
According to successive approximation of Formula (3), we can write
v 0 ( t ) = e A t d φ 1 ( d ) v i ( t ) = e A t d φ 1 ( d ) + d t e A ( t s ) f ( B ( s ) v i 1 ( s ) , B ( s ) φ 1 ( s ) ) d s , i = 1 , 2 ,
In the same way, for any r , r 1 , we obtain
A 1 2 v r + 1 ( t ) A 1 2 v r ( t ) E H ¯ 1 L ( 2 L P t 1 2 ) r + 1 ,
and
A 1 2 v r + 1 ( t ) E H 1 P + 2 H ¯ 1 P t 1 2 + + H ¯ 1 L ( 2 L P t 1 2 ) r + 1 .
From that, it implies that
A 1 2 v ( t ) E A 1 2 v 0 ( t ) E + i = 0 A 1 2 v i + 1 ( t ) A 1 2 v i ( t ) E H 1 P + i = 0 H ¯ 1 L ( 2 L P t 1 2 ) i + 1 < , t [ d , 2 d ] .
This proves that problem (1)’s solution exists, and it is bounded in [ d , 2 d ] × E .
In the same procedure one, can establish that
A 1 2 v ( t ) E H 1 P + i = 0 H ¯ 1 L ( 2 L P t 1 2 ) i + 1 , t [ n d , ( n + 1 ) d ] ,
where H n and H n ¯ are bounded. This shows that problem (1)’s solution exists and is bounded in [ n d , n + 1 d ] × E . Overall, the constructed function v ( t ) of problem (1) is a BS in [ 0 , ) × E .
We shall now show that this solution to problem (1) is unique. Suppose that problem (1) has a BS solution u ( t ) and that u ( t ) v ( t ) . We write down z ( t ) = u ( t ) v ( t ) . Hence, for z ( t ) , we obtain that
d z d t + A z ( t ) = f ( B ( s ) u ( t ) , B ( s ) u ( t d ) ) f ( B ( s ) v ( t ) , B ( s ) v ( t d ) ) , t ( 0 , ) , z ( t ) = 0 , t [ d , 0 ] .
We consider t [ 0 , d ] . As u ( t d ) = u ( t d ) = φ ( t d ) , we obtain
d z d t + A z ( t ) = f ( B ( s ) u ( t ) , B ( s ) φ ( t d ) ) f ( B ( s ) v ( t ) , B ( s ) φ ( t d ) ) , t ( 0 , ) , z ( t ) = 0 , t [ d , 0 ] .
Henceforth,
z ( t ) = e A t z ( 0 ) + 0 t e A ( t s ) f ( B ( s ) v ( s ) , B ( s ) φ ( s d ) ) f ( B ( s ) u ( s ) , B ( s ) φ ( s d ) ) d s .
Using (2) and (5), we obtain
A 1 2 z ( t ) E 0 t A 1 2 e A ( t s ) f ( B ( s ) v ( s ) , B ( s ) φ ( s d ) ) f ( B ( s ) u ( s ) , φ ( s d ) ) E d s P L 0 t B ( s ) v ( s ) B ( s ) u ( s ) E d s P L 0 t A 1 2 z ( s ) E d s .
By means of integral inequality, we can write
A 1 2 z ( t ) E 0 .
This implies that A 1 2 z ( t ) = 0 , which proves that problem (1)’s solution is unique and bounded in [ 0 , d ] × E .
Using a similar procedure and mathematical induction, we can show that problem (1)’s solution is unique and bounded in [ 0 , ) × E . □
Remark 1.
The approach used in the current study also makes it possible to demonstrate, under certain presumptions, that there exists a unique BS to the IVP for semi-linear parabolic equations
d v d t + A ( t ) v ( t ) = f ( t , B ( t ) v ( t ) , B ( t ) v ( [ t ] ) ) , 0 < t < , v ( 0 ) = φ
in a Banach space E with unbounded operators A ( t ) and B ( t ) .
Remark 2.
It is known that various problems in fluid mechanics dynamics, elasticity and other areas of physics lead to fractional parabolic-type differential equations. Methods of solutions of problems for linear fractional differential equations have been studied extensively by many researchers (see, e.g., [15,16,17,18,19,20,21,22] and the references given therein). The approach used in the current study also makes it possible to demonstrate, under certain presumptions, that there exists a unique BS to the IVP for semi-linear fractional parabolic equations
d v d t + A v ( t ) + D α v ( t ) = f ( t , B ( t ) v ( t ) , B ( t ) v ( t d ) ) , t [ 0 , ) , v ( t ) = φ ( t ) , t [ d , 0 ]
in a Banach space E with unbounded operators A and B ( t ) . Here, α [ 0 , 1 ) .

3. Applications

We begin by considering an IBVP for semi-linear one-dimensional DPPDEs with the Dirichlet condition:
v t ( t , x ) a ( x ) v x x ( t , x ) + δ v ( t , x ) = f ( t , x , v x ( t , x ) , v x ( t d , x ) ) , t ( 0 , ) , x 0 , l v ( t , x ) = φ ( t , x ) , φ ( t , 0 ) = φ ( t , l ) = 0 , t [ d , 0 ] , x 0 , l , v ( t , 0 ) = v ( t , l ) = 0 , t [ d , ) ,
where φ ( t , x ) , a ( x ) are given sufficiently smooth functions (SSFs) and a delta greater than zero is a significant enough number. Suppose that a ( x ) a > 0 .
We can reduce the IBVP (12) to IVP (1) in E = C 0 , l with the strong positive operator A x in C 0 , l according to the following formula:
A x v = a ( x ) d 2 v d x 2 + δ v
with domain D ( A x ) = v C 2 0 , l : v 0 = v l = 0 [23]. Moreover, we have the following estimates:
exp { t A x } C 0 , l C 0 , l P , t [ 0 , ) , t A x exp { t A x } C 0 , l C 0 , l P , t ( 0 , ) .
Therefore, from that and abstracting Theorem 1, we have the following:
Theorem 2.
Suppose the hypotheses below:
1. 
φ : [ d , 0 ] × 0 , l × C ( 1 ) 0 , l C 0 , l is a continuous function and
φ x ( t , . ) C 0 , l H .
2. 
f : [ 0 , ) × 0 , l × C ( 1 ) 0 , l × C ( 1 ) 0 , l C 0 , l is a bounded and continuous function, i.e.,
f ( t , . , v x , u x ) ) C 0 , l H ¯
and with respect to z, the Lipschitz condition holds:
f ( t , . , v x , z x ) f ( t , . , u x , z x ) C 0 , l L v x u x C 0 , l ,
where L , H , H ¯ , are positive constants and L < 1 2 P d 1 2 . Then, problem (12) has a unique BS in [ 0 , ) × C 0 , l .
In addition, we consider the IBVP for semi-linear one-dimensional DPPDEs with the Neumann condition:
v t ( t , x ) a ( x ) v x x ( t , x ) + δ v ( t , x ) = f ( t , x , v x ( t , x ) , v x ( t d , x ) ) , t ( 0 , ) , x 0 , l v ( t , x ) = φ ( t , x ) , φ x ( t , 0 ) = φ x ( t , l ) = 0 , t [ d , 0 ] , x 0 , l , v x ( t , 0 ) = v x ( t , l ) = 0 , t [ d , ) ,
where φ ( t , x ) , a ( x ) are given SSFs and delta greater than zero is a significant enough number. We suppose that a ( x ) a > 0 .
We can reduce the IBVP (17) to IVP (1) in E = C 0 , l with the strong positive operator A x in C 0 , l according to the Formula (13) with domain [23]:
D ( A x ) = v C 2 0 , l : v 0 = v l = 0 .
Moreover, we have the following estimates:
exp { t A x } C 0 , l C 0 , l P , t [ 0 , ) , t A x exp { t A x } C 0 , l C 0 , l P , t ( 0 , ) .
Therefore, from that and abstracting Theorem 1, we have the following:
Theorem 3.
Suppose that assumptions (14)–(16) hold. Then, problem (17) has a unique BS in [ 0 , ) × C 0 , l .
Furthermore, we consider the IBVP for semi-linear one-dimensional DPPDEs with nonlocal conditions:
v t ( t , x ) a ( x ) v x x ( t , x ) + δ v ( t , x ) = f ( x , v x ( t , x ) , v x ( t d , x ) ) , t ( 0 , ) , x 0 , l , v ( t , x ) = φ ( t , x ) , φ ( t , 0 ) = φ ( t , l ) , φ x ( t , 0 ) = φ x ( t , l ) , t [ d , 0 ] , x 0 , l , v ( t , 0 ) = v ( t , l ) , v x ( t , 0 ) = v x ( t , l ) , t [ d , ) ,
where φ ( t , x ) , a ( x ) are given SSFs and a delta greater than zero is a significant enough number. We suppose that a ( x ) a > 0 .
We can reduce the IBVP (18) to IVP (1) in E = C 0 , l with the strong positive operator A x in C 0 , l according to the formula (13) with domain [23]:
D ( A x ) = v C 2 0 , l : v 0 = v l , v 0 = v l .
Moreover, we have the following estimates:
exp { t A x } C 0 , l C 0 , l P , t [ 0 , ) , t A x exp { t A x } C 0 , l C 0 , l P , t ( 0 , ) .
Therefore, from that and abstracting Theorem 1, we have the following:
Theorem 4.
Suppose that assumptions (14)–(16) hold. Then, problem (18) has a unique BS in [ 0 , ) × C 0 , l .
Finally, we consider the IBVP for semi-linear one-dimensional DPPDEs with Robin condition:
v t ( t , x ) a ( x ) v x ( t , x ) x + δ v ( t , x ) = f ( x , v x ( t , x ) , v x ( t d , x ) ) , t ( 0 , ) , x 0 , l v ( t , x ) = φ ( t , x ) , φ t , 0 = b φ x t , 0 , φ t , l = c φ x t , l , t [ d , 0 ] , x 0 , l , v t , 0 = b v x t , 0 , v t , l = c v x t , l , t [ d , 0 ] ,
where φ ( t , x ) , a ( x ) are given SSFs. Here, a x a > 0 and b , c , δ are positive constants.
We can reduce the IBVP (19) to IVP (1) in E = L 2 [ 0 , l ] with the self-adjoint positive-definite operator A x in L 2 [ 0 , l ] according to the following formula:
A z = d d x a ( x ) d v ( x ) d x + δ v ( x )
with domain D ( A x ) = { v : v , v 2 [ 0 , l ] , v ( 0 ) = b v ( 0 ) , v ( l ) = c v ( l ) } [24]. Moreover, we have the following estimates:
exp { t A x } L 2 [ 0 , l ] L 2 [ 0 , l ] 1 , t [ 0 , ) , t A x exp { t A x } L 2 [ 0 , l ] L 2 [ 0 , l ] 1 , t ( 0 , ) .
Therefore, from that and abstracting Theorem 1, we have the following:
Theorem 5.
Suppose the hypotheses below:
1. 
φ : [ d , 0 ] × 0 , l × L 2 [ 0 , l ] C 0 , l is a continuous function and
φ x ( t , . ) W 2 1 [ 0 , l ] H .
2. 
f : [ 0 , ) × 0 , l × W 2 1 [ 0 , l ] × W 2 1 [ 0 , l ] L 2 [ 0 , l ] is a bounded and continuous function, i.e.,
f ( t , . , v x , u x ) ) L 2 [ 0 , l ] H ¯
and with respect to z, the Lipschitz condition holds:
f ( t , . , v x , z x ) f ( t , . , u x , z x ) L 2 [ 0 , l ] L v x u x L 2 [ 0 , l ] ,
where L , H , H ¯ , are positive constants and L < 1 2 P d 1 2 . Then, problem (19) has a unique BS in [ 0 , ) × L 2 [ 0 , l ] .

4. Numerical Results

Generally speaking, a semi-linear equation cannot be solved precisely. Henceforth, the FSADSs for the solution of semi-linear one-dimensional DPPDE are described. The numerical results are given. Consider the IBVP
v t t , x v x x t , x = v x t , x v t 1 , x cos x v x t 1 , x sin x , t ( 0 , ) , x ( 0 , π ) , v 0 , x = sin x , x [ 0 , π ] , v t , 0 = v t , π = 0 , t [ 0 , )
for the semi-linear DPPDE. Here, · is notation of an integer function. The ES of this problem is v t , x = e t sin x .
We obtain the following iterative FADS for the approximate solution of the IBVP (24)
r v n k r v n k 1 τ r v n + 1 k 2 r v n k + r v n 1 k h 2 = r 1 v n + 1 k r 1 v n 1 k 2 h r v n k N cos x n r v n + 1 k N r v n 1 k N 2 h sin x n , t k = k τ , x n = n h , k 1 , ¯ , n 1 , M 1 ¯ , r v n 0 = sin x n , x n = n h , n 0 , M ¯ , r v 0 k = r v M k = 0 , k 0 , ¯
for the numerical solution of the semi-linear delay parabolic equation.
Here, r stands for the iteration number, 0 v n k , k 0 , N ¯ , and n 0 , M ¯ is the initial starting value. Numerically, we use the steps listed below to solve the difference scheme (25). For k 0 , N ¯ , n 0 , M ¯
  • r = 1
  • r 1 v n k is known;
  • r v n k is determined;
  • r = r + 1 is taken, and we proceed to step 2 if the maximum absolute error between r 1 v n k and r v n k is more than the specified tolerance value. If not, stop the iteration process and use r v n k as the solution to the given problem.
We write (25) in matrix form:
A r V k + B r V k 1 = R φ ( r 1 v k , r v k N ) , k 1 , N ¯ , r V 0 = sin x n n = 0 M , n 0 , M ¯ ,
Additionally, using the SADS for the AS of problem (24), we have the following SEs:
r v n k r v n k 1 τ r v n + 1 k 2 r v n k + r v n 1 k h 2 + τ r v n + 2 k 4 r v n + 1 k + 6 r v n k 4 r v n 1 k + r v n 2 k 2 h 4 = 1 2 r 1 v n + 1 k r 1 v n 1 k 2 h r v n k N cos x n r v n + 1 k N r v n 1 k N 2 h sin x n + 1 2 r 1 v n + 1 k 1 r 1 v n 1 k 1 2 h r v n k 1 N cos x n r v n + 1 k 1 N r v n 1 k 1 N 2 h sin x n τ 4 r 1 v n + 2 k r 1 v n k 2 h r v n + 1 k N cos x n + 1 r v n + 2 k N r v n k N 2 h sin x n + 1 h 2 τ 4 r 1 v n + 1 k r 1 v n 1 k 2 h 2 r v n k N cos x n + 2 r v n + 1 k N r v n 1 k N 2 h sin x n h 2 τ 4 r 1 v n k r 1 v n 2 k 2 h r v n 1 k N cos x n 1 r v n k N r v n 2 k N 2 h sin x n 1 h 2 τ 4 r v n + 2 k 1 r v n k 1 2 h r 1 v n + 1 k 1 N cos x n + 1 r 1 v n + 2 k 1 N r 1 v n k 1 N 2 h sin x n + 1 h 2 τ 4 r v n + 1 k 1 r v n 1 k 1 2 h 2 r 1 v n k 1 N cos x n + 2 r 1 v n + 1 k 1 N r 1 v n 1 k 1 N 2 h sin x n h 2 τ 4 r v n k 1 r v n 2 k 1 2 h r 1 v n 1 k 1 N cos x n 1 r 1 v n k 1 N r 1 v n 2 k 1 N 2 h sin x n 1 h 2 , t k = k τ , x n = n h , k 1 , N ¯ , n 2 , M 2 ¯ , r v n 0 = φ ( x n ) = sin x n , n 0 , M ¯ , r v 0 k = r v M k = 0 , k 0 , N ¯ , r v 3 k = 4 r v 2 k 5 r v 1 k , r v M 3 k = 4 r v M 2 k 5 r v M 1 k , k 0 , N ¯ .
We obtain again M + 1 × M + 1 SLEs, and we reformat them into matrix form (26).
Consequently, we obtain a second-order difference equation with respect to k matrix coefficients. Using (26), we can obtain this difference scheme’s solution. The initial guess in computations for both FSADSs is set as 0 v n k = e t k sin x n , and the iterative procedure is stopped when the maximum errors between two successive outcomes of the difference schemes (25) and (27) become less than 10 8 .
For various values of M and N, we provide numerical results and r v n k represents the numerical solutions of these difference schemes at t k , x n . Tables are constructed for M = N = 30 , 60, 120 in that order for t r , r + 1 , r = 0 , 1 , 2 and the errors are calculated using the following formula:
r E M N p = max p N + 1 k ( p + 1 ) N , p = 0 , 1 , 1 n M 1 v t k , x n r v n k .
To finish iteration process, we used the following condition in each sub-interval:
max p N + 1 k ( p + 1 ) N , p = 0 , 1 , 1 n M 1 r v n k r 1 v n k , < 10 8
These numerical experiments back up the theoretical claims, as shown in Table 1, Table 2, Table 3 and Table 4. With more grid points, the maximum errors and the number of iterations are reduced.
We also consider the IBVP
v t t , x v x x t , x + sin ( v t , x ) = v x t , x 2 v t 1 , x cos 2 x v x t 1 , x sin 2 x + f ( t , x ) , t ( 0 , ) , x ( 0 , π ) , v 0 , x = sin 2 x , x [ 0 , π ] , v t , 0 = v t , π , v x t , 0 = v x t , π , t [ 0 , )
for the semi-linear DPPDE. The ES of this problem is v t , x = e 4 t sin 2 x and f ( t , x ) = sin e 4 t sin 2 x .
We obtain the following FADS for the approximate solution of the IBVP (30)
r v n k r v n k 1 τ r v n + 1 k 2 r v n k + r v n 1 k h 2 = 2 r 1 v n + 1 k r 1 v n 1 k 2 h r v n k N cos 2 x n r 1 v n + 1 k r 1 v n 1 k 2 h r v n + 1 k N r v n 1 k N 2 h sin 2 x n sin r 1 v n k + f ( t k , x n ) , t k = k τ , x n = n h , k 1 , N ¯ , n 1 , M 1 ¯ , r v n 0 = sin 2 x n , x n = n h , n 0 , M ¯ , r v 0 k = r v M k , r v 1 k r r 0 k = r v M k r v M 1 k , p N + 1 k ( p + 1 ) N , p = 0 , 1 , . . .
for the numerical solution of the delay parabolic equation with nonlocal conditions.
We write (31) in matrix form:
A r V k + B r V k 1 = R r 1 θ k , k p ( N + 1 ) , ( p + 1 ) N ¯ , p = 0 , 1 , . . . , r V 0 = sin 2 x n n = 0 M ,
where
r V k = r v n k n = 0 M ,
r 1 θ n k = sin r 1 v n k + f ( t k , x n ) + 2 r 1 v n + 1 k r 1 v n 1 k 2 h r v n k N cos 2 x n r 1 v n + 1 k r 1 v n 1 k 2 h r v n + 1 k N r v n 1 k N 2 h sin 2 x n , n = 0 , . . . , M , k p ( N + 1 ) , ( p + 1 ) N ¯ , p = 0 , 1 , . . . ,
Furthermore, using the SADS for the AS of problem (30), we obtain the following SEs:
r v n k r v n k 1 τ r v n + 1 k 2 r v n k + r v n 1 k h 2 + τ r v n + 2 k 4 r v n + 1 k + 6 r v n k 4 r v n 1 k + r v n 2 k 2 h 4 1 2 r 1 v n + 1 k r 1 v n 1 k 2 h r v n k N cos 2 x n r v n + 1 k N r v n 1 k N 2 h sin 2 x n 1 2 r 1 v n + 1 k 1 r 1 v n 1 k 1 2 h r v n k 1 N cos 2 x n r v n + 1 k 1 N r v n 1 k 1 N 2 h sin 2 x n + τ 4 r 1 v n + 2 k r 1 v n k 2 h r v n + 1 k N cos 2 x n + 1 r v n + 2 k N r v n k N 2 h sin 2 x n + 1 h 2 + τ 4 r 1 v n + 1 k r 1 v n 1 k 2 h 2 r v n k N cos 2 x n + 2 r v n + 1 k N r v n 1 k N 2 h sin 2 x n h 2 + τ 4 r 1 v n k r 1 v n 2 k 2 h r v n 1 k N cos 2 x n 1 r v n k N r v n 2 k N 2 h sin 2 x n 1 h 2 + τ 4 r 1 v n + 2 k 1 r 1 v n k 1 2 h r v n + 1 k 1 N cos 2 x n + 1 r v n + 2 k 1 N r v n k 1 N 2 h sin 2 x n + 1 h 2 + τ 4 r 1 v n + 1 k 1 r 1 v n 1 k 1 2 h 2 r v n k 1 N cos 2 x n + 2 r v n + 1 k 1 N r v n 1 k 1 N 2 h sin 2 x n h 2 + τ 4 r 1 v n k 1 r 1 v n 2 k 1 2 h r v n 1 k 1 N cos 2 x n 1 r v n k 1 N r v n 2 k 1 N 2 h sin 2 x n 1 h 2 + sin r 1 v n k = f ( t k , x n ) , t k = k τ , x n = n h , k 1 , N ¯ , n 2 , M 2 ¯ , r v n 0 = sin 2 x n , 0 n M , r v 0 k = r r M k , r v 2 k + 4 r v 1 k 3 r v 0 k = 3 r v M k 4 r v M 1 k + r v M 2 k , r v 3 k + 4 r v 2 k 5 r v 1 k + 2 r v 0 k = 2 r v M k 5 r v M 1 k + 4 r v M 2 k r v M 3 k , 3 r v 4 k + 14 r v 3 k 24 r v 2 k + 18 r v 1 k 5 r v 0 k = 5 r v M k 18 r v M 1 k + 24 r v M 2 k 14 r v M 3 k + 3 r v M 4 k , k p ( N + 1 ) , ( p + 1 ) N ¯ , p = 0 , 1 ,
We obtain another M + 1 × M + 1 SLE; they are then rewritten in matrix form (32).
For a range of M and N values, we provide numerical results, and r v n k represents the numerical solutions of these difference schemes at t k , x n .  Table 3 and Table 4 are constructed for M = N = 30 , 60, 120 in that order for t r , r + 1 , r = 0 , 1 , 2 , and the errors are calculated using Formulas (28) and (29).
Table 3. Errors and number r of iterations to difference schemes (31) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
Table 3. Errors and number r of iterations to difference schemes (31) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
N = M E M N 0 r r for 0 , 1 E M N 1 r r for 1 , 2 E M N 2 r r for 2 , 3
30 2.4431 × 10 2 2 5.3731 × 10 3 9 1.0838 × 10 4 7
60 1.2259 × 10 2 2 2.5664 × 10 3 8 4.9176 × 10 5 6
120 6.1304 × 10 3 2 1.2517 × 10 3 8 2.3435 × 10 5 6
Table 4. Errors and number r of iterations to difference schemes (33) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
Table 4. Errors and number r of iterations to difference schemes (33) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
N = M E M N 0 r r for 0 , 1 E M N 1 r r for 1 , 2 E M N 2 r r for 2 , 3
30 2.0589 × 10 3 8 3.0514 × 10 4 8 1.5588 × 10 5 7
60 5.4628 × 10 4 8 7.5756 × 10 5 7 2.0085 × 10 6 5
120 1.3865 × 10 4 7 1.9241 × 10 5 6 4.8130 × 10 7 3
As we doubled the values of N and M each time, beginning with N = M = 30 , in the first-order accuracy difference schemes (25) and (31) in Table 1 and Table 3, the errors decrease roughly by a proportion of 1 / 2 , while in the second-order accuracy difference schemes (27) and (33) in Table 2 and Table 4, the errors decrease roughly by a proportion of 1 / 4 . The errors shown in the tables demonstrate the consistency of the different schemes and the reliability of the findings. Accordingly, the SADS increases more quickly than the FADS.

Author Contributions

Visualization, A.A.; Investigation, A.A.; Supervision, A.A.; data curation, A.A.; Software, S.B.M.; Validation, S.B.M.; Writing—review and editing, S.B.M.; conceptualization, S.B.M.; methodology, S.B.M.; writing—original draft, S.B.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

All required data are provided in the manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

In this manuscript, the acronyms used are as follows:
IBVPInitial Boundary Value Problem
IVPInitial Value Problem
BSBounded Solution
DEDifferential Equation
DPPDEDelay Parabolic Partial Differential Equation
SSFsSufficiently Smooth Functions
FSADSsFirst- and Second-order Accuracy Difference Schemes
ESExact Solution
FADSFirst-order Accuracy Difference Scheme
SADSSecond-order Accuracy Difference Scheme
ASApproximate Solution
SESystem of Equation
SLEsSystem of Linear Equations

References

  1. Ardito, A.; Ricciardi, P. Existence and regularity for linear delay partial differential equations. Nonlinear Anal. 1980, 4, 411–414. [Google Scholar] [CrossRef]
  2. Arino, A. Delay Differential Equations and Applications. In Proceedings of the NATO Advanced Study Institute, Marrakech, Morocco, 9–21 September 2002. [Google Scholar]
  3. Blasio, G.D. Delay differential equations with unbounded operators acting on delay terms. Nonlinear Anal. 2003, 53, 1–18. [Google Scholar] [CrossRef]
  4. Kurulay, G.; Ozbay, H. Design of first order controllers for a flexible robot arm with time delay. Appl. Comput. 2017, 16, 48–58. [Google Scholar]
  5. Lu, X. Combined iterative methods for numerical solutions of parabolic problems with time delays. Appl. Math. Comput. 1998, 89, 213–224. [Google Scholar] [CrossRef]
  6. Ashyralyev, A.; Sobolevskii, P.E. On the stability of the linear delay differential and difference equations. Abstr. Appl. Anal. 2001, 5, 267–297. [Google Scholar] [CrossRef] [Green Version]
  7. Agirseven, D. Approximate solutions of delay parabolic equations with the Dirichlet condition. Abstr. Appl. Anal. 2012, 682752. [Google Scholar] [CrossRef] [Green Version]
  8. Ashyralyev, A.; Agirseven, D.; Agarwal, R.P. Stability estimates for delay parabolic differential and difference equations. J. Comput. Appl. Math. 2020, 19, 175–204. [Google Scholar]
  9. Ashyralyev, A.; Agirseven, D.; Ceylan, B. Bounded solutions of delay nonlinear evolutionary equations. J. Comput. Appl. Math. 2017, 318, 69–78. [Google Scholar] [CrossRef]
  10. Poorkarimi, H.; Wiener, J. Bounded solutions of nonlinear parabolic equations with time delay. In Proceedings of the 15th Annual Conference of Applied Mathematics, Edmond, Oklahoma, 12–13 February 1999; pp. 87–91. [Google Scholar]
  11. Poorkarimi, H.; Wiener, J.; Shah, S.M. On the exponential growth of solutions to non-linear hyperbolic equations. Internat. Joun. Math. Sci. 1989, 12, 539–546. [Google Scholar]
  12. Poorkarimi, H.; Wiener, J. Bounded Solutions of Nonlinear Hyperbolic Equations with Delay, 1st ed.; Taylor and Francis Group: Milton Park, UK, 1987; pp. 471–478. [Google Scholar] [CrossRef]
  13. Shah, S.M.; Poorkarimi, H.; Wiener, J. Bounded solutions of retarded nonlinear hyperbolic equations. Bull. Allahabad Math. Soc. 1986, 1, 1–14. [Google Scholar]
  14. Wiener, J. Generalized Solutions of Functional Differential Equations. In Proceedings of the Wiener 1993 Generalized SO, Singapore, 1 May 1993. [Google Scholar]
  15. Podlubny, I. Fractional Differential Equations Vol. 198 of Mathematics in Science and Engineering; Academic Press: San Diego, CA, USA, 1999. [Google Scholar]
  16. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
  17. Lavoie, J.L.; Osler, T.J.; Trembly, R. Fractional derivatives and special functions. SIAM Rev. 1976, 18, 240–268. [Google Scholar] [CrossRef]
  18. Tarasov, V.E. Fractional derivative as fractional power of derivative. Int. J. Math. 2007, 18, 281–299. [Google Scholar] [CrossRef] [Green Version]
  19. El-Mesiry, A.E.M.; El-Sayed, A.M.A.; El-Saka, H.A.A. Numerical methods for multi-term fractional arbitrary orders differential equations. Appl. Math. Comput. 2005, 160, 683–699. [Google Scholar] [CrossRef]
  20. El-Sayed, A.M.A.; Gaafar, F.M. Fractional-order differential equations with memory and fractional-order relaxation-oscillation model. Pure Math. Appl. Ser. A 2001, 12, 296–310. [Google Scholar]
  21. Gorenflo, R.; Mainardi, F. Fractional calculus: Integral and differential equations of fractional order. J. Math. Phys. 2008, 223–276. [Google Scholar]
  22. Ashyralyev, A. A note on fractional derivatives and fractional powers of operators. J. Math. Anal. Appl. 2009, 357, 232–236. [Google Scholar] [CrossRef] [Green Version]
  23. Bazarov, A. On the structure of fractional spaces. In Proceedings of the XXVII All-Union Scientific Student Conference “The Student and Scientific-Technological Progress”, Novosibirsk, Russian, 20 April 1989; Gos. Univ. Novosibirsk: Novosibirsk, Russian, 1989; pp. 3–7. [Google Scholar]
  24. Ashyralyev, A.; Urun, M.; Parmaksizoglu, I. Mathematical modeling of the energy consumption problem. Bull. Karaganda Univ. Math. 2022, 105, 13–24. [Google Scholar] [CrossRef]
Table 1. Errors and number r of iterations to difference schemes (25) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
Table 1. Errors and number r of iterations to difference schemes (25) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
N = M E M N 0 r r for 0 , 1 E M N 1 r r for 1 , 2 E M N 2 r r for 2 , 3
30 6.3783 × 10 3 2 2.3464 × 10 3 3 8.6321 × 10 4 3
60 3.1279 × 10 2 2 1.1507 × 10 3 3 4.2332 × 10 4 2
120 1.5485 × 10 3 2 5.6964 × 10 4 2 2.0956 × 10 4 2
Table 2. Errors and number r of iterations to difference schemes (27) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
Table 2. Errors and number r of iterations to difference schemes (27) in t r , r + 1 , r = 0 , 1 , 2 for different steps of discreatization.
N = M E M N 0 r r for 0 , 1 E M N 1 r r for 1 , 2 E M N 2 r r for 2 , 3
30 4.5864 × 10 4 3 1.6358 × 10 4 3 5.3201 × 10 5 2
60 1.1212 × 10 4 3 4.2149 × 10 5 2 1.3581 × 10 5 2
120 4.3398 × 10 5 2 1.0698 × 10 5 2 3.4122 × 10 6 2
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

Ashyralyev, A.; Mu’azu, S.B. Bounded Solutions of Semi-Linear Parabolic Differential Equations with Unbounded Delay Terms. Mathematics 2023, 11, 3470. https://doi.org/10.3390/math11163470

AMA Style

Ashyralyev A, Mu’azu SB. Bounded Solutions of Semi-Linear Parabolic Differential Equations with Unbounded Delay Terms. Mathematics. 2023; 11(16):3470. https://doi.org/10.3390/math11163470

Chicago/Turabian Style

Ashyralyev, Allaberen, and Sa’adu Bello Mu’azu. 2023. "Bounded Solutions of Semi-Linear Parabolic Differential Equations with Unbounded Delay Terms" Mathematics 11, no. 16: 3470. https://doi.org/10.3390/math11163470

APA Style

Ashyralyev, A., & Mu’azu, S. B. (2023). Bounded Solutions of Semi-Linear Parabolic Differential Equations with Unbounded Delay Terms. Mathematics, 11(16), 3470. https://doi.org/10.3390/math11163470

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