A certified numerical algorithm for the topology of resultant and discriminant curves

DOI10.1016/j.jsc.2016.03.011zbMath1354.14052arXiv1412.3290OpenAlexW2315753911MaRDI QIDQ346543

Guillaume Moroz, Marc Pouget, Rémi Imbach

Publication date: 29 November 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3290

zbMATH Keywords

singularitiessubresultantinterval arithmeticdiscriminantresultantnumerical algorithmnode and cusp singularitiestopology of algebraic curves

Mathematics Subject Classification ID

Real algebraic sets (14P05) Plane and space curves (14H50) Computational aspects of algebraic curves (14Q05) Singularities of curves, local rings (14H20) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

Visualizing planar and space implicit real algebraic curves with singularities ⋮ Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves ⋮ Reliable Computation of the Singularities of the Projection in $$\mathbb R^3$$ of a Generic Surface of $$\mathbb R^4$$

Uses Software

• HOM4PS
• MPFI
• INTOPT_90
• Bertini
• alphaCertified
• ISOLATE
• insulate

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ISOLATE
• Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
• Deflation algorithm for the multiple roots of a system of nonlinear equations
• On the topology of real algebraic plane curves
• Topology and arrangement computation of semi-algebraic planar curves
• Fixed points, zeros and Newton's method
• On location and approximation of clusters of zeros: Case of embedding dimension one
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• On the number of branches of an 1-dimensional semianalytic set
• Homotopies for solving polynomial systems within a bounded domain
• Rigorous global search: continuous problems
• An elementary approach to subresultants theory.
• Efficient isolation of polynomial's real roots.
• Robust certified numerical homotopy tracking
• Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
• Newton's method with deflation for isolated singularities of polynomial systems
• A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\)
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• Algorithm 921
• Explicit factors of some iterated resultants and discriminants
• Safe Starting Regions for Iterative Methods
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
• Exclusion Regions for Systems of Equations
• Using Algebraic Geometry
• On the complexity of solving a bivariate polynomial system
• Deflation and certified isolation of singular zeros of polynomial systems
• On the exact computation of the topology of real algebraic curves
• Certified Parallelotope Continuation for One-Manifolds

This page was built for publication: A certified numerical algorithm for the topology of resultant and discriminant curves