alphaCertified

swMATH7351MaRDI QIDQ19386FDOQ19386

Author name not available (Why is that?)

Cited In (60)

• Statistics of stationary points of random finite polynomial potentials
• 96120 : The degree of the linear orbit of a cubic surface
• Epsilon local rigidity and numerical algebraic geometry
• Computing complex and real tropical curves using monodromy
• Smooth points on semi-algebraic sets
• Algorithm 921
• Exact solutions in log-concave maximum likelihood estimation
• Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
• A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields
• Smooth points on semi-algebraic sets
• Machine learning the real discriminant locus
• Numerical elimination and moduli space of vacua
• Seven mutually touching infinite cylinders
• Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
• 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
• Polymake.jl: A New Interface to polymake
• Euclidean distance degree and mixed volume
• On the equations defining some Hilbert schemes
• Real Root Isolation of Polynomial Equations Based on Hybrid Computation
• Validating the Completeness of the Real Solution Set of a System of Polynomial Equations
• A new deflation method for verifying the isolated singular zeros of polynomial systems
• Experimentation in the Schubert Calculus
• 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
• Certification of Approximate Roots of Exact Polynomial Systems
• Numerical polynomial homotopy continuation method and string vacua
• Generic properties of dispersion relations for discrete periodic operators
• General witness sets for numerical algebraic geometry
• Certifying reality of projections
• The Secant Conjecture in the Real Schubert Calculus
• A primal-dual formulation for certifiable computations in Schubert calculus
• Using monodromy to avoid high precision in homotopy continuation
• Overdetermined Weierstrass iteration and the nearest consistent system
• Mixed cell computation in HOM4ps
• Probabilistic Saturations and Alt’s Problem
• A certified iterative method for isolated singular roots
• 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
• Certified Hermite matrices from approximate roots
• 3264 Conics in a Second
• Real solutions to systems of polynomial equations and parameter continuation
• Computing multiple zeros of polynomial systems: case of breadth one (invited talk)
• Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions
• 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
• The average condition number of most tensor rank decomposition problems is infinite
• Adaptive strategies for solving parameterized systems using homotopy continuation
• 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