The following pages link to (Q5447288):
Displaying 12 items.
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Unification and extension of intersection algorithms in numerical algebraic geometry (Q1737155) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Sampling algebraic sets in local intrinsic coordinates (Q2429015) (← links)
- Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling (Q2788631) (← links)
- Regeneration homotopies for solving systems of polynomials (Q3081287) (← links)
- Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials (Q3576571) (← links)
- Evaluating and Differentiating a Polynomial Using a Pseudo-witness Set (Q5039556) (← links)
- \(u\)-generation: solving systems of polynomials equation-by-equation (Q6140899) (← links)
