Computing a Hurwitz factorization of a polynomial

DOI10.1016/S0377-0427(99)00365-9MaRDI QIDQ5928301zbMATH OpenOpenAlexFDO

Authors L. 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

polynomial factorizationmatrix eigenvalue problemLR algorithmHurwitz factorHurzwitz polynomial

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) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• On properties of Hurwitz polynomials
• scientific article; zbMATH DE number 4074933
• A simple algorithm for the determination of a Hurwitz polynomial from its squared magnitude on the imaginary axis
• On one method of factorization of polynomials
• scientific article; zbMATH DE number 11723

Cites work

• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 953050 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Derivation of recursive stability-test procedures
• On a companion operator for analytic functions
• On the calculation of Jacobi matrices
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
• Polynomial root computation by means of the LR algorithm

Cited in

(8)

• Computing \(\widehat {HF}\) by factoring mapping
• Computations with infinite Toeplitz matrices and polynomials
• A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
• Generalized Hurwitz matrices, generalized Euclidean algorithm, and forbidden sectors of the complex plane
• scientific article; zbMATH DE number 3877484 (Why is no real title available?)
• Nearest stable system using successive convex approximations
• A simple algorithm for the determination of a Hurwitz polynomial from its squared magnitude on the imaginary axis
• scientific article; zbMATH DE number 108011 (Why is no real title available?)

This page was built for publication: Computing a Hurwitz factorization of a polynomial

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