Back to Search
Start Over
Complexity reduction of C-Algorithm
- Source :
-
Applied Mathematics & Computation . May2011, Vol. 217 Issue 17, p7318-7323. 6p. - Publication Year :
- 2011
-
Abstract
- Abstract: The C-Algorithm introduced in 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 to find many new examples of isochronous centers for the Liénard type equation. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 217
- Issue :
- 17
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 59454448
- Full Text :
- https://doi.org/10.1016/j.amc.2011.02.023