A fast iterative method for determining the stability of a polynomial
DOI10.1016/S0377-0427(96)00048-9zbMath0871.65039MaRDI QIDQ5961644
Publication date: 1 October 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
complexitystabilityconvergencenumerical experimentsiterative methodpolynomialBézout matricesfast polynomial arithmeticRouth-Hurwitz problemSchur-Cohn problemszero-location problems
Symbolic computation and algebraic computation (68W30) 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) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic methods for Toeplitz-like matrices and operators
- Fast evaluation and interpolation at the Chebyshev sets of points
- On the partial realization problem
- Computing the inertia of Bézout and Hankel matrices
- How bad are Hankel matrices?
- A look-ahead algorithm for the solution of general Hankel systems
- Solving Hankel systems over the integers
- Computationally efficient applications of the Euclidean algorithm to zero location
- Generalized Bezoutians and families of efficient zero-location procedures
- The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
- Resultant Procedure and the Mechanization of the Graeffe Process
- The Resultant Iteration for Determining the Stability of a Polynomial
- Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- Problems of control and information theory (Hungary)
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
This page was built for publication: A fast iterative method for determining the stability of a polynomial
