Complexity reduction of C-algorithm

Details Complexity reduction of C-algorithm Complexity reduction of C-algorithm

2010-07-21

arxiv.org/abs/1007.3653v2

Mathematics

Classical Analysis and ODEs

Scientific paper

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\'enard type equation.

Affiliated with

Also associated with

No associations

Rating

Complexity reduction of C-algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity reduction of C-algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity reduction of C-algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183994