Polyhedral methods in numerical algebraic geometry

MaRDI QIDQ3655324zbMATH OpenFDO

Authors J. Verschelde

Publication date 7 January 2010

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

zbMATH Keywords

algebraic curvesnumerical examples

Mathematics Subject Classification ID

Computational aspects of algebraic curves (14Q05) Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to systems of equations (65H10)

Abstract: In numerical algebraic geometry witness sets are numerical representations of positive dimensional solution sets of polynomial systems. Considering the asymptotics of witness sets we propose certificates for algebraic curves. These certificates are the leading terms of a Puiseux series expansion of the curve starting at infinity. The vector of powers of the first term in the series is a tropism. For proper algebraic curves, we relate the computation of tropisms to the calculation of mixed volumes. With this relationship, the computation of tropisms and Puiseux series expansions could be used as a preprocessing stage prior to a more expensive witness set computation. Systems with few monomials have fewer isolated solutions and fewer data are needed to represent their positive dimensional solution sets.

Recommendations

• Newton polytopes and witness sets
• General witness sets for numerical algebraic geometry
• Introduction to numerical algebraic geometry
• Software for numerical algebraic geometry: a paradigm and progress towards its implementation
• scientific article; zbMATH DE number 953044

Cited in

(19)

• Polar varieties, real equation solving, and data structures: the hypersurface case
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Numerical algebraic geometry and semidefinite programming
• Solving determinantal systems using homotopy techniques
• Elimination for generic sparse polynomial systems
• Compressed algebraic cubature over polygons with applications to optical design
• Computing all space curve solutions of polynomial systems by polyhedral methods
• Pruning algorithms for pretropisms of Newton polytopes
• Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
• Sinc Methods on Polyhedra
• scientific article; zbMATH DE number 4142187 (Why is no real title available?)
• scientific article; zbMATH DE number 3976215 (Why is no real title available?)
• Newton polytopes and witness sets
• An Algebraic-Geometric Method for Computing Zolotarev Polynomials
• General witness sets for numerical algebraic geometry
• Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
• Determinantal representations of hyperbolic curves via polynomial homotopy continuation
• Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
• PALP: a package for analysing lattice polytopes with applications to toric geometry

Describes a project that uses

Uses Software

• Kronecker
• PHoM
• Gfan

This page was built for publication: Polyhedral methods in numerical algebraic geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655324)