Homotopies for Intersecting Solution Components of Polynomial Systems
From MaRDI portal
Recommendations
- Solving polynomial systems equation by equation
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Numerically intersecting algebraic varieties via witness sets
Cited in
(17)- A homotopy for solving polynomial systems
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Numerically computing real points on algebraic sets
- The numerical algebraic geometry of bottlenecks
- A homotopy method with adaptive basis selection for computing multiple solutions of differential equations
- An intrinsic homotopy for intersecting algebraic varieties
- Cell decomposition of almost smooth real algebraic surfaces
- Sampling algebraic sets in local intrinsic coordinates
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- Regeneration homotopies for solving systems of polynomials
- Numerical algebraic geometry and algebraic kinematics
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- scientific article; zbMATH DE number 1008335 (Why is no real title available?)
- Foreword. What is numerical algebraic geometry?
- A hybrid symbolic-numerical approach to the center-focus problem
- Solving polynomial systems equation by equation
- Regenerative cascade homotopies for solving polynomial systems
This page was built for publication: Homotopies for Intersecting Solution Components of Polynomial Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4653921)