A fast and stable algorithm for splitting polynomials
DOI10.1016/S0898-1221(96)00233-7zbMath0917.65047WikidataQ29997760 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
complexity; numerical results; splitting; numerical stability; factorization; fast algorithm; polynomial equations; Greffe's transformations
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
65Y20: Complexity and performance of numerical algorithms
Related Items
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