Polyhedral end games for polynomial continuation

DOI10.1023/A:1019163811284MaRDI QIDQ1272646zbMATH OpenFDO

Authors Birkett Huber, J. Verschelde

Publication date 11 April 1999

Published in Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

homotopy continuationpolynomial systemsextrapolation methodNewton polytopespolyhedral homotopy methodend game strategies

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Mixed volumes and related topics in convex geometry (52A39) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Recommendations

• scientific article; zbMATH DE number 3062460
• Polynomial games and determinacy
• Polymatrix games and optimization problems
• A note on polymatrix games
• Publication:3202150
• A polymatroid associated with convex games
• scientific article; zbMATH DE number 988830
• Publication:3468723
• Characterizing the value functions of polynomial games
• Polytopes and the existence of approximate equilibria in discontinuous games

Cited in

(30)

• Toric Newton method for polynomial homotopies
• Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
• Locating the closest singularity in a polynomial homotopy
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Isosingular sets and deflation
• Toric intersection theory for affine root counting
• Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
• Computing all space curve solutions of polynomial systems by polyhedral methods
• Robust continuation methods for tracing solution curves of parameterized systems
• An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
• Polyhedral homotopies in Cox coordinates
• Khovanskii-Rolle continuation for real solutions
• scientific article; zbMATH DE number 6296052 (Why is no real title available?)
• Newton polytopes and witness sets
• Solving polynomial systems by polyhedral homotopies
• Numerical root finding via Cox rings
• Numerically computing real points on algebraic sets
• Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Sweeping algebraic curves for singular solutions
• Solving decomposable sparse systems
• A robust numerical path tracking algorithm for polynomial homotopy continuation
• A family of sparse polynomial systems arising in chemical reaction systems
• Numerical Evidence for a Conjecture in Real Algebraic Geometry
• Multiprojective witness sets and a trace test
• Foreword. What is numerical algebraic geometry?
• Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
• Early Ending in Homotopy Path-Tracking for Real Roots
• Computing Tropical Curves via Homotopy Continuation

This page was built for publication: Polyhedral end games for polynomial continuation

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