Algorithm 921
From MaRDI portal
Publication:2989171
DOI10.1145/2331130.2331136zbMath1365.65148arXiv1011.1091OpenAlexW2158516852WikidataQ113310373 ScholiaQ113310373MaRDI QIDQ2989171
Jonathan D. Hauenstein, Frank J. Sottile
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1091
Numerical computation of solutions to systems of equations (65H10) Algorithms with automatic result verification (65G20)
Related Items (54)
Certification for polynomial systems via square subsystems ⋮ Inflation of poorly conditioned zeros of systems of analytic functions ⋮ 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 solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ A certified iterative method for isolated singular roots ⋮ Machine learning the real discriminant locus ⋮ Algebraic compressed sensing ⋮ Using monodromy to recover symmetries of polynomial systems ⋮ Algebraic geometrization of the Kuramoto model: Equilibria and stability analysis ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Rigid continuation paths II. structured polynomial systems ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials ⋮ Certified Hermite matrices from approximate roots ⋮ Conics meeting eight lines over perfect fields ⋮ Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians ⋮ Effective Reconstruction of Generic Genus 5 Curves from their Theta Hyperplanes ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Robust certified numerical homotopy tracking ⋮ Numerically computing real points on algebraic sets ⋮ Identifying the number of components in Gaussian mixture models using numerical algebraic geometry ⋮ 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 ⋮ 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 ⋮ 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 elimination and moduli space of vacua ⋮ Solving decomposable sparse systems ⋮ 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 ⋮ Euclidean distance degree and mixed volume ⋮ Smooth points on semi-algebraic sets ⋮ Numerical Computation of the Hilbert Function and Regularity of a Zero Dimensional Scheme ⋮ Exact solutions in log-concave maximum likelihood estimation ⋮ Probabilistic Saturations and Alt’s Problem ⋮ Experiments on the Zeros of Harmonic Polynomials Using Certified Counting ⋮ Epsilon local rigidity and numerical algebraic geometry
Uses Software
This page was built for publication: Algorithm 921
