Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations

zbMath0977.65041arXivmath/0104280MaRDI QIDQ5932998

Kh. I. Semerdzhiev, A. I. Iliev

Publication date: 5 July 2001

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0104280

zbMATH Keywords

rootsconvergencenumerical examplesChebyshev methoditerative methodspolynomial equations

Mathematics Subject Classification ID

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) Real polynomials: location of zeros (26C10)

Related Items (2)

Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering ⋮ On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity

This page was built for publication: Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations