arXiv:1003.1236 [math.NT]AbstractReferencesReviewsResources
On the Number of Places of Convergence for Newton's Method over Number Fields
Xander Faber, José Felipe Voloch
Published 2010-03-05, updated 2010-10-10Version 2
Let f be a polynomial of degree at least 2 with coefficients in a number field K, let x_0 be a sufficiently general element of K, and let alpha be a root of f. We give precise conditions under which Newton iteration, started at the point x_0, converges v-adically to the root alpha for infinitely many places v of K. As a corollary we show that if f is irreducible over K of degree at least 3, then Newton iteration converges v-adically to any given root of f for infinitely many places v. We also conjecture that the set of places for which Newton iteration diverges has full density and give some heuristic and numerical evidence.
Comments: 9 pages; minor changes from the previous version; to appear in Journal de Th\'eorie des Nombres de Bordeaux
Related articles: Most relevant | Search more
Newton's Method Over Global Height Fields
arXiv:1609.08207 [math.NT] (Published 2016-09-26)
On the rate of convergence for $(\log_b n)$
arXiv:math/0007094 [math.NT] (Published 2000-07-14)
Convergence of zeta functions of graphs