A minimax method for a class of Hamiltonian systems with singular potentials. (English) Zbl 0681.70018

Summary: This paper presents a minimax method which gives existence and multiplicity results for time periodic solutions of a class of Hamiltonian systems when a singular potential is present. The singularity satisfies the strong force condition of Gordon. When milder singularities are permitted a notion of generalized T-periodic solution is introduced and we get existence and multiplicity results for such solutions.


70H05 Hamilton’s equations
37-XX Dynamical systems and ergodic theory
Full Text: DOI


[1] {\scA. Ambrosetti and V. Coti-Zelati}, Critical points with lack of compactness and applications to singular dynamical systems, preprint. · Zbl 0642.58017
[2] Ambrosetti, A; Coti-Zelati, V, Periodic solutions of singular dynamical systems, (), 1-10 · Zbl 0757.70007
[3] {\scV. Coti-Zelati}, Morse theory and periodic solutions of Hamiltonian systems, preprint, SISSA, Trieste. · Zbl 0652.34053
[4] Degiovanni, M; Giannoni, F; Marino, A, Periodic solutions of dynamical systems with Newtonian type potentials, (), 111-115
[5] {\scC. Greco}, Periodic solutions of a class of singular Hamiltonian systems, Nonlinear Anal., in press. · Zbl 0648.34048
[6] Greco, C, Remarks on periodic solutions for some dynamical systems with singularities, (), 169-173
[7] Gordon, W.B, Conservative dynamical systems involving strong forces, Trans. amer. math. soc., 204, 113-135, (1975) · Zbl 0276.58005
[8] McGehee, R, Double collisions for a classical particle system with nongravitational interactions, Comment. math. helv., 56, 524-557, (1981) · Zbl 0498.70015
[9] Rabinowitz, P.H, Minimax methods in critical point theory with applictions to differential equations, ()
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.