Newton’s method in practice, II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
Authors:
- Marvin RandigMRMarvin Randig
- Dierk SchleicherDSDierk Schleicher
- Robin StollRSRobin Stoll
- 24 July 2023
- journal article
- research article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 437
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Solving secular and polynomial equations: A multiprecision algorithmJournal of Computational and Applied Mathematics, 2014
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s methodMathematics of Computation, 2012
- On the number of iterations of Newton's method for complex polynomialsErgodic Theory and Dynamical Systems, 2002
- A 2002 update of the supplementary bibliography on roots of polynomialsJournal of Computational and Applied Mathematics, 2002
- How to find all roots of complex polynomials by Newton’s methodInventiones Mathematicae, 2001
- Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's IterationJournal of Complexity, 2000
- On the worst-case arithmetic complexity of approximating zeros of polynomialsJournal of Complexity, 1987
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM Journal on Computing, 1986
- ber die Nullstellenverteilung zuf lliger PolynomeMathematische Zeitschrift, 1966
- On the Distribution of Roots of PolynomialsAnnals of Mathematics, 1950