4.7 Article

A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial

期刊

AUTOMATICA
卷 131, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2021.109681

关键词

Roots; Polynomial methods; Convergence of numerical methods; Lyapunov stability

资金

  1. Italian Ministry for Research
  2. Program for Research Projects of National Interest (PRIN) [2017YKXYXJ]

向作者/读者索取更多资源

The technical communique proposes a locally convergent continuous-time model for the Durand-Kerner method to determine all roots of a time-varying polynomial simultaneously. The effectiveness of this method is demonstrated through its application to a benchmark example.
In this technical communique, a locally convergent continuous-time model for the Durand-Kerner method is proposed to simultaneously determine all the roots of a time-varying polynomial. The effectiveness of this method is demonstrated through its application to a benchmark example. (C) 2021 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据