On an efficient inclusion method for finding polynomial zeros
-
Dušan M. Milošević [1] ; Mimica R. Milošević [2] ; Jovana Džunić [1]
-
[1] University of Nis
University of Nis
Serbia
-
[2] Univerzitet Union Nikola Tesla
Univerzitet Union Nikola Tesla
Serbia
-
- Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 290, Nº 1, 2015, págs. 298-309
- Idioma: inglés
- DOI: 10.1016/j.cam.2015.05.015
- Enlaces
-
Resumen
New efficient iterative method of Halley’s type for the simultaneous inclusion of all simple complex zeros of a polynomial is proposed. The presented convergence analysis, which uses the concept of the RR-order of convergence of mutually dependent sequences, shows that the convergence rate of the basic fourth order method is increased from 4 to 9 using a two-point correction. The proposed inclusion method possesses high computational efficiency since the increase of convergence is attained with only one additional function evaluation per sought zero. Further acceleration of the proposed method is carried out using the Gauss–Seidel procedure. Some computational aspects and three numerical examples are given in order to demonstrate high computational efficiency and the convergence properties of the proposed methods.
