Complexity reduction of C-algorithm
From MaRDI portal
Abstract: 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.
Recommendations
- A new method to determine isochronous center conditions for polynomial differential systems.
- Algorithmic derivation of isochronicity conditions
- The centre and isochronicity problems for some cubic systems
- Generalized isochronous centers for complex systems
- scientific article; zbMATH DE number 770128
Cites work
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Isochronicity conditions for some planar polynomial systems
- Isochronicity conditions for some planar polynomial systems. II.
- Isochronicity of analytic systems via Urabe's criterion
- Isochronous centers of Lienard type equations and applications
- Linearizability conditions for a cubic system
- Linearizability conditions of time-reversible cubic systems
- Linearizability conditions of time-reversible quartic systems having homogeneous nonlinearities
- NIST handbook of mathematical functions
- On the period function of \(x^{\prime\prime}+f(x)x^{\prime2}+g(x)=0\)
- Qualitative theory of planar differential systems
- The Center and Cyclicity Problems
Cited in
(3)
This page was built for publication: Complexity reduction of C-algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531656)