Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
From MaRDI portal
Publication:5931634
DOI10.1016/S0096-3003(99)00115-0zbMath1023.65048MaRDI QIDQ5931634
Jan Verschelde, Mengnien Wu, Tien-Yien Li, Tang'an Gao
Publication date: 25 April 2001
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
numerical stability; balancing; path following; polyhedral homotopy continuation methods; polynomial systems
62H20: Measures of association (correlation, canonical correlation, etc.)
65H10: Numerical computation of solutions to systems of equations
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
26C10: Real polynomials: location of zeros
Related Items
An algorithm for simplex tableau reduction: The push-to-pull solution strategy, Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods, A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
Cites Work
- The number of roots of a system of equations
- Enumerating regular mixed-cell configurations
- On the Newton polytope of the resultant
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item