Smale 17th Problem: Advances and Open Directions

DOI10.53733/92OpenAlexW3199470480MaRDI QIDQ3380357

Felipe Cucker

Publication date: 28 September 2021

Published in: New Zealand Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.53733/92

zbMATH Keywords

complexitypolynomial systemsapproximate zeropolynomial timehomotopy methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20) Algebraic geometry (14-XX)

Cites Work

• Condition length and complexity for the solution of polynomial systems
• Fast linear homotopy to find approximate zeros of polynomial systems
• On a problem posed by Steve Smale
• On Smale's 17th problem: a probabilistic positive solution
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• The complexity of partial derivatives
• Complexity of Bezout's theorem. V: Polynomial time
• Mathematical problems for the next century
• A stable, polynomial-time algorithm for the eigenpair problem
• A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
• Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
• Complexity of Bezout's theorem. III: Condition number and packing
• Condition
• Complexity of Bezout's Theorem I: Geometric Aspects
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• A sequence of polynomials with optimal condition number
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smale 17th Problem: Advances and Open Directions