Resultant-based methods for plane curves intersection problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Resultant-based methods for plane curves intersection problems

Résumé

We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials and the Sylvester or Bezout resultant constructions. We propose a new method to treat multiple roots, detail its numerical aspects and describe experiments on tangential problems, which show the efficiency of the approach. An industrial application of the method is presented at the end of the paper. It consists in recovering cylinders from a large cloud of points and requires intensive resolution of polynomial equations.
Fichier principal
Vignette du fichier
casc.pdf (322.38 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00100288 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100288 , version 1

Citer

Laurent Busé, Houssam Khalil, Bernard Mourrain. Resultant-based methods for plane curves intersection problems. Computer Algebra in Scientific Computing (CASC), Sep 2005, Kalamata, Greece, pp.75-92. ⟨inria-00100288⟩
473 Consultations
1101 Téléchargements

Partager

Gmail Facebook X LinkedIn More