On the acceleration of an algorithm for polynomial factorization
From MaRDI portal
Publication:393870
DOI10.1134/S106456241305027XzbMath1281.65076MaRDI QIDQ393870
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
12D05: Polynomials in real and complex fields: factorization
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
65H04: Numerical computation of roots of polynomial equations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
