On an iterative method for simultaneous inclusion of polynomial complex zeros
نویسندگان
چکیده
منابع مشابه
Euler-like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction
An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petković’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + √ 7 ≈ 4.646 or 5, depending of the type...
متن کاملFilomat 17 (2003), 155–168 Derivative Free Combined Method for the Simultaneous Inclusion of Polynomial Zeros
Abstract. A combined method for the simultaneous inclusion of complex zeros of a polynomial, composed of two circular arithmetic methods, is presented. This method does not use polynomial derivatives and has the order of convergence equals four. Computationally verifiable initial conditions that guarantee the convergence are also stated. Two numerical example are included to demonstrate the con...
متن کاملOn the Improved Family of Simultaneous Methods for the Inclusion of Multiple Polynomial Zeros
Starting from a family of iterative methods for the simultaneous inclusion of multiple complex zeros, we construct efficient iterative methods with accelerated convergence rate by the use of Gauss-Seidel procedure and the suitable corrections. The proposed methods are realized in the circular complex interval arithmetic and produce disks that contain the wanted zeros. The suggested algorithms p...
متن کاملSemilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. ...
متن کاملOn the Convergence Rate of Symmetric Single-Step Method ISS for Simultaneous Bounding Polynomial Zeros
A new modified method ISS for the simultaneous bounding all the zeros of a polynomial is formulated in this paper. The efficiency of this method is measured on the CPU times and the number of iterations after satisfying the convergence criteria where the results are obtained using five tested polynomials. The R-order of convergence of this method is at least 9. Mathematics Subject Classificatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1982
ISSN: 0377-0427
DOI: 10.1016/0771-050x(82)90007-9