Polyhedral end games for polynomial continuation

From MaRDI portal
Publication:1272646

DOI10.1023/A:1019163811284zbMath0933.65057MaRDI QIDQ1272646

Birkett Huber, Jan Verschelde

Publication date: 11 April 1999

Published in: Numerical Algorithms (Search for Journal in Brave)




Related Items

Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems, Isosingular sets and deflation, Numerical root finding via Cox rings, Early Ending in Homotopy Path-Tracking for Real Roots, Multiprojective witness sets and a trace test, Polyhedral homotopies in Cox coordinates, Numerically computing real points on algebraic sets, Robust continuation methods for tracing solution curves of parameterized systems, Newton polytopes and witness sets, Khovanskii-Rolle continuation for real solutions, A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation, Unification and extension of intersection algorithms in numerical algebraic geometry, Foreword. What is numerical algebraic geometry?, Numerical Evidence for a Conjecture in Real Algebraic Geometry, Sweeping algebraic curves for singular solutions, Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry, Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling, Computing Tropical Curves via Homotopy Continuation, HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method, Solving decomposable sparse systems, An adaptive homotopy method for computing bifurcations of nonlinear parametric systems, Computing All Space Curve Solutions of Polynomial Systems by Polyhedral Methods, Toric Newton method for polynomial homotopies, Toric intersection theory for affine root counting, A family of sparse polynomial systems arising in chemical reaction systems