Computationally efficient applications of the Euclidean algorithm to zero location

DOI10.1016/0024-3795(95)00267-7zbMath0861.65043OpenAlexW2007946421MaRDI QIDQ2564899

Luca Gemignani

Publication date: 7 January 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00267-7

zbMATH Keywords

Hankel matrixreal polynomialsEuclidean algorithmfast polynomial arithmeticRouth-Hurwitz problemSchur-Cohn problemsinertia of a matrixdivide-and-conquer techniqueszero-location problem

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm ⋮ A fast iterative method for determining the stability of a polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• On the partial realization problem
• Fast projection methods for minimal design problems in linear system theory
• Computing the inertia of Bézout and Hankel matrices
• Rational interpolation via orthogonal plynomials
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• 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