.png){kind=icon}
Return
Complexity reduction of C-Algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2011.02.023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 (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 [1,2] to find many new examples of isochronous centers for the Lienard type equation. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Qualitative theory
Ordinary differential equations
Planar systems
Isochronous centers
Urabe function
Polynomial Lienard type systems
Computer algebra
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSave