×

Periodic solutions of a nonlinear \(n\)-th order vector differential equation. (English) Zbl 0212.11601


MSC:

34C25 Periodic solutions to ordinary differential equations
34A34 Nonlinear ordinary differential equations and systems
Full Text: DOI

References:

[1] J. Mawhin,An extension of a theorem of A. C. Lazer on forced nonlinear oscillations, Rapport Nr.35 (1970) Sém. math. appl. méc. Univ. Cath. de Louvain. · Zbl 0213.10804
[2] R. Reissig,Anwendung von Fixpunktsätzen auf das Problem der periodischen Lösungen bei nicht-autonomen Systemen. Deutsche Luft-und Raumfahrt, Forschungsbericht 69-53, Oktober 1969.
[3] Reissig, R., On the existence of periodic solutions of a certain non-autonomous differential equation, Ann. Mat. Pura Appl. (IV), 85, 235-240 (1970) · Zbl 0195.38203
[4] Schaefer, H., Über die Methode der a priori-Schranken, Math. Annalen, 129, 415-416 (1955) · Zbl 0064.35703 · doi:10.1007/BF01362380
[5] Sedziwy, S., Asymptotic properties of solutions of a certain n-th order vector differential equation, Acc. Naz. Lincei, Rend. Cl. Sci. fis. mat. nat. (VIII), 47, 472-475 (1969) · Zbl 0217.12003
[6] Reissig, R.; Sansone, G.; Conti, R., Qualitative Theorie nichtlinearer Differentialgleichungen (1963), Roma: Edizioni Cremonese, Roma · Zbl 0114.04302
[7] Reissig, R.; Sansone, G.; Conti, R., Nichtlineare Differentialgleichungen höherer Ordnung (1969), Roma: Edizioni Cremonese, Roma · Zbl 0172.10801
[8] Sansone, G.; Conti, R.; Diamond, A. H., Non-linear Differential Equations (1964), Oxford: Pergamon Press, Oxford · Zbl 0128.08403
[9] T. Yoshizawa,Stability Theory by Liapunov’s Second Method. The Mathematical Society of Japan 1966. · Zbl 0144.10802
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.