Initial approximations in Euler-Chebyshev's method

DOI10.1016/0377-0427(95)00031-9zbMath0844.65043OpenAlexW2085071053MaRDI QIDQ1899955

Nikolay Kyurkchiev

Publication date: 20 November 1995

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

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00031-9

zbMATH Keywords

polynomial zerosinitial approximationsEuler-Chebyshev iterative method

Mathematics Subject Classification ID

Related Items (6)

The behaviour of approximations of the SOR Weierstrass method ⋮ A note on the convergence of the Weierstrass SOR method for polynomial roots ⋮ A note on the Le Verrier-Fadeev's method ⋮ Point estimation and some applications to iterative methods ⋮ A NOTE ON THE SEMILOCAL CONVERGENCE OF CHEBYSHEV’S METHOD ⋮ The polynomial pivots as initial values for a new root-finding iterative method

Cites Work

• An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
• Some remarks on Dvorcuk's root-finding method
• Iterative methods for simultaneous inclusion of polynomial zeros
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Initial approximations in Euler-Chebyshev's method