Some remarks on Dvorcuk's root-finding method

DOI10.1007/BF01955880zbMath0809.65043MaRDI QIDQ1335008

K. Mahdi, Nikolay Kyurkchiev

Publication date: 28 March 1995

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

convergencefactorizationiterative processesDvorcuk's root-finding method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

The behaviour of approximations of the SOR Weierstrass method ⋮ Initial approximations in Euler-Chebyshev's method ⋮ A note on the Le Verrier-Fadeev's method ⋮ Finding roots of a real polynomial simultaneously by means of Bairstow's method ⋮ Numerical computation of polynomial zeros by means of Aberth's method

Cites Work

• A Globally Convergent Method for Simultaneously Finding Polynomial Roots
• The fundamental theorem of algebra and complexity theory
• Factorization of a polynomial into quadratic factors by Newton method
• Unnamed Item
• Unnamed Item
• Unnamed Item