Numerically computing real points on algebraic sets

DOI10.1007/s10440-012-9782-3zbMath1269.65048arXiv1105.6266OpenAlexW2163635171WikidataQ57426844 ScholiaQ57426844MaRDI QIDQ1956231

Jonathan D. Hauenstein

Publication date: 13 June 2013

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.6266

zbMATH Keywords

algorithmhomotopy continuationnumerical examplespolynomial systemreal rootsnumerical algebraic geometryreal algebraic geometryinfinitesimal deformation

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Computational aspects of higher-dimensional varieties (14Q15) Polynomials, factorization in commutative rings (13P05)

Related Items (25)

Perturbed homotopies for finding all isolated solutions of polynomial systems ⋮ Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials ⋮ Tensor decomposition and homotopy continuation ⋮ Computing Geometric Feature Sizes for Algebraic Manifolds ⋮ Sampling and homology via bottlenecks ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Revealing Bistability in Neurological Disorder Models By Solving Parametric Polynomial Systems Geometrically ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ Inner-estimating domains of attraction for discrete-time non-polynomial systems with piecewise difference inclusions ⋮ Visualizing planar and space implicit real algebraic curves with singularities ⋮ Defect of Euclidean distance degree ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ Solving determinantal systems using homotopy techniques ⋮ Unification and extension of intersection algorithms in numerical algebraic geometry ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ Critical points via monodromy and local methods ⋮ A hybrid symbolic-numerical approach to the center-focus problem ⋮ Inner-approximating domains of attraction for discrete-time switched systems via multi-step multiple Lyapunov-like functions ⋮ A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications ⋮ The numerical algebraic geometry of bottlenecks ⋮ Euclidean distance degree and mixed volume ⋮ Smooth points on semi-algebraic sets ⋮ Computing critical points for invariant algebraic systems ⋮ Epsilon local rigidity and numerical algebraic geometry ⋮ Computing real witness points of positive dimensional polynomial systems

Uses Software

• Bertini
• alphaCertified

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mechanism mobility and a local dimension test
• Regenerative cascade homotopies for solving polynomial systems
• Efficient path tracking methods
• Khovanskii-Rolle continuation for real solutions
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• A transformation to avoid solutions at infinity for polynomial systems
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• Solving systems of polynomial inequalities in subexponential time
• Coefficient-parameter polynomial continuation
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• A power series method for computing singular solutions to nonlinear analytic systems
• Computing singular solutions to polynomial systems
• Counting connected components of a semialgebraic set in subexponential time
• Polyhedral end games for polynomial continuation
• Description of the connected components of a semialgebraic set in single exponential time
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Real solving for positive dimensional systems.
• On the geometry of polar varieties
• Cell decomposition of almost smooth real algebraic surfaces
• A new decision method for elementary algebra
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• An Iterative Method Converging to a Positive Solution of Certain Systems of Polynomial Equations
• Algorithm 921
• A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
• Regeneration homotopies for solving systems of polynomials
• Computing Roadmaps of General Semi-Algebraic Sets
• Adaptive Multiprecision Path Tracking
• On the combinatorial and algebraic complexity of quantifier elimination
• Homotopies for Intersecting Solution Components of Polynomial Systems
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Algorithms in real algebraic geometry
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Polar varieties and efficient real elimination

This page was built for publication: Numerically computing real points on algebraic sets