Pages that link to "Item:Q679271"

The following pages link to A fast and stable algorithm for splitting polynomials (Q679271):

Displaying 10 items.

• Wiener-Hopf and spectral factorization of real polynomials by Newton's method (Q393389) (← links)
• Computing \(x^ m\mod p(x)\) and an application to splitting a polynomial into factors over a fixed disc (Q674751) (← links)
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
• Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
• The Bauer-type factorization of matrix polynomials revisited and extended (Q1991634) (← links)
• Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors (Q2365420) (← links)
• An efficient algorithm for the complex roots problem (Q2565192) (← links)
• Numerical factorization of polynomials via a fast transversal filter (Q2732969) (← links)
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
• On the geometry of Graeffe iteration (Q5949383) (← links)