Globally convergent, iterative path-following for algebraic equations

DOI10.1007/S11786-011-0069-2zbMath1229.65076OpenAlexW2090258218MaRDI QIDQ655158

Prashant Batra

Publication date: 2 January 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0069-2

zbMATH Keywords

Newton's methodfundamental theorem of algebrahomotopy methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Clustering complex zeros of triangular systems of polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem posed by Steve Smale
• On dominating sequence method in the point estimate and Smale's theorem
• Solving the quintic by iteration
• On Smale's 17th problem: a probabilistic positive solution
• Kronecker's algorithmic mathematics
• On condition numbers and the distance to the nearest ill-posed problem
• Families of rational maps and iterative root-finding algorithms
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
• On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
• Complexity of Bezout's theorem. V: Polynomial time
• Simultaneous point estimates for Newton's method
• Perturbation bounds for polynomials
• On location and approximation of clusters of zeros of analytic functions
• Perturbation of zeros of analytic functions. II
• An efficient algorithm for the complex roots problem
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• On the location of critical points of polynomials
• On the efficiency of algorithms of analysis
• Complexity of Bezout's Theorem I: Geometric Aspects
• On Algorithms for Solvingf(x)=0
• How the Roots of a Polynomial Vary with its Coefficients: A Local Quantitative Result
• Polynomial Root-Finding Algorithms and Branched Covers
• Solving a Polynomial Equation: Some History and Recent Progress
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• The Minimum Root Separation of a Polynomial
• Essays in Constructive Mathematics
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
• Some remarks on Smale's “Algorithms for solving equations”
• Algorithms – ESA 2005
• How to find all roots of complex polynomials by Newton's method.

This page was built for publication: Globally convergent, iterative path-following for algebraic equations