A fast and stable algorithm for splitting polynomials
From MaRDI portal
Publication:679271
DOI10.1016/S0898-1221(96)00233-7zbMath0917.65047OpenAlexW2071565529WikidataQ29997760 ScholiaQ29997760MaRDI QIDQ679271
Jorge P. Zubelli, Gregorio Malajovich
Publication date: 3 June 1999
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(96)00233-7
complexitynumerical resultssplittingnumerical stabilityfactorizationfast algorithmpolynomial equationsGreffe's transformations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ The Bauer-type factorization of matrix polynomials revisited and extended ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ On the geometry of Graeffe iteration
Cites Work
- Unnamed Item
- Unnamed Item
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Complexity of Bezout's theorem. III: Condition number and packing
- On the Problem of Runs
This page was built for publication: A fast and stable algorithm for splitting polynomials
