Back to Search
Start Over
On a family of Weierstrass-type root-finding methods with accelerated convergence.
- Source :
-
Applied Mathematics & Computation . Jan2016, Vol. 273, p957-968. 12p. - Publication Year :
- 2016
-
Abstract
- Kyurkchiev and Andreev (1985) constructed an infinite sequence of Weierstrass-type iterative methods for approximating all zeros of a polynomial simultaneously. The first member of this sequence of iterative methods is the famous method of Weierstrass (1891) and the second one is the method of Nourein (1977). For a given integer N ≥ 1, the N th method of this family has the order of convergence N + 1 . Currently in the literature, there are only local convergence results for these methods. The main purpose of this paper is to present semilocal convergence results for the Weierstrass-type methods under computationally verifiable initial conditions and with computationally verifiable a posteriori error estimates. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 273
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 111295083
- Full Text :
- https://doi.org/10.1016/j.amc.2015.10.048