Certified Numerical Homotopy Tracking
From MaRDI portal
Publication:2883925
DOI10.1080/10586458.2011.606184zbMath1238.14048arXiv0912.0920WikidataQ56029829 ScholiaQ56029829MaRDI QIDQ2883925
Publication date: 14 May 2012
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.0920
complexity; approximate zero; systems of equations; homotopy methods; computational aspects of algebraic geometry; certified algorithms; continual methods
65H10: Numerical computation of solutions to systems of equations
65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
Related Items
Fast computation of zeros of polynomial systems with bounded degree under finite-precision, Algebraic compressed sensing, Rigid continuation paths II. structured polynomial systems, A primal-dual formulation for certifiable computations in Schubert calculus, Foreword. What is numerical algebraic geometry?, A lifted square formulation for certifiable Schubert calculus, A continuation method to solve polynomial systems and its complexity, Fast linear homotopy to find approximate zeros of polynomial systems, Certified predictor-corrector tracking for Newton homotopies, On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach, On the geometry and topology of the solution variety for polynomial system solving, Robust certified numerical homotopy tracking, Clustering complex zeros of triangular systems of polynomials, On the computation of rational points of a hypersurface over a finite field, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), Sampling algebraic sets in local intrinsic coordinates, Real Root Isolation of Polynomial Equations Based on Hybrid Computation, Complexity of an Homotopy Method at the Neighbourhood of a Zero
Uses Software
Cites Work
- Unnamed Item
- A continuation method to solve polynomial systems and its complexity
- 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
- Numerical Schubert calculus
- A note on the finite variance of the averaging function for polynomial system solving
- Numerical algebraic geometry
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Galois groups of Schubert problems via homotopy computation
- Algorithm 795
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
