Complexity reduction of C-algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Applied Mathematics and Computation Année : 2011

Complexity reduction of C-algorithm

Résumé

The C-Algorithm introduced in [Chouikha2007] is designed to determine isochronous centers for Lienard-type differential systems, in the general real analytic case. However, it has a large complexity that prevents computations, even in the quartic polynomial case. The main result of this paper is an efficient algorithmic implementation of C-Algorithm, called ReCA (Reduced C-Algorithm). Moreover, an adapted version of it is proposed in the rational case. It is called RCA (Rational C-Algorithm) and is widely used in [BardetBoussaadaChouikhaStrelcyn2010] and [BoussaadaChouikhaStrelcyn2010] to find many new examples of isochronous centers for the Liénard type equation.

Dates et versions

hal-00919638 , version 1 (17-12-2013)

Identifiants

Citer

Magali Bardet, Islam Boussaada. Complexity reduction of C-algorithm. Applied Mathematics and Computation, 2011, 217 (17), pp.7318-7323. ⟨10.1016/j.amc.2011.02.023⟩. ⟨hal-00919638⟩
166 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More