On the geometry and topology of the solution variety for polynomial system solving
Publication:1928275
DOI10.1007/S10208-012-9134-8zbMATH Open1295.37010OpenAlexW2063926912MaRDI QIDQ1928275FDOQ1928275
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) Singularities of surfaces or higher-dimensional varieties (14J17) Dynamics induced by flows and semiflows (37C10) Geodesics in global differential geometry (53C22) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- On a problem posed by Steve Smale
- On Smale's 17th problem: a probabilistic positive solution
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Convexity Properties of the Condition Number
- Convexity Properties of the Condition Number II
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout's Theorem I: Geometric Aspects
- Fast linear homotopy to find approximate zeros of polynomial systems
- Certified Numerical Homotopy Tracking
- A geometric characterization of smooth linearizability
- Linearization of normally hyperbolic diffeomorphisms and flows
- Equivariant differential topology
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- A continuation method to solve polynomial systems and its complexity
- On the probability distribution of data at points in real complete intersection varieties
- The geometry of ill-conditioning
Cited In (8)
- Lee-Yang problems and the geometry of multivariate polynomials
- Self-convexity and curvature
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Constructing polynomial systems with many positive solutions using tropical geometry
- Title not available (Why is that?)
- A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods
- Generalized inverses of tensors via a general product of tensors
- Condition length and complexity for the solution of polynomial systems
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A homotopy for solving polynomial systems 👍 👎
- On the solutions to polynomial systems obtained by homotopy methods 👍 👎
- Homotopies for solving polynomial systems within a bounded domain 👍 👎
- Solving polynomial systems by polyhedral homotopies 👍 👎
- On solving large systems of polynomial equations appearing in discrete differential geometry 👍 👎
- The complexity and geometry of numerically solving polynomial systems. 👍 👎
This page was built for publication: On the geometry and topology of the solution variety for polynomial system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928275)
