Polynomial equations: theory and practice
From MaRDI portal
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- A stabilized normal form algorithm for generic systems of polynomial equations
- Algorithm 795
- Algorithms for fundamental invariants and equivariants of finite groups
- Applications of polynomial systems. With contributions by Carlos D'Andrea, Alicia Dickenstein, Jonathan Hauenstein, Hal Schenck, and Jessica Sidman
- Bernstein's theorem in affine space
- Biochemical reaction networks: An invitation for algebraic geometers
- Computing real radicals by moment optimization
- Density of rational points on a family of del Pezzo surfaces of degree one (with an appendix by Jean-Louis Colliot-Thélène)
- Global optimization with polynomials and the problem of moments
- Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- scientific article; zbMATH DE number 1003119 (Why is no real title available?)
- scientific article; zbMATH DE number 1504686 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 7351371 (Why is no real title available?)
- Mixed precision path tracking for polynomial homotopy continuation
- msolve. A library for solving polynomial systems
- Newton polyhedra and the genus of complete intersections
- Newton polytopes and the Bezout theorem
- Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory
- Numerical algebraic geometry and algebraic kinematics
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerically solving polynomial systems with Bertini
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Solving polynomial systems via homotopy continuation and monodromy
- Solving polynomial systems via truncated normal forms
- Subdivision methods for solving polynomial equations
- Sums of squares, moment matrices and optimization over polynomials
- The Euclidean distance degree of an algebraic variety
- The Magma algebra system. I: The user language
- The number of roots of a system of equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Toric eigenvalue methods for solving sparse polynomial systems
This page was built for publication: Polynomial equations: theory and practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979702)
