Finding all real points of a complex curve
From MaRDI portal
Recommendations
Cited in
(16)- A numerical method for computing border curves of bi-parametric real polynomial systems and applications
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Cell decomposition of almost smooth real algebraic surfaces
- Isosingular sets and deflation
- Arc length based maximal Lyapunov functions and domains of attraction estimation for polynomial nonlinear systems
- Numerical irreducible decomposition over a number field
- Evaluating and differentiating a polynomial using a pseudo-witness set
- Algebraic Geometry and Kinematics
- Numerically computing real points on algebraic sets
- A certified numerical algorithm for the topology of resultant and discriminant curves
- Sweeping algebraic curves for singular solutions
- Computing real witness points of positive dimensional polynomial systems
- Mechanism mobility and a local dimension test
- Foreword. What is numerical algebraic geometry?
- Exact symbolic-numeric computation of planar algebraic curves
This page was built for publication: Finding all real points of a complex curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447349)