Condition number based complexity estimate for solving polynomial systems

DOI10.1016/j.cam.2010.11.018zbMath1211.65059OpenAlexW2074519436MaRDI QIDQ629539

Zhikun She, Bican Xia, Zhi Ming Zheng

Publication date: 9 March 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.11.018

zbMATH Keywords

systems of polynomial equationscondition numberNewton operatorcomplexity analysisreal-root-counting

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Characterizations and Criteria for Synchronization of Heterogeneous Networks to Linear Subspaces ⋮ Discovering polynomial Lyapunov functions for continuous dynamical systems

Cites Work

• Condition number based complexity estimate for computing local extrema
• The complexity of elementary algebra and geometry
• Solving systems of polynomial inequalities in subexponential time
• A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
• Polynomial algorithms in computer algebra
• Approximate zeros and condition numbers
• A new decision method for elementary algebra
• Complexity estimates depending on condition and round-off error
• Sur la complexité du principe de Tarski-Seidenberg
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Condition number based complexity estimate for solving polynomial systems