Monotone-iterative technique for an initial value problem for difference equations with non--instantaneous impulses
S. Hristova

TL;DR
This paper introduces a monotone iterative method for solving initial value problems involving nonlinear difference equations with non-instantaneous impulses, providing a convergent approximation scheme with explicit formulas.
Contribution
It develops a novel monotone iterative algorithm for nonlinear difference equations with non-instantaneous impulses, including explicit solution formulas and convergence proofs.
Findings
The iterative sequences converge to minimal and maximal solutions.
Explicit formulas for successive approximations are derived.
The method effectively handles impulses over finite intervals.
Abstract
In this paper a special type of difference equations is investigated. The impulses start abruptly at some points and their action continue on given finite intervals. This type of equations is used to model a real process. An algorithm, namely, the monotone iterative technique is suggested to solve the initial value problem for nonlinear difference equations with non-instantaneous impulses approximately. An important feature of our algorithm is that each successive approximation of the unknown solution is equal to the unique solution of an appropriately constructed initial value problem for a linear difference equation with with non-instantaneous impulses, and a formula for its explicit form is given. It is proved both sequences are convergent and their limits are minimal and maximal solutions of the considered problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Differential Equations Analysis · Mathematical and Theoretical Epidemiology and Ecology Models · Differential Equations and Numerical Methods
Monotone-iterative technique for an initial value problem for difference equations with non–instantaneous impulses
S. HRISTOVA a
a University of Plovdiv, 24 Tzar Asen 24, 4000 Plovdiv, Bulgaria
e-mail address: [email protected]
Abstract
In this paper a special type of difference equations is investigated. The impulses start abruptly at some points and their action continue on given finite intervals. This type of equations is used to model a real process. An algorithm, namely, the monotone iterative technique is suggested to solve the initial value problem for nonlinear difference equations with non-instantaneous impulses approximately. An important feature of our algorithm is that each successive approximation of the unknown solution is equal to the unique solution of an appropriately constructed initial value problem for a linear difference equation with with non-instantaneous impulses, and a formula for its explicit form is given. It is proved both sequences are convergent and their limits are minimal and maximal solutions of the considered problem.
Key words: difference equations, non-instantaneous impulses, lower and upper solutions, monotone-iterative technique.
2000 AMS subject classifications: 39A22, 65Q10
1 Introduction
In the real world life there are many processes and phenomena that are characterized by rapid changes in their state. In the literature there are two popular types of impulses:
instantaneous impulses- the duration of these changes is relatively short compared to the overall duration of the whole process. The model is given by impulsive differential equations (see, for example, the monographs [5], [6], [9] and the cited references therein);
- -
noninstantaneous impulses - an impulsive action, which starts at an arbitrary fixed point and remains active on a finite time interval. E. Hernandez and D. O’Regan ([4]) introduced this new class of abstract differential equations where the impulses are not instantaneous and they investigated the existence of mild and classical solutions.
One of the problems in difference equations, which unknown function is involved in the present time on both parts of the equation nonlinearly, is the the obtaining of the solution. Often it could be done in a closed frm but approximately.One of the approximate method is based on the method of upper and lower solutions, combined with a monotone-iterative technique. It is used to construct two monotonous sequences of upper and lower solutions of the nonlinear non-instantaneous impulsive difference equation. This method is applied for for difference equations in [8], [7] and for impulsive difference equations in [2].
The idea of the method is to use upper and lower solutions for initial iteration and to construct successive approximation from the corresponding non-instantaneous impulsive linear equation. These functional sequences converge monotonically to the minimal and maximal solutions of the nonlinear equation.
2 Statement of the problem
Let denote the set of all nonegative integers. Let the increasing sequence and the sequence be given. We denote and and where .
Consider the initial value problem (IVP) for the nonlinear non–instantaneous impulsive difference equation (NIDE)
[TABLE]
where , and
3 Preliminaries results
Definition 1**.**
We will say that the function is a minimal(maximal) solution of the IVP for NIDE (LABEL:EMeq1) in if it is a solution of (LABEL:EMeq1) and for any solution the inequality holds on
Definition 2**.**
The function is called lower (upper) solutions of IVP for NIDE (LABEL:EMeq1), if:
[TABLE]
Consider the linear NIDE of the type
[TABLE]
where , , , , and are given real constants.
Lemma 1**.**
The IVP for NIDE (LABEL:EMeq2) has an unique solution given by
[TABLE]
where , for ,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Proof: We will use an induction with respect to the interval. Let Then we obtain
Let Then using we get
[TABLE]
Let Then using we get
[TABLE]
Let Then
[TABLE]
Let Then we get
[TABLE]
Let Then
[TABLE]
Continue this process step by step w.r.t. the interval by induction we proves the solution of NIDE (LABEL:EMeq2) is given by (3) for all
Lemma 2**.**
Assume satisfies the inequalities
[TABLE]
where Q_{n}>0\Big{(}n\in\bigcup_{k=0}^{p}I_{k}\Big{)}, \ T_{k}>0\Big{(}k\in\mathbb{Z}[1,p]\Big{)} and L_{n}>0,\ M_{n}<1\Big{(}n\in\bigcup_{k=0}^{p}J_{k}\Big{)}.
Then for every
The proof is based on an induction w.r.t. the interval and we omit it.
4 Main results
For any pair of function such that for we define the sets
[TABLE]
Theorem 1**.**
Let the following conditions be fulfilled:
The functions are lower and upper solutions of the IVP for NIDE (LABEL:EMeq1) and for . 2. 2.
The function is continuous in its second and third arguments and there exist functions and such that for any and with and with the inequality
[TABLE]
holds. 3. 3.
The function is continuous in its second argument and there exists a function such that for any and with
[TABLE] 4. 4.
The function is continuous in its second and third arguments and there exist functions and such that for any and with and with the inequality
[TABLE]
holds.
Then there exist two sequences of discrete functions and , with and such that:
a) The sequences are nondecreasing and nonincreasing, respectively and
[TABLE]
b) The functions and are lower and upper solutions of the IVP for NIDE (LABEL:EMeq1), respectively;
c) Both sequences are convergent on ;
d) The limits are the minimal and maximal solutions of IVP for NIDE (LABEL:EMeq1) in respectively;
e) If IVP for NIDE (LABEL:EMeq1) has an unique solution , then for
Proof: For any arbitrary fixed function we consider the IVP for the linear NIDE
[TABLE]
where and
[TABLE]
According to Lemma 1 the IVP for linear NIDE (LABEL:EMeq3) has an unique solution given by (3) with , , , .
For any function we define the operator by where is the unique solution of IVP for the linear NIDE (LABEL:EMeq3) for the function The operator has the following properties:
(P1) ,
(P2) is a monotone nondecreasing operator in
To prove (P1) set where is the unique solution of (LABEL:EMeq3) with and let
For any we obtain the inequality
[TABLE]
Hence the inequality holds for
For any we obtain
[TABLE]
For any we get
[TABLE]
Therefore, the function satisfies the inequalities (8) with , . According to Lemma 2 the function is non-positive in i.e. Analogously it can be proved that the inequality holds.
To prove (P2) we consider two arbitrary function such that for Let and Denote
For any we obtain the inequality
[TABLE]
Hence the inequality holds for
For any we get
[TABLE]
For any we obtain
[TABLE]
According to Lemma 2 with the function i.e. for
Let be a lower solution of (LABEL:EMeq1). We consider the function According to the proved
For any we get the inequality
[TABLE]
For any we obtain
[TABLE]
For any we obtain
[TABLE]
Inequalities (11),(12) and (13) prove the function is a lower solution of NIDE (LABEL:EMeq1). Similarly, if is an upper solution of NIDE (LABEL:EMeq1) then the function is an upper solution of (LABEL:EMeq1).
We define the sequences of functions and by the equalities . The functions and satisfy the initial value problem (LABEL:EMeq3) with and , respecticely.
According to Lemma 2 the following representations are valid:
[TABLE]
where is given by (5) for and is given by (7) for .
[TABLE]
where is given by (5) for and is given by (7) for .
According to the above proved, functions and are lower and upper solutions of NIDE (LABEL:EMeq1), respectively and they satisfy for the following inequalities
[TABLE]
Both sequences of discrete functions being monotonic and bounded are convergent on
Let
Take a limit in (LABEL:EMsolll2) for we obtain (3) with
[TABLE]
where is given by (5) for and is given by (7) for .
From (LABEL:EMminsol) it follows the function is a solution of NIDE (LABEL:EMeq1).
Similarly, we prove the function is a solution of NIDE (LABEL:EMeq1).
Let be a solution of IVP for NIDE (LABEL:EMeq1). From inequalities (16) it follows there exists a natural number p such that
[TABLE]
We introduce the notation
For any we get the inequality
[TABLE]
Hence the inequality holds for
For any we obtain
[TABLE]
For any we obtain
[TABLE]
According to Lemma 2 with the function is nonpositive, i.e. Similarly and hence Since this proves by induction that for every
Taking the limit as we conclude Hence and are minimal and maximal solutions of IVP for NIDE (LABEL:EMeq1), respectively.
Let the IVP for NIDE (LABEL:EMeq1) has an unique solution
Then from above it follows
5 Conclusions
An algorithm for approximate solving an initial value problem for a nonlinear difference equations with non-instantaneous impulses is given and theoretically studied. It is based on the application of the method of lower and upper solutions. The suggested algoritm is appropriate for computerized and easy application to study discrete dynamical models.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. P. Agarwal, Difference equations and inequalities , Singapore, National University of Singapore, 2000.
- 2[2] R. P. Agarwal, S. Hristova, A. Golev, K. Stefanova, Monotone-iterative method for mixed boundary value problems for generalized difference equations with “maxima”, J. Appl. Math. Comput. 43 , 1, (2013) 213–-233.
- 3[3] S. Elaydi, An introduction to difference equations , San Antonio, Dept. Math., Trinity University, 2005.
- 4[4] E. Hernandez, D. O’Regan, On a new class of abstract impulsive differential equations, Proc. Amer. Math. Soc. , 141 , (2013), 1641–1649.
- 5[5] S. Hristova, Qualitative inestigations and approximate methods for impulsive equations , Nova Sci. Publ. Inc., New York, 2009.
- 6[6] V. Lakshmikantham, D.D. Bainov, P.S. Simeonov, Theory of Impulsive Differential Equations , World Scientific, Singapore, 1989.
- 7[7] C. V. Pao, Monotone iterative methods for finite difference system of reaction-diffusion equations, Numerische Math. , 46 , 4, (1985) 571–-586.
- 8[8] P.Y.H. Pang, R.P. Agarwal , Monotone iterative methods for a general class of discrete boundary value problems, Comput. Math. Appl. , 28 , 1–3, (1994), 243–254.
