A continuation method to solve polynomial systems and its complexity
From MaRDI portal
Publication:621308
DOI10.1007/s00211-010-0334-3zbMath1216.65058MaRDI QIDQ621308
Publication date: 2 February 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0334-3
65H10: Numerical computation of solutions to systems of equations
65Y20: Complexity and performance of numerical algorithms
Related Items
Smale's fundamental theorem of algebra reconsidered, Complexity of path-following methods for the eigenvalue problem, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Fast linear homotopy to find approximate zeros of polynomial systems, On the geometry and topology of the solution variety for polynomial system solving, Robust certified numerical homotopy tracking, Certified Numerical Homotopy Tracking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast linear homotopy to find approximate zeros of polynomial systems
- On Smale's 17th problem: a probabilistic positive solution
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Computing all solutions to polynomial systems using homotopy continuation
- Complexity of Bezout's theorem. V: Polynomial time
- A note on the finite variance of the averaging function for polynomial system solving
- Complexity of Bezout's theorem. III: Condition number and packing
- Certified Numerical Homotopy Tracking
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- The Condition Metric in the Space of Rectangular Full Rank Matrices
- Convexity Properties of the Condition Number
- The fundamental theorem of algebra and complexity theory
- Complexity of Bezout's Theorem I: Geometric Aspects
- Finding all solutions to polynomial systems and other systems of equations
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
