Computing isolated roots of sparse polynomial systems in affine space
From MaRDI portal
algorithmscomplexitysparse systemscoding theoryprobabilistic algorithmAffineSolveisolated common zerospolyhedral deformationssparse polynomial systems
Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04) Complexity of computation (including implicit computational complexity) (03D15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Recommendations
- Affine solution sets of sparse polynomial systems
- scientific article; zbMATH DE number 1827070
- Deformation techniques for sparse systems
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- scientific article; zbMATH DE number 1263385
- scientific article; zbMATH DE number 1552220
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Solving polynomial equations. Foundations, algorithms, and applications
- The complexity and geometry of numerically solving polynomial systems
Cites work
- scientific article; zbMATH DE number 3620034 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 2051430 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A convex geometric approach to counting the roots of a polynomial system
- Algorithms in real algebraic geometry
- Bernstein's theorem in affine space
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Counting affine roots of polynomial systems via pointed Newton polytopes
- Deformation techniques for efficient polynomial equation solving.
- Deformation techniques for sparse systems
- Dynamic enumeration of all mixed cells
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Finding mixed cells in the mixed volume computation
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- How to count efficiently all affine roots of a polynomial system
- Mixed volume computation for semi-mixed systems
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Modern computer algebra
- Newton polyhedra and toroidal varieties
- Newton polytopes and the Bezout theorem
- Straight-line programs in geometric elimination theory
- The BKK root count in $\mathbf {C}^n$
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The computational complexity of the Chow form
- The number of roots of a system of equations
Cited in
(13)- Solving determinantal systems using homotopy techniques
- Toric eigenvalue methods for solving sparse polynomial systems
- On the multiplicity of isolated roots of sparse polynomial systems
- Deformation techniques for sparse systems
- scientific article; zbMATH DE number 1736029 (Why is no real title available?)
- Computing critical points for invariant algebraic systems
- Affine solution sets of sparse polynomial systems
- Elimination for generic sparse polynomial systems
- Global residues for sparse polynomial systems
- A complexity chasm for solving sparse polynomial equations over \(p\)-adic fields. Extended abstract
- Solving decomposable sparse systems
- Efficiently Computing Real Roots of Sparse Polynomials
- Homotopy techniques for solving sparse column support determinantal polynomial systems
This page was built for publication: Computing isolated roots of sparse polynomial systems in affine space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410703)
