.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Qualitative theory
Ordinary differential equations
Planar systems
Isochronous centers
Urabe function
Polynomial Lienard type systems
Computer algebra
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
.png){kind=icon}
