Application of Newton's and Chebyshev's methods to parallel factorization of polynomials

MaRDI QIDQ2748452zbMATH OpenFDO

Authors Shiming Zheng

Publication date 14 October 2001

Published in Journal of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

Bairstow's methodChebyshev's methodcubic convergenceiterative factorization of polynomialsNewton's methodparallel computationquadratic convergence

Mathematics Subject Classification ID

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

Review text

Theory for the combination of Bairstow's method with Newton's method (quadratic convergence) and Chebyshev's method (cubic convergence) for the parallel iterative factorization of polynomials of even order. No numerical examples.

Recommendations

• scientific article; zbMATH DE number 4137244
• scientific article; zbMATH DE number 3947528
• scientific article; zbMATH DE number 3967804
• On some iterative algorithms for polynomial factorization
• Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations

Cited in

(3)

• Third-order iterative methods under Kantorovich conditions
• scientific article; zbMATH DE number 3705795 (Why is no real title available?)
• scientific article; zbMATH DE number 1505526 (Why is no real title available?)

This page was built for publication: Application of Newton's and Chebyshev's methods to parallel factorization of polynomials

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