The behaviour of approximations of the SOR Weierstrass method

DOI10.1016/0898-1221(96)00160-5zbMath0868.65028OpenAlexW1998103765MaRDI QIDQ1352773

Nikolay Kyurkchiev, Miodrag S. Petković

Publication date: 19 February 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00160-5

zbMATH Keywords

convergencesuccessive overrelaxationWeierstrass methoddivergence setsroots of a polynomial

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)

Related Items

A note on the convergence of the Weierstrass SOR method for polynomial roots ⋮ Global Convergence Properties of the SOR-Weierstrass Method

Cites Work

• Two observations on Durand-Kerner's root-finding method
• Some remarks on Dvorcuk's root-finding method
• Weierstrass formula and zero-finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• Initial approximations in Euler-Chebyshev's method
• The theory of Smale's point estimation and its applications
• On some methods for the simultaneous determination of polynomial zeros
• A Note on the Divergent Starting Points for Weierstrass Type Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item