A Symbolic-Numeric Algorithm for Computing the Alexander Polynomial of a Plane Curve Singularity

Mădălina Hodorog 1 Bernard Mourrain 2 Josef Schicho 1
2 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute efficient and accurate results. Nonetheless the problem we are dealing with is ill-posed, in the sense that tiny perturbations in the coefficients of the defining polynomial cause huge errors in the computed results.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download


https://hal.inria.fr/inria-00542193
Contributor : Bernard Mourrain <>
Submitted on : Thursday, December 2, 2010 - 9:26:27 AM
Last modification on : Thursday, January 11, 2018 - 4:14:56 PM
Document(s) archivé(s) le : Monday, November 5, 2012 - 11:05:57 AM

Files

synasc2010.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00542193, version 1

Collections

Citation

Mădălina Hodorog, Bernard Mourrain, Josef Schicho. A Symbolic-Numeric Algorithm for Computing the Alexander Polynomial of a Plane Curve Singularity. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Sep 2010, Timisoara, Romania. pp.21-28. ⟨inria-00542193⟩

Share

Metrics

Record views

339

Files downloads

280