Pages that link to "Item:Q2883925"
From MaRDI portal
The following pages link to Certified Numerical Homotopy Tracking (Q2883925):
Displaying 20 items.
- A primal-dual formulation for certifiable computations in Schubert calculus (Q330099) (← links)
- Combinatorial excess intersection (Q480696) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- A lifted square formulation for certifiable Schubert calculus (Q507165) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Certified predictor-corrector tracking for Newton homotopies (Q898257) (← links)
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- On the computation of rational points of a hypersurface over a finite field (Q2360665) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Sampling algebraic sets in local intrinsic coordinates (Q2429015) (← links)
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation (Q2799571) (← links)
- Complexity of an Homotopy Method at the Neighbourhood of a Zero (Q2832953) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← 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)