Liénard systems and potential-Hamiltonian decomposition II - Algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Comptes rendus de l'Académie des sciences. Série I, Mathématique Année : 2007

Liénard systems and potential-Hamiltonian decomposition II - Algorithm

Résumé

We show here how to approach with an increasing precision the limit-cycles of Liénard systems, bifurcating from a stable stationary state, by contour lines of Hamiltonian systems derived from a potential-Hamiltonian decomposition of the Liénard flow. We evoke the case (non polynomial) of pure potential systems (n-switches) and pure Hamiltonian systems (2D Lotka-Volterra), and we show that, with the proposed approximation, we can deal with the case of mixed systems (van der Pol or FitzHugh-Nagumo) frequently used for modelling oscillatory systems in biology. We suggest finally that the proposed algorithm, generic for PHdecomposition, can be used for estimating the isochronal fibration in some specific cases near the pure potential or Hamiltonian systems. In a following Note, we will give applications in biology of the potential-Hamiltonian decomposition.
Fichier principal
Vignette du fichier
2007-Demongeot-C_R_Math_V344-P191.pdf (645.42 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00211817 , version 1 (23-01-2008)

Identifiants

  • HAL Id : hal-00211817 , version 1

Citer

Jacques Demongeot, Nicolas Glade, Loïc Forest. Liénard systems and potential-Hamiltonian decomposition II - Algorithm. Comptes rendus de l'Académie des sciences. Série I, Mathématique, 2007, 344, pp 191-194. ⟨hal-00211817⟩
694 Consultations
197 Téléchargements

Partager

Gmail Facebook X LinkedIn More