Computing a Hurwitz factorization of a polynomial

DOI10.1016/S0377-0427(99)00365-9zbMath0971.65041OpenAlexW2159428062MaRDI QIDQ5928301

Luca Gemignani

Publication date: 25 October 2001

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(99)00365-9

zbMATH Keywords

Hurwitz factorHurzwitz polynomialLR algorithmmatrix eigenvalue problempolynomial factorization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) 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) Real polynomials: location of zeros (26C10)

Related Items

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ Computations with infinite Toeplitz matrices and polynomials ⋮ Nearest stable system using successive convex approximations

Cites Work

• Convergence of algorithms of decomposition type for the eigenvalue problem
• On the calculation of Jacobi matrices
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
• Derivation of recursive stability-test procedures
• Polynomial root computation by means of the LR algorithm
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
• On a companion operator for analytic functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item