Liénard systems and potential-Hamiltonian decomposition. II: Algorithm (Q868973)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Liénard systems and potential-Hamiltonian decomposition. II: Algorithm |
scientific article; zbMATH DE number 5129808
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Liénard systems and potential-Hamiltonian decomposition. II: Algorithm |
scientific article; zbMATH DE number 5129808 |
Statements
Liénard systems and potential-Hamiltonian decomposition. II: Algorithm (English)
0 references
26 February 2007
0 references
The authors propose a method for choosing a decomposition of a system of ordinary differential equations on the plane that models a biological phenomenon into the sum of a gradient and a Hamiltonian vector field. The division of parameters appearing in separate parts then elucidates the roles that they play in the underlying biological system. For part I see: ibid., No. 2, 121-126 (2007; Zbl 1111.37011). For part III see: ibid., No. 4, 253--258 (2007; Zbl 1111.37012).
0 references
potential-Hamiltonian decomposition
0 references
planar vector fields
0 references
biological system
0 references
0 references
0.95445585
0 references
0.93681335
0 references
0.8857065
0 references
0.8598754
0 references
0.8597131
0 references
0.8569065
0 references
0.85498446
0 references