On the Distance to a Root of Polynomials
Author
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-10-27
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Chaiya, Somjate. 2011. On the Distance to a Root of Polynomials. Abstract and Applied Analysis،Vol. 2011, no. 2011, pp.1-6.
https://search.emarefa.net/detail/BIM-476215
Modern Language Association (MLA)
Chaiya, Somjate. On the Distance to a Root of Polynomials. Abstract and Applied Analysis No. 2011 (2011), pp.1-6.
https://search.emarefa.net/detail/BIM-476215
American Medical Association (AMA)
Chaiya, Somjate. On the Distance to a Root of Polynomials. Abstract and Applied Analysis. 2011. Vol. 2011, no. 2011, pp.1-6.
https://search.emarefa.net/detail/BIM-476215
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-476215