On a generalization of the Euler-Chebyshev method for simultaneous extraction of only a part of all roots of polynomials

DOI10.1007/BF03167498zbMath1123.65038OpenAlexW2062107826MaRDI QIDQ2493488

Qing Fang, Nikolay Kyurkchiev, A. I. Iliev

Publication date: 19 June 2006

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167498

zbMATH Keywords

numerical experimentszeros of polynomialslocal convergencecubic convergenceEuler-Chebyshev methodtotal-step methodsingle-step procedure

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 (1)

Efficient optimal eighth-order derivative-free methods for nonlinear equations

Cites Work

• Iterative methods for simultaneous inclusion of polynomial zeros
• On the R-order of convergence of a family of methods for simultaneous extraction of part of all roots of algebraic polynomials
• On some methods for the simultaneous determination of polynomial zeros
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalization of the Euler-Chebyshev method for simultaneous extraction of only a part of all roots of polynomials