How to find initial data generating bounded solutions of discrete equations

Hlavičková, Irena

doi:10.2478/v10127-011-0008-2

Abstract

This contribution concerns the asymptotic behavior of solutions of a first-order difference equation. We are looking for a solution whose graph stays in a given domain. It is supposed that all the boundary points of this domain are the so called points of strict egress. Under this supposition, it has been already proved that the existence of at least one solution the graph of which stays in the given domain is guaranteed. The main aim of this article is to find the concrete value of the initial condition which generates such a solution. The method we introduce resembles the well-known bisection method for finding roots of equations.

References

[1] AGARWAL, R. P.: Difference Equations and Inequalities, Theory, Methods, and Appli- cations (2nd ed.), Marcel Dekker, New York, 2000.10.1201/9781420027020
Search in Google Scholar
[2] BAˇ STINEC, J.-DIBL´IK, J.: Asymptotic formulae for a particular solution of linear nonhomogeneous discrete equations, Comput. Math. Appl. 45 (2003), 1163-1169.10.1016/S0898-1221(03)00077-4
Search in Google Scholar
[3] BAˇ STINEC, J.-DIBL´IK, J.-R°U ˇ Z I ˇC KOV´A, M.: Initial data generating bounded solu- tions of linear discrete equations, Opuscula Math. 26 (2006), 395-406.
Search in Google Scholar
[4] DIBL´IK, J.: Discrete retract principle for systems of discrete equations, Comput. Math. Appl. 42 (2001), 515-528.10.1016/S0898-1221(01)00174-2
Search in Google Scholar
[5] DIBL´IK, J.: Anti-Lyapunov method for systems of discrete equations, Nonlinear Anal. 57 (2004), 1043-1057.10.1016/j.na.2004.03.030
Search in Google Scholar
[6] DIBL´IK, J.: Asymptotic behaviour of solutions of discrete equations, Funct. Differ. Equ. 11 (2004), 37-48.
Search in Google Scholar
[7] DIBL´IK, J.-MIGDA, M.-SCHMEIDEL, E.: Bounded solutions of nonlinear discrete equations, Nonlinear Anal. 65 (2006), 845-853.10.1016/j.na.2005.10.014
Search in Google Scholar
[8] DIBL´IK, J.-R°U ˇ Z I ˇC KOV´A , M.-V´ACLAV´IKOV´A, B.: A retract principle on discrete time scales, Opuscula Math. 26 (2006), 445-455.
Search in Google Scholar
[9] DIBL´IK, J.-R°U ˇZ I ˇC KOV´A, I.-R°U ˇZ I ˇC KOV´A, M.: A general version of the retract method for discrete equations, Acta Math. Sin. (Engl. Ser.) 23 (2007), 341-348.10.1007/s10114-005-0729-8
Search in Google Scholar
[10] DIBL´IK, J.-HLAVIˇC KOV´A, I.: Combination of Liapunov and retract methods in the investigation of the asymptotic behavior of solutions of systems of discrete equations, Dynam. Systems Appl. 18 (2009), 507-537.
Search in Google Scholar
[11] DIBL´IK, J.-R°U ˇZ I ˇC KOV´A, M.-ˇSMARDA, Z.: Wa˙zewski’s method for systems of dy- namic equations on time scales, Nonlinear Anal. 71 (2009), 1124-1131.10.1016/j.na.2009.01.098
Search in Google Scholar
[12] HLAVIˇC KOV´A, I.: Bisection method for finding initial data generating bounded solutions of discrete equations, Aplimat - J. Appl. Math. 3 (2010), 99-105.
Search in Google Scholar
[13] WA˙ZEWSKI, T.: Sur un principe topologique de l’examen de l’allure asymptotique des int´egrales des ´equations diff´erentielles ordinaires, Ann. Soc. Polon. Math. 20 (1948), 279-313.
Search in Google Scholar

How to find initial data generating bounded solutions of discrete equations

Abstract

Paradigm

My account