On the Distance to a Root of Polynomials

Somjate Chaiya

Abstract and Applied Analysis, 2011, vol. 2011, issue 1

Abstract: In 2002, Dierk Schleicher gave an explicit estimate of an upper bound for the number of iterations of Newton′s method it takes to find all roots of polynomials with prescribed precision. In this paper, we provide a method to improve the upper bound given by D. Schleicher. We give here an iterative method for finding an upper bound for the distance between a fixed point z in an immediate basin of a root α to α, which leads to a better upper bound for the number of iterations of Newton′s method.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2011/495312

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2011:y:2011:i:1:n:495312

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().