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

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Automatica (Oxford) Ročník 131; s. 109681
Hlavní autoři: Menini, Laura, Possieri, Corrado, Tornambè, Antonio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.09.2021
Témata:
Convergence of numerical methods
Lyapunov stability
Polynomial methods
Roots
Polynomial methods
Lyapunov stability
Convergence of numerical methods
Roots
ISSN:0005-1098, 1873-2836
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2021.109681