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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0005109821002016-main-2.pdf
solo utenti autorizzati
Tipologia:
Versione Editoriale (PDF)
Licenza:
Copyright dell'editore
Dimensione
521.78 kB
Formato
Adobe PDF
|
521.78 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
