On the acceleration of an algorithm for polynomial factorization
From MaRDI portal
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: factorization (12D05) Numerical computation of roots of polynomial equations (65H04)
Recommendations
Cites work
- scientific article; zbMATH DE number 4082836 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 1534402 (Why is no real title available?)
- A fast solver for linear systems with displacement structure
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- A survey of spectral factorization methods
- Effective Methods for Solving Banded Toeplitz Systems
- Effective fast algorithms for polynomial spectral factorization
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
Cited in
(7)- scientific article; zbMATH DE number 1262457 (Why is no real title available?)
- On factorization of matrix polynomial with respect to the unit circle
- Effective fast algorithms for polynomial spectral factorization
- The Bauer-type factorization of matrix polynomials revisited and extended
- Algorithms for adaptive factorization of polynomials
- On the Complexity of the Montes Ideal Factorization Algorithm
- scientific article; zbMATH DE number 4006369 (Why is no real title available?)
This page was built for publication: On the acceleration of an algorithm for polynomial factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393870)
