×

Neutral delay differential equations with positive and negative coefficients. (English) Zbl 0618.34063

Consider the neutral delay differential equation \[ (1)\quad \frac{d}{dt}[y(t)+py(t-\tau)]+q_ 1y(t-\sigma _ 2)-q_ 2y(t-\sigma _ 2)=0 \] where \[ (2)\quad p\in R-\{0\},\quad q_ 1,q_ 2\in (0,\infty),\quad \tau \in (0,\infty),\quad \sigma _ 1,\sigma _ 2\in [0,\infty). \] We study the asymptotic behavior of the nonoscillatory solutions of (1) and we obtain sufficient conditions for the oscillation of all solutions, all bounded solutions, and all unbounded solutions of (1).

MSC:

34K99 Functional-differential equations (including equations with delayed, advanced or state-dependent argument)
34C10 Oscillation theory, zeros, disconjugacy and comparison theory for ordinary differential equations
34K25 Asymptotic theory of functional-differential equations
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] DOI: 10.1137/0518005 · Zbl 0566.34053
[2] Bellman R., Differential-Difference Equations (1963) · Zbl 0105.06402
[3] DOI: 10.1016/0022-247X(67)90191-6 · Zbl 0155.47302
[4] DOI: 10.1016/0362-546X(84)90066-X · Zbl 0553.34042
[5] DOI: 10.1016/0022-247X(86)90172-1 · Zbl 0566.34056
[6] DOI: 10.1080/00036818608839602 · Zbl 0566.34057
[7] Hale J., Theory of Functional Differential Equations (1977) · Zbl 0352.34001
[8] Ladas, G. and Sficas, Y.G. 1984. Oscillations of delay differential equations with positive and negative coefficients. Proc. of the International Conf. on Qualitative Theory of Differential Equations held at the University of Alberta. 1984.
[9] DOI: 10.4153/CMB-1986-069-2 · Zbl 0566.34054
[10] Ladas G., Funkcial. Ekvac 25 pp 105– (1982)
[11] Ladas G., J. Math. Phys. Sci 18 pp 244– (1984)
[12] Onose H., Funkcial. Ekvac. 26 pp 189– (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.