alphaCertified

swMATH7351MaRDI QIDQ19386

No author found.

Related Items (60)

Certifying approximate solutions to polynomial systems on Macaulay2 ⋮ Certification for polynomial systems via square subsystems ⋮ Polymake.jl: A New Interface to polymake ⋮ On the equations defining some Hilbert schemes ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials ⋮ Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety ⋮ A primal-dual formulation for certifiable computations in Schubert calculus ⋮ A certified numerical algorithm for the topology of resultant and discriminant curves ⋮ Certifying reality of projections ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ A certified iterative method for isolated singular roots ⋮ Machine learning the real discriminant locus ⋮ Certification of Approximate Roots of Exact Polynomial Systems ⋮ Certified Hermite matrices from approximate roots ⋮ Computing multiple zeros of polynomial systems: case of breadth one (invited talk) ⋮ Certifying simple zeros of over-determined polynomial systems ⋮ The convergence conditions of interval Newton's method based on point estimates ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions ⋮ Robust certified numerical homotopy tracking ⋮ Numerically computing real points on algebraic sets ⋮ Necklaces count polynomial parametric osculants ⋮ Validating the Completeness of the Real Solution Set of a System of Polynomial Equations ⋮ Identifying the number of components in Gaussian mixture models using numerical algebraic geometry ⋮ Algorithm 921 ⋮ Using monodromy to avoid high precision in homotopy continuation ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Generic properties of dispersion relations for discrete periodic operators ⋮ General witness sets for numerical algebraic geometry ⋮ Statistics of stationary points of random finite polynomial potentials ⋮ Mixed precision path tracking for polynomial homotopy continuation ⋮ Foreword. What is numerical algebraic geometry? ⋮ Mixed cell computation in HOM4ps ⋮ Certifying solutions to square systems of polynomial-exponential equations ⋮ A lifted square formulation for certifiable Schubert calculus ⋮ A new deflation method for verifying the isolated singular zeros of polynomial systems ⋮ Seven mutually touching infinite cylinders ⋮ Experimentation in the Schubert Calculus ⋮ The Secant Conjecture in the Real Schubert Calculus ⋮ Real Root Isolation of Polynomial Equations Based on Hybrid Computation ⋮ 96120 : The degree of the linear orbit of a cubic surface ⋮ Numerical algebraic geometry: a new perspective on gauge and string theories ⋮ Numerical elimination and moduli space of vacua ⋮ Solving decomposable sparse systems ⋮ 3264 Conics in a Second ⋮ Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems ⋮ Numerical polynomial homotopy continuation method and string vacua ⋮ Homotopy techniques for tensor decomposition and perfect identifiability ⋮ Computing complex and real tropical curves using monodromy ⋮ Adaptive strategies for solving parameterized systems using homotopy continuation ⋮ Solving polynomial systems via homotopy continuation and monodromy ⋮ Smooth points on semi-algebraic sets ⋮ Real solutions to systems of polynomial equations and parameter continuation ⋮ Euclidean distance degree and mixed volume ⋮ Smooth points on semi-algebraic sets ⋮ Exact solutions in log-concave maximum likelihood estimation ⋮ Probabilistic Saturations and Alt’s Problem ⋮ A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields ⋮ Epsilon local rigidity and numerical algebraic geometry

This page was built for software: alphaCertified