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žené v:

Podrobná bibliografia
Vydané v:	Automatica (Oxford) Ročník 131; s. 109681
Hlavní autori:	Menini, Laura, Possieri, Corrado, Tornambè, Antonio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.09.2021
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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