Direct polyhedral homotopy methods for solving mixed trigonometric polynomial systems
From MaRDI portal
Trigonometric polynomials, inequalities, extremal problems (42A05) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical methods for trigonometric approximation and interpolation (65T40)
Recommendations
- A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- scientific article; zbMATH DE number 6795672
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Mixed cell computation in HOM4ps
Cited in
(7)- Efficiently counting affine roots of mixed trigonometric polynomial systems
- The natural algorithmic approach of mixed trigonometric-polynomial problems
- A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
- A fast algorithm for a class of nonlinear systems in signal processing
- scientific article; zbMATH DE number 6795672 (Why is no real title available?)
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- Isolating all the real roots of a mixed trigonometric-polynomial
This page was built for publication: Direct polyhedral homotopy methods for solving mixed trigonometric polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993347)
