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.

Menini, L., Possieri, C., Tornambe', A. (2021). A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial. AUTOMATICA, 131 [10.1016/j.automatica.2021.109681].

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

Menini L.;Possieri C.;Tornambe' A.
2021-01-01

Abstract

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.
2021
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore ING-INF/04 - AUTOMATICA
English
Convergence of numerical methods
Lyapunov stability
Polynomial methods
Roots
Menini, L., Possieri, C., Tornambe', A. (2021). A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial. AUTOMATICA, 131 [10.1016/j.automatica.2021.109681].
Menini, L; Possieri, C; Tornambe', A
Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/294484
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact