Global attractivity for a logistic equation with piecewise constant argument
✍ Scribed by Hideaki Matsunaga; Tadayuki Hara; Sadahisa Sakata
- Publisher
- SP Birkhäuser Verlag Basel
- Year
- 2001
- Tongue
- English
- Weight
- 117 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1021-9722
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we consider the reaction-diffusion equation with piecewise constant argument on a finite domain, with r, E, D > 0. By employing the method of sub-and super-solutions we prove that, under the condition E < r(1 -exp(-r)), all solutions with positive initial data converge to the positiv
Consider the following nonautonomous differential equation with a piecewise constant delay: In this paper, using a recent result of a full affirmative answer to the Gopalsamy and Liu's conjecture for the autonomous case of the above equation with a(t) ≡ a ≥ 0 and b(t) ≡ b > 0, we derive three types
Consider the nonautonomous delay logistic difference equation /kyn=pnyn(1--Yn~k'-"--~"), n=0,1 ..... (1.1) where {Pn}n>\_o is a sequence of nonnegative real numbers, {kn}n>\_o is a sequence of positive integers, {n -kn) is nondecreasing, limn--.co(n -kn) --vo, and ,k is a positive constant. We obta
## Communicated by D. G. M. Anderson Abstract--ln this paper, a necessary and sufficient condition for the global attractivity of the trivial solution of a delay equation with continuous and piecewise constant arguments is obtained.