A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial
From MaRDI portal
Publication:2665356
DOI10.1016/j.automatica.2021.109681OpenAlexW3158099628MaRDI QIDQ2665356
Corrado Possieri, Laura Menini, Antonio Tornambe
Publication date: 19 November 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109681
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- Continuous and discrete time Zhang dynamics for time-varying 4th root finding
- Use of observers for the inversion of nonlinear maps
- Discrete versus continuous Newton's method: A case study
- Weak singularities and the continuous Newton method
- A Newton-like algorithm to compute the inverse of a nonlinear map that converges in finite time
- Newton-like algorithms for the inversion of switched maps
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Newton-Raphson Consensus for Distributed Convex Optimization
- Regularity of roots of polynomials
- Continuous newton method and its modification
- A dynamical systems approach to constrained minimization
- Ideals, Varieties, and Algorithms
- Numerical Methods for Ordinary Differential Equations
