Solving parameterized polynomial systems with decomposable projections
From MaRDI portal
Cites work
- Algebraic identifiability of Gaussian mixtures
- Algorithm 795
- Algorithms in invariant theory
- Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov
- Critical points via monodromy and local methods
- Galois groups of enumerative problems
- Galois groups of Schubert problems via homotopy computation
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Homotopy techniques for tensor decomposition and perfect identifiability
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Isosingular sets and deflation
- Membership tests for images of algebraic sets by linear projections
- Moment varieties of Gaussian mixtures
- Monodromy of projective curves
- Multiprojective witness sets and a trace test
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical algebraic geometry and algebraic kinematics
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Numerical computation of Galois groups
- Numerical implicitization: a Macaulay2 package
- Solving polynomial systems via homotopy continuation and monodromy
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Trace test
- Using monodromy to decompose solution sets of polynomial systems into irreducible components
- Witness sets of projections
- Über die Erzeugung gegebener ebener Kurven mit Hilfe des Gelenkviereckes.
This page was built for publication: Solving parameterized polynomial systems with decomposable projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846970)
