A stability test for complex polynomials

DOI10.1524/ANLY.1995.15.3.205MaRDI QIDQ4852686zbMATH OpenOpenAlexFDO

Authors F. Locher, Michael-Ralf Skrzipek

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

algorithmsChebyshev polynomialsdiscrete linear time invariant systemsEuclidean algorithmexclusion methodinclusion methodroots of a complex polynomialstabilitySturm sequences

Mathematics Subject Classification ID

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) Pole and zero placement problems (93B55) Discrete-time control/observation systems (93C55)

Recommendations

• scientific article; zbMATH DE number 2062059
• A stability test for real polynomials
• On polynomials nonnegative on the unit circle and related questions
• A note on the location of the roots of a polynomial
• An algorithm for locating all zeros of a real polynomial

Cited in

(5)

• A circular stability test for general polynomials
• A stability test for real polynomials
• A recursive algorithm for constructing generalized Sturm sequence
• scientific article; zbMATH DE number 2062059 (Why is no real title available?)
• A remark on an algorithm for testing Pisot polynomials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852686)