Smale 17th Problem: Advances and Open Directions

DOI10.53733/92MaRDI QIDQ3380357zbMATH OpenOpenAlexFDO

Authors Felipe Cucker

Publication date 28 September 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximate zerocomplexityhomotopy methodspolynomial systemspolynomial time

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

• Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
• Validated numerics for algebraic path tracking

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380357)