Complexity reduction of C-Algorithm


The C-Algorithm introduced in [5] 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… (More)
DOI: 10.1016/j.amc.2011.02.023


1 Figure or Table

Cite this paper

@article{Bardet2011ComplexityRO, title={Complexity reduction of C-Algorithm}, author={Magali Bardet and Islam Boussaada}, journal={Applied Mathematics and Computation}, year={2011}, volume={217}, pages={7318-7323} }