A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
From MaRDI portal
Publication:5418491
DOI10.1090/S0025-5718-2013-02763-9zbMath1327.13102MaRDI QIDQ5418491
Publication date: 4 June 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02763-9
symmetry; homotopy method; polynomial system; hybrid algorithm; symbolic-numeric computation; mixed trigonometric polynomial system
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations
14Q99: Computational aspects in algebraic geometry
13P15: Solving polynomial systems; resultants
Related Items
Efficiently counting affine roots of mixed trigonometric polynomial systems, The natural algorithmic approach of mixed trigonometric-polynomial problems, Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- A homotopy for solving polynomial systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Computing all solutions to polynomial systems using homotopy continuation
- Solving polynomial systems
- The random product homotopy and deficient polynomial systems
- Coefficient-parameter polynomial continuation
- A new start system for solving deficient polynomial systems using continuation
- Symmetric homotopy construction
- Safe starting regions by fixed points and tightening
- Solving polynomial systems by polyhedral homotopies
- Symmetric Newton polytopes for solving sparse polynomial systems
- Numerical Solution of a Class of Deficient Polynomial Systems
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Regeneration homotopies for solving systems of polynomials
- Solving Deficient Polynomial Systems with Homotopies which Keep the Subschemes at Infinity Invariant
- A simple homotopy for solving deficient polynomial systems
- A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
- Finding All Solutions to a System of Polynomial Equations
- A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Solving Polynomial Systems Using a Branch and Prune Approach
- Algorithm 795
- The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
