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)

Full work available at URL https://doi.org/10.1023/A:1019163811284

zbMATH Keywords

end game strategiesextrapolation methodhomotopy continuationNewton polytopespolyhedral homotopy methodpolynomial systems

Mathematics Subject Classification ID

Mixed volumes and related topics in convex geometry (52A39) Numerical computation of solutions to systems of equations (65H10) 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
• scientific article; zbMATH DE number 4179164
• 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

(32)

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

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)