On the geometry and topology of the solution variety for polynomial system solving
From MaRDI portal
Publication:1928275
DOI10.1007/s10208-012-9134-8zbMath1295.37010OpenAlexW2063926912MaRDI QIDQ1928275
Publication date: 3 January 2013
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-012-9134-8
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Singularities of surfaces or higher-dimensional varieties (14J17) Dynamics induced by flows and semiflows (37C10) Geodesics in global differential geometry (53C22)
Related Items
Self-convexity and curvature, Condition length and complexity for the solution of polynomial systems, Generalized inverses of tensors via a general product of tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A continuation method to solve polynomial systems and its complexity
- 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
- On the probability distribution of data at points in real complete intersection varieties
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- The geometry of ill-conditioning
- Complexity of Bezout's theorem. V: Polynomial time
- A geometric characterization of smooth linearizability
- Linearization of normally hyperbolic diffeomorphisms and flows
- Equivariant differential topology
- Certified Numerical Homotopy Tracking
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- Convexity Properties of the Condition Number
- Complexity of Bezout's Theorem I: Geometric Aspects
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Convexity Properties of the Condition Number II
- Adaptive step-size selection for homotopy methods to solve polynomial equations
