A stability test for complex polynomials

DOI10.1524/ANLY.1995.15.3.205zbMath0838.65052OpenAlexW2328482015MaRDI QIDQ4852686

Michael-Ralf Skrzipek, F. Locher

Publication date: 3 June 1996

Published in: Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1524/anly.1995.15.3.205

zbMATH Keywords

algorithmsstabilityChebyshev polynomialsEuclidean algorithmexclusion methodSturm sequencesdiscrete linear time invariant systemsroots of a complex polynomialinclusion method

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Pole and zero placement problems (93B55) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Related Items (1)

A recursive algorithm for constructing generalized Sturm sequence

This page was built for publication: A stability test for complex polynomials