Faster algorithms for computing real isolated points of an algebraic hypersurface - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Faster algorithms for computing real isolated points of an algebraic hypersurface

Huu Phuoc Le

Résumé

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role for studying rigidity properties of mechanism in material designs. In this paper, we design two algorithms of whose complexities are respectively $O\ \widetilde{~}(︀D^{8n})︀$ and $O\ \widetilde{~}(︀D^{6n})︀$ for computing the real isolated points of real algebraic hypersurfaces in $\mathbb{R}^n$ of degree $D$. We also propose several heuristic optimizations to avoid the most costly computation in our algorithms in most of the cases, which makes our complexity reduced to $O\ \widetilde{~}(︀D^{3n})︀$ for those cases. These algorithms lead to an implementation which is able to solve instances which were out of reach.
Fichier principal
Vignette du fichier
mainiso.pdf (245.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03590187 , version 1 (26-02-2022)
hal-03590187 , version 2 (24-03-2022)

Identifiants

  • HAL Id : hal-03590187 , version 2

Citer

Huu Phuoc Le. Faster algorithms for computing real isolated points of an algebraic hypersurface. 2022. ⟨hal-03590187v2⟩
87 Consultations
73 Téléchargements

Partager

Gmail Facebook X LinkedIn More