The following pages link to Algorithm 921 (Q2989171):
Displaying 42 items.
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials (Q312198) (← links)
- A primal-dual formulation for certifiable computations in Schubert calculus (Q330099) (← links)
- A certified numerical algorithm for the topology of resultant and discriminant curves (Q346543) (← links)
- Using monodromy to avoid high precision in homotopy continuation (Q475409) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- Mixed cell computation in HOM4ps (Q507160) (← links)
- Certifying solutions to square systems of polynomial-exponential equations (Q507164) (← links)
- A lifted square formulation for certifiable Schubert calculus (Q507165) (← links)
- Numerical elimination and moduli space of vacua (Q737597) (← links)
- Numerical polynomial homotopy continuation method and string vacua (Q765439) (← links)
- Certification for polynomial systems via square subsystems (Q820969) (← links)
- Inflation of poorly conditioned zeros of systems of analytic functions (Q823834) (← links)
- A heuristic method for certifying isolated zeros of polynomial systems (Q1634514) (← links)
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety (Q1644578) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Numerically computing real points on algebraic sets (Q1956231) (← links)
- A new deflation method for verifying the isolated singular zeros of polynomial systems (Q1987424) (← links)
- Solving decomposable sparse systems (Q2048838) (← links)
- Euclidean distance degree and mixed volume (Q2098233) (← links)
- Smooth points on semi-algebraic sets (Q2100053) (← links)
- Exact solutions in log-concave maximum likelihood estimation (Q2104907) (← links)
- On the equations defining some Hilbert schemes (Q2135089) (← links)
- Mixed precision path tracking for polynomial homotopy continuation (Q2240693) (← links)
- Seven mutually touching infinite cylinders (Q2261578) (← links)
- Homotopy techniques for tensor decomposition and perfect identifiability (Q2317007) (← links)
- Computing complex and real tropical curves using monodromy (Q2318353) (← links)
- Adaptive strategies for solving parameterized systems using homotopy continuation (Q2333220) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- A certified iterative method for isolated singular roots (Q2674007) (← links)
- Machine learning the real discriminant locus (Q2674017) (← links)
- Certified Hermite matrices from approximate roots (Q2687270) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation (Q2799571) (← links)
- Statistics of stationary points of random finite polynomial potentials (Q3302413) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Algebraic compressed sensing (Q6042618) (← links)
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities (Q6076836) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials (Q6159023) (← links)
- Conics meeting eight lines over perfect fields (Q6169041) (← links)
- Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians (Q6170811) (← links)
