The Liénard equation has at least n periodic when F(x) = ∏ (i=1...n) (x^2-i^2)
L'équation de Liénard a au moins n solutions périodiques lorsque F(x) = ∏ (i=1...n) (x^2-i^2)
Résumé
The Liénard equation is a subject that has occupied mathematicians for almost a century. In spite of this, we are still dealing with the same rare examples, including that of the Van der Pol equation. Mathematicians are lacking a wide collection of cases from which to test or draw some hypotheses.
We present algorithms that make it very easy to botanize many new specimens. This should energize the subject.
The usual approach used for the search for periodic solutions is that of analysis. In general it deals only with the existence of periodic solutions very close to the origin for functions containing a very small forced oscillation.
We deal with functions without forced oscillation and identify and locate periodic solutions at even very long distances from the origin.
The tools of analysis that are usually used require the mastery of elaborate techniques and it is not easy to make the link between the analytical results and the appearance of the trajectories.
We use elementary mathematical tools and a geometric approach completely in symbiosis with the appearance of trajectories.
The numerical search methods for periodic solutions do not allow us to know whether we have explored sufficiently far from the origin or limit the time of calculation to the strict necessary.
We give a method to determine very simply, for a very wide range of functions, the bounded space in which all the periodic solutions are located.
The Grail underlying the study of the Liénard equation is that of the resolution of the 16th Hilbert problem.
We have not solved it however we show that the number of periodic solutions is at least (degree F(x)-1)/2
Domaines
Systèmes dynamiques [math.DS]
Origine : Fichiers produits par l'(les) auteur(s)