A fast and stable algorithm for splitting polynomials

DOI10.1016/S0898-1221(96)00233-7MaRDI QIDQ679271zbMATH OpenOpenAlexWikidataFDO

Authors Gregorio Malajovich, J. P. Zubelli

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

zbMATH Keywords

fast algorithmnumerical resultscomplexityfactorizationnumerical stabilitysplittingpolynomial equationsGreffe's transformations

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 1859220
• Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
• An efficient algorithm for the complex roots problem

Cites work

• scientific article; zbMATH DE number 421657 (Why is no real title available?)
• scientific article; zbMATH DE number 4096783 (Why is no real title available?)
• Complexity of Bezout's theorem. III: Condition number and packing
• Complexity of Bezout's theorem. V: Polynomial time
• Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
• 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
• On the Problem of Runs
• Optimal and nearly optimal algorithms for approximating polynomial zeros

Cited in

(7)

• Numerical factorization of polynomials via a fast transversal filter
• Multi-modular algorithm for computing the splitting field of a polynomial
• 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
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

This page was built for publication: A fast and stable algorithm for splitting polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679271)