A fast iterative method for determining the stability of a polynomial

DOI10.1016/S0377-0427(96)00048-9MaRDI QIDQ5961644zbMATH OpenFDO

Authors L. Gemignani

Publication date 1 October 1997

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-0427(96)00048-9

zbMATH Keywords

Bézout matricescomplexityconvergencefast polynomial arithmeticiterative methodnumerical experimentspolynomialRouth-Hurwitz problemSchur-Cohn problemsstabilityzero-location problems

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)

Recommendations

• A fast version of the Schur-Cohn algorithm.
• An iterative method for computing robustness of polynomial stability
• scientific article; zbMATH DE number 3886996
• A stability test for real polynomials
• The numerical stability of the generalised root iterations for polynomial zeros

Cites work

• A look-ahead algorithm for the solution of general Hankel systems
• Algebraic methods for Toeplitz-like matrices and operators
• Algorithm 719: Multiprecision translation and execution of FORTRAN programs
• Computationally efficient applications of the Euclidean algorithm to zero location
• Computing the inertia of Bézout and Hankel matrices
• Displacement Structure: Theory and Applications
• Fast evaluation and interpolation at the Chebyshev sets of points
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile
• Generalized Bezoutians and families of efficient zero-location procedures
• How bad are Hankel matrices?
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• On the partial realization problem
• Problems of control and information theory (Hungary)
• Resultant Procedure and the Mechanization of the Graeffe Process
• Solving Hankel systems over the integers
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• The Resultant Iteration for Determining the Stability of a Polynomial

Cited in

(1)

• Fast stability checking for the convex combination of stable polynomials

Describes a project that uses

Uses Software

• Algorithm 719
• MPFUN

This page was built for publication: A fast iterative method for determining the stability of a polynomial

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