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:
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!
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.
AbstractList 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.
ArticleNumber 109681
Author Tornambè, Antonio
Menini, Laura
Possieri, Corrado
Author_xml – sequence: 1
  givenname: Laura
  surname: Menini
  fullname: Menini, Laura
  email: laura.menini@uniroma2.it
  organization: Dipartimento di Ingegneria Civile e Ingegneria Informatica, Università di Roma Tor Vergata, 00133, Roma, Italy
– sequence: 2
  givenname: Corrado
  surname: Possieri
  fullname: Possieri, Corrado
  email: corrado.possieri@iasi.cnr.it
  organization: Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”, Consiglio Nazionale delle Ricerche (IASI-CNR), 00185 Roma, Italy
– sequence: 3
  givenname: Antonio
  surname: Tornambè
  fullname: Tornambè, Antonio
  email: tornambe@disp.uniroma2.it
  organization: Dipartimento di Ingegneria Civile e Ingegneria Informatica, Università di Roma Tor Vergata, 00133, Roma, Italy
BookMark eNqFkN1qAjEQhUOxULV9h7zA2vy4MXtppX8g9Ka9DrPZRCPZRJIo-PbdxUIvvZqZM3OGwzdDkxCDQQhTsqCEiufDAk4l9lCchgUjjA5yIyS9Q1MqV7xikosJmhJC6mrYyAc0y_kwjEsq2RTBGvuowfsL1jGcTdqZUMa2uHCKp1wV1xsMfheTK_sel4itC92geFz2BqcYS8bRYsDjZXWGdHFhh4_RX0LsHfhHdG_BZ_P0V-fo5-31e_NRbb_ePzfrbaWZ4KUCuRSmpVxb3da1BiEFA1PzpmGd7KjVsATaMuDSwqqVQtfUtrUgjenamrOWz5G8_tUp5pyMVcfk-iGOokSNqNRB_aNSIyp1RTVYX65WM-Q7O5NU1s4EbTqXjC6qi-72k1_qKnwD
Cites_doi 10.1016/j.automatica.2019.01.003
10.1016/j.automatica.2017.12.021
10.1006/jmaa.1999.6453
10.1007/s11075-015-0088-1
10.1109/TAC.2015.2449811
10.1080/00036819908840791
10.1007/BF02162564
10.1109/T-AIEE.1950.5060121
10.1007/s11075-010-9410-0
10.1016/0167-6911(91)90116-V
10.1080/01630560008816971
ContentType Journal Article
Copyright 2021 Elsevier Ltd
Copyright_xml – notice: 2021 Elsevier Ltd
DBID AAYXX
CITATION
DOI 10.1016/j.automatica.2021.109681
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1873-2836
ExternalDocumentID 10_1016_j_automatica_2021_109681
S0005109821002016
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
23N
3R3
4.4
457
4G.
5GY
5VS
6TJ
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABDEX
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACBEA
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ADBBV
ADEZE
ADIYS
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHPGS
AI.
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
K-O
KOM
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SST
SSZ
T5K
T9H
TAE
TN5
VH1
WH7
WUQ
X6Y
XFK
XPP
ZMT
~G-
77I
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABUFD
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c263t-a846eb13cfcb55ca6862ae53992d8d1fca4a1b2a38fa7b86c51fb5609edb532b3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000675832700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0005-1098
IngestDate Sat Nov 29 06:57:16 EST 2025
Fri Feb 23 02:42:24 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Polynomial methods
Lyapunov stability
Convergence of numerical methods
Roots
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c263t-a846eb13cfcb55ca6862ae53992d8d1fca4a1b2a38fa7b86c51fb5609edb532b3
ParticipantIDs crossref_primary_10_1016_j_automatica_2021_109681
elsevier_sciencedirect_doi_10_1016_j_automatica_2021_109681
PublicationCentury 2000
PublicationDate September 2021
2021-09-00
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: September 2021
PublicationDecade 2020
PublicationTitle Automatica (Oxford)
PublicationYear 2021
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Evans (b6) 1950; 69
Helmke, Moore (b9) 2012
Riaza, Zufiria (b20) 1999; 236
Durand (b4) 1961
Butcher, Goodwin (b2) 2008
Eberly (b5) 2006
Muehlebach, Jordan (b16) 2019
Nicosia, Tornambe, Valigi (b18) 1991; 16
Menini, Possieri, Tornambe (b15) 2019; 104
Saupe (b21) 1988
Schropp, Singer (b22) 2000; 21
Menini, Possieri, Tornambe (b14) 2018; 89
Macdonald (b13) 1998
Zhang, Xiao, Ruan, Li (b24) 2011; 57
Kovesi (b12) 2003; 2003
Airapetyan (b1) 1999; 73
Jin, Zhang (b10) 2016; 73
Franca, Robinson, Vidal (b7) 2018
Kerner (b11) 1966; 8
Cox, Little, O’Shea (b3) 2015
Varagnolo, Zanella, Cenedese, Pillonetto, Schenato (b23) 2015; 61
Fritzsche, Grauert (b8) 2012
Nedialkov (b17) 2006
Parusinski, Rainer (b19) 2016; 16
Riaza (10.1016/j.automatica.2021.109681_b20) 1999; 236
Fritzsche (10.1016/j.automatica.2021.109681_b8) 2012
Nedialkov (10.1016/j.automatica.2021.109681_b17) 2006
Franca (10.1016/j.automatica.2021.109681_b7) 2018
Helmke (10.1016/j.automatica.2021.109681_b9) 2012
Muehlebach (10.1016/j.automatica.2021.109681_b16) 2019
Menini (10.1016/j.automatica.2021.109681_b15) 2019; 104
Nicosia (10.1016/j.automatica.2021.109681_b18) 1991; 16
Durand (10.1016/j.automatica.2021.109681_b4) 1961
Jin (10.1016/j.automatica.2021.109681_b10) 2016; 73
Macdonald (10.1016/j.automatica.2021.109681_b13) 1998
Kerner (10.1016/j.automatica.2021.109681_b11) 1966; 8
Airapetyan (10.1016/j.automatica.2021.109681_b1) 1999; 73
Butcher (10.1016/j.automatica.2021.109681_b2) 2008
Menini (10.1016/j.automatica.2021.109681_b14) 2018; 89
Zhang (10.1016/j.automatica.2021.109681_b24) 2011; 57
Eberly (10.1016/j.automatica.2021.109681_b5) 2006
Evans (10.1016/j.automatica.2021.109681_b6) 1950; 69
Saupe (10.1016/j.automatica.2021.109681_b21) 1988
Varagnolo (10.1016/j.automatica.2021.109681_b23) 2015; 61
Cox (10.1016/j.automatica.2021.109681_b3) 2015
Kovesi (10.1016/j.automatica.2021.109681_b12) 2003; 2003
Parusinski (10.1016/j.automatica.2021.109681_b19) 2016; 16
Schropp (10.1016/j.automatica.2021.109681_b22) 2000; 21
References_xml – year: 2019
  ident: b16
  article-title: A dynamical systems perspective on nesterov acceleration
– year: 2008
  ident: b2
  article-title: Numerical methods for ordinary differential equations
– start-page: 4
  year: 2006
  ident: b17
  article-title: Interval tools for ODEs and DAEs
  publication-title: 12th GAMM-IMACS international symposium on scientific computing, computer arithmetic and validated numerics
– volume: 73
  start-page: 115
  year: 2016
  end-page: 140
  ident: b10
  article-title: Continuous and discrete zhang dynamics for real-time varying nonlinear optimization
  publication-title: Numerical Algorithms
– year: 1998
  ident: b13
  article-title: Symmetric functions and Hall polynomials
– volume: 21
  start-page: 537
  year: 2000
  end-page: 551
  ident: b22
  article-title: A dynamical systems approach to constrained minimization
  publication-title: Numerical functional analysis and optimization
– year: 2015
  ident: b3
  article-title: Ideals, varieties, and algorithms
– start-page: 59
  year: 1988
  end-page: 80
  ident: b21
  article-title: Discrete versus continuous Newton’s method: a case study
  publication-title: Newton’s method and dynamical systems
– volume: 236
  start-page: 438
  year: 1999
  end-page: 462
  ident: b20
  article-title: Weak singularities and the continuous Newton method
  publication-title: Journal of Mathematical Analysis and Applications
– start-page: 1554
  year: 2018
  end-page: 1562
  ident: b7
  article-title: ADMM and accelerated ADMM as continuous dynamical systems
  publication-title: International conference on machine learning
– volume: 89
  start-page: 411
  year: 2018
  end-page: 414
  ident: b14
  article-title: A Newton-like algorithm to compute the inverse of a nonlinear map that converges in finite time
  publication-title: Automatica
– volume: 104
  start-page: 228
  year: 2019
  end-page: 232
  ident: b15
  article-title: Newton-Like algorithms for the inversion of switched maps
  publication-title: Automatica
– volume: 73
  start-page: 463
  year: 1999
  end-page: 484
  ident: b1
  article-title: Continuous Newton method and its modification
  publication-title: Applicable Analysis
– year: 2012
  ident: b9
  article-title: Optimization and dynamical systems
– volume: 61
  start-page: 994
  year: 2015
  end-page: 1009
  ident: b23
  article-title: Newton-Raphson consensus for distributed convex optimization
  publication-title: IEEE Transactions on Automatic Control
– volume: 16
  start-page: 481
  year: 2016
  end-page: 517
  ident: b19
  article-title: Regularity of roots of polynomials
  publication-title: Annali della Scuola Normale Superiore di Pisa. Classe di scienze
– volume: 57
  start-page: 35
  year: 2011
  end-page: 51
  ident: b24
  article-title: Continuous and discrete time zhang dynamics for time-varying 4th root finding
  publication-title: Numerical Algorithms
– year: 1961
  ident: b4
  article-title: Solutions numériques des équations algébriques
– year: 2006
  ident: b5
  article-title: 3D game engine design: a practical approach to real-time computer graphics
– volume: 69
  start-page: 66
  year: 1950
  end-page: 69
  ident: b6
  article-title: Control system synthesis by root locus method
  publication-title: Transactions of the American Institute of Electrical Engineers
– year: 2012
  ident: b8
  article-title: From holomorphic functions to complex manifolds
– volume: 8
  start-page: 290
  year: 1966
  end-page: 294
  ident: b11
  article-title: Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen
  publication-title: Numerische Mathematik
– volume: 16
  start-page: 447
  year: 1991
  end-page: 455
  ident: b18
  article-title: Use of observers for nonlinear map inversion
  publication-title: Systems & Control Letters
– volume: 2003
  year: 2003
  ident: b12
  article-title: Phase congruency detects corners and edges
  publication-title: The australian pattern recognition society conference: DICTA
– volume: 104
  start-page: 228
  year: 2019
  ident: 10.1016/j.automatica.2021.109681_b15
  article-title: Newton-Like algorithms for the inversion of switched maps
  publication-title: Automatica
  doi: 10.1016/j.automatica.2019.01.003
– volume: 89
  start-page: 411
  year: 2018
  ident: 10.1016/j.automatica.2021.109681_b14
  article-title: A Newton-like algorithm to compute the inverse of a nonlinear map that converges in finite time
  publication-title: Automatica
  doi: 10.1016/j.automatica.2017.12.021
– year: 2015
  ident: 10.1016/j.automatica.2021.109681_b3
– year: 2012
  ident: 10.1016/j.automatica.2021.109681_b8
– volume: 236
  start-page: 438
  issue: 2
  year: 1999
  ident: 10.1016/j.automatica.2021.109681_b20
  article-title: Weak singularities and the continuous Newton method
  publication-title: Journal of Mathematical Analysis and Applications
  doi: 10.1006/jmaa.1999.6453
– volume: 73
  start-page: 115
  issue: 1
  year: 2016
  ident: 10.1016/j.automatica.2021.109681_b10
  article-title: Continuous and discrete zhang dynamics for real-time varying nonlinear optimization
  publication-title: Numerical Algorithms
  doi: 10.1007/s11075-015-0088-1
– volume: 16
  start-page: 481
  issue: 2
  year: 2016
  ident: 10.1016/j.automatica.2021.109681_b19
  article-title: Regularity of roots of polynomials
  publication-title: Annali della Scuola Normale Superiore di Pisa. Classe di scienze
– volume: 61
  start-page: 994
  issue: 4
  year: 2015
  ident: 10.1016/j.automatica.2021.109681_b23
  article-title: Newton-Raphson consensus for distributed convex optimization
  publication-title: IEEE Transactions on Automatic Control
  doi: 10.1109/TAC.2015.2449811
– volume: 2003
  year: 2003
  ident: 10.1016/j.automatica.2021.109681_b12
  article-title: Phase congruency detects corners and edges
– volume: 73
  start-page: 463
  issue: 3–4
  year: 1999
  ident: 10.1016/j.automatica.2021.109681_b1
  article-title: Continuous Newton method and its modification
  publication-title: Applicable Analysis
  doi: 10.1080/00036819908840791
– year: 1961
  ident: 10.1016/j.automatica.2021.109681_b4
– year: 2012
  ident: 10.1016/j.automatica.2021.109681_b9
– year: 2019
  ident: 10.1016/j.automatica.2021.109681_b16
– volume: 8
  start-page: 290
  issue: 3
  year: 1966
  ident: 10.1016/j.automatica.2021.109681_b11
  article-title: Ein gesamtschrittverfahren zur berechnung der nullstellen von polynomen
  publication-title: Numerische Mathematik
  doi: 10.1007/BF02162564
– year: 2008
  ident: 10.1016/j.automatica.2021.109681_b2
– year: 2006
  ident: 10.1016/j.automatica.2021.109681_b5
– volume: 69
  start-page: 66
  issue: 1
  year: 1950
  ident: 10.1016/j.automatica.2021.109681_b6
  article-title: Control system synthesis by root locus method
  publication-title: Transactions of the American Institute of Electrical Engineers
  doi: 10.1109/T-AIEE.1950.5060121
– start-page: 59
  year: 1988
  ident: 10.1016/j.automatica.2021.109681_b21
  article-title: Discrete versus continuous Newton’s method: a case study
– volume: 57
  start-page: 35
  issue: 1
  year: 2011
  ident: 10.1016/j.automatica.2021.109681_b24
  article-title: Continuous and discrete time zhang dynamics for time-varying 4th root finding
  publication-title: Numerical Algorithms
  doi: 10.1007/s11075-010-9410-0
– volume: 16
  start-page: 447
  year: 1991
  ident: 10.1016/j.automatica.2021.109681_b18
  article-title: Use of observers for nonlinear map inversion
  publication-title: Systems & Control Letters
  doi: 10.1016/0167-6911(91)90116-V
– start-page: 1554
  year: 2018
  ident: 10.1016/j.automatica.2021.109681_b7
  article-title: ADMM and accelerated ADMM as continuous dynamical systems
– year: 1998
  ident: 10.1016/j.automatica.2021.109681_b13
– start-page: 4
  year: 2006
  ident: 10.1016/j.automatica.2021.109681_b17
  article-title: Interval tools for ODEs and DAEs
– volume: 21
  start-page: 537
  issue: 3–4
  year: 2000
  ident: 10.1016/j.automatica.2021.109681_b22
  article-title: A dynamical systems approach to constrained minimization
  publication-title: Numerical functional analysis and optimization
  doi: 10.1080/01630560008816971
SSID ssj0004182
Score 2.3649604
Snippet In this technical communique, a locally convergent continuous-time model for the Durand–Kerner method is proposed to simultaneously determine all the roots of...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 109681
SubjectTerms Convergence of numerical methods
Lyapunov stability
Polynomial methods
Roots
Title A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial
URI https://dx.doi.org/10.1016/j.automatica.2021.109681
Volume 131
WOSCitedRecordID wos000675832700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-2836
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004182
  issn: 0005-1098
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbTQ_toaQvkjYtOvS2OFR-m5yWkNAUGnJIYW9Gz9bBsRbXu2wu_e0ZPWxv00DaQi9m0WLJ0nzMjKRvZhD6IAWhhGdZkMUJbFBULALGIhlEaazSRACuPzJbbCI7P88Xi-JiMvnZx8Ks66xp8s2mWP5XUUMbCNuEzv6FuIdOoQF-g9DhCWKH5x8Jfj6z9qm-cYxyE1zZWUZ61axgmx-YavIzWn_TbdV9vza-p7m3npkrakc31I7eQW3d-WBNWxsJtdT1jQlh9sP3iWtXnbZJX6nNW7pxVPnhcOGLbKpmiL8eLMAFWObKx7gf67alQo-n3TDDa2bv73Of3QDUjt4-nQjJQL8aNa7JdOoqTQ8a1yt-pzPh39SVbflNnbuThStD5vGTOTSDHI6v_JpB-45lG_iGPZXtqhx7Kk1PpevpEdoJs6TIp2hnfnay-DxG1pLc5Zv3s_BcMMcQvP-r7ndwtpyWy130zO828Nyh5DmayOYFerqVg_IlonPs8YJHvOA7eMEDXnCnscELtNQY8IItXrBWmOJtvOARL6_Q19OTy-NPga-7EfAwjbqAgk8KJjziirMk4dQEEVFpUxiLXBDFaUwJC2mUK5qxPOUJUQw850IKlkQhi16jaaMbuYdwpmAJ4yJkQhZxwgUVktAwFHYfoFS0j0i_WOXSpVcpHxLWPjrqV7X0bqJz_0qAzYNvv_mHEd-iJyO2D9C0a1fyHXrM1131o33vMXMLcVaSQg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+locally+convergent+continuous-time+algorithm+to+find+all+the+roots+of+a+time-varying+polynomial&rft.jtitle=Automatica+%28Oxford%29&rft.au=Menini%2C+Laura&rft.au=Possieri%2C+Corrado&rft.au=Tornamb%C3%A8%2C+Antonio&rft.date=2021-09-01&rft.issn=0005-1098&rft.volume=131&rft.spage=109681&rft_id=info:doi/10.1016%2Fj.automatica.2021.109681&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_automatica_2021_109681
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1098&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1098&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1098&client=summon