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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automatica (Oxford) Jg. 131; S. 109681
Hauptverfasser: Menini, Laura, Possieri, Corrado, Tornambè, Antonio
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.09.2021
Schlagworte:
Convergence of numerical methods
Lyapunov stability
Polynomial methods
Roots
Polynomial methods
Lyapunov stability
Convergence of numerical methods
Roots
ISSN:0005-1098, 1873-2836
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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