swMATH7351MaRDI QIDQ19386FDOQ19386
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=2331136
Cited In (99)
- Computing complex and real tropical curves using monodromy
- VerifyRealRoots
- Smooth points on semi-algebraic sets
- Exact solutions in log-concave maximum likelihood estimation
- Smooth points on semi-algebraic sets
- 3264 conics in a second
- Machine learning the real discriminant locus
- Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
- Statistics of stationary points of random finite polynomial potentials
- Certification of Approximate Roots of Exact Polynomial Systems
- Generic properties of dispersion relations for discrete periodic operators
- General witness sets for numerical algebraic geometry
- Epsilon local rigidity and numerical algebraic geometry
- A certified iterative method for isolated singular roots
- Polymake.jl: a new interface to \texttt{polymake}
- 96120: the degree of the linear orbit of a cubic surface
- Certified Hermite matrices from approximate roots
- The average condition number of most tensor rank decomposition problems is infinite
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Validating the completeness of the real solution set of a system of polynomial equations
- Numerical elimination and moduli space of vacua
- Effective certification of approximate solutions to systems of equations involving analytic functions
- Seven mutually touching infinite cylinders
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Necklaces count polynomial parametric osculants
- A heuristic method for certifying isolated zeros of polynomial systems
- Certifying simple zeros of over-determined polynomial systems
- Homotopy techniques for tensor decomposition and perfect identifiability
- Euclidean distance degree and mixed volume
- On the equations defining some Hilbert schemes
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Numerical polynomial homotopy continuation method and string vacua
- Certifying reality of projections
- HOM4PS
- Macaulay2
- MixedVol
- MPFI
- MultRoot
- PHCpack
- STRINGVACUA
- PHoM
- Bertini
- The Secant Conjecture in the Real Schubert Calculus
- DISCOVERER
- SLA
- PHCpack
- Hom4PS-3
- NAG4M2
- Paramotopy
- Bertini_real
- rootsur.lib
- SchurRings
- NumericalAlgebraicGeometry
- NodePy
- Algorithm 931
- gfanlib
- pss5
- A primal-dual formulation for certifiable computations in Schubert calculus
- galeDuality
- DynamicPrevariety
- ellipticcovers.lib
- insulate
- HomotopyContinuation
- MonodromySolver
- Book3264Examples
- SOS.m2
- libtropicana
- Using monodromy to avoid high precision in homotopy continuation
- Overdetermined Weierstrass iteration and the nearest consistent system
- Mixed cell computation in HOM4ps
- DecomposableSparseSystems
- SegreClasses
- NumericalCertification
- RealBitangents
- Numerically computing real points on algebraic sets
- A certified numerical algorithm for the topology of resultant and discriminant curves
- The convergence conditions of interval Newton's method based on point estimates
- Solving polynomial systems via homotopy continuation and monodromy
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Solving decomposable sparse systems
- Polymake.jl
- tensegrity
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Real solutions to systems of polynomial equations and parameter continuation
- Computing multiple zeros of polynomial systems: case of breadth one (invited talk)
- A lifted square formulation for certifiable Schubert calculus
- Certifying solutions to square systems of polynomial-exponential equations
- Foreword. What is numerical algebraic geometry?
- Mixed precision path tracking for polynomial homotopy continuation
- Probabilistic saturations and Alt's problem
- A note on global Newton iteration over Archimedean and non-Archimedean fields
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Experimentation in the Schubert calculus
- Certifying approximate solutions to polynomial systems on Macaulay2
- Robust certified numerical homotopy tracking
- Certification for polynomial systems via square subsystems
This page was built for software: alphaCertified
