Some lower bounds for the complexity of continuation methods

DOI10.1006/jcom.1998.0486zbMath0918.65038OpenAlexW2060042548MaRDI QIDQ1279910

Jean-Pierre Dedieu, Stephen Smale

Publication date: 17 August 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a215fb897971c2f454dca1035b524cfe036c4da5

zbMATH Keywords

complexity boundshomogeneous polynomial systemNewton continuation methods

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Relations between roots and coefficients, interpolation and application to system solving ⋮ Kronecker's and Newton's approaches to solving: a first comparison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's Theorem I: Geometric Aspects
• Condition Number Analysis for Sparse Polynomial Systems
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Newton's method for overdetermined systems of equations

This page was built for publication: Some lower bounds for the complexity of continuation methods