C-算法的复杂度降低
Complexity reduction of C-algorithm
摘要：
在[Chouikha 2007]中引入的C-算法被设计用于在一般实解析情况下确定Lienard型微分系统的等值线中心。然而，它有一个大的复杂性，防止计算，即使在四次多项式的情况下。本文的主要成果是一个有效的算法实现的C-算法，称为ReCA（减少C-算法）。此外，在理性的情况下，它提出了一个适应的版本。它被称为RCA（有理C-算法），并广泛用于[BardetBoussaadaChouikhaStrelcyn 2010]和[BoussaadaChouikhaStrelcyn 2010]，以找到Liénard型方程的许多新的等距中心的例子。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
