On the acceleration of an algorithm for polynomial factorization

DOI10.1134/S106456241305027XzbMath1281.65076OpenAlexW2091081380MaRDI QIDQ393870

Alexander N. Malyshev

Publication date: 24 January 2014

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s106456241305027x

zbMATH Keywords

spectral factorizationalgorithm for polynomial factorization

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

The Bauer-type factorization of matrix polynomials revisited and extended

Cites Work

• A fast solver for linear systems with displacement structure
• Effective fast algorithms for polynomial spectral factorization
• Effective Methods for Solving Banded Toeplitz Systems
• On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
• A survey of spectral factorization methods
• A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the acceleration of an algorithm for polynomial factorization