Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
From MaRDI portal
Publication:4918038
DOI10.1016/j.entcs.2008.03.016zbMath1262.03129OpenAlexW1987189994MaRDI QIDQ4918038
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.016
Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
Path lengths in tree-child time consistent hybridization networks ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Globally convergent, iterative path-following for algebraic equations ⋮ Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix
- On a theorem of S. Smale about Newton's method for analytic mappings
- Families of rational maps and iterative root-finding algorithms
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Ergänzung zu einer Arbeit von Hellmuth Kneser über den Fundamentalsatz der Algebra
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- Improvement of a convergence condition for Durand-Kerner iteration
- Polynomial root finding by means of continuation
- An inequality for the discriminant of a polynomial
- Sums of powers of complex numbers
- Circular arithmetic and the determination of polynomial zeros
- An efficient algorithm for the complex roots problem
- Der Fundamentalsatz der Algebra und der Intuitionismus
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A Machine Method for Solving Polynomial Equations
- On the efficiency of algorithms of analysis
- The fundamental theorem of algebra and complexity theory
- Complexity of Bezout's Theorem I: Geometric Aspects
- On Algorithms for Solvingf(x)=0
- Solving a Polynomial Equation: Some History and Recent Progress
- ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Some remarks on Smale's “Algorithms for solving equations”
This page was built for publication: Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
