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

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...

Full description

Saved in:
Bibliographic Details
Published in2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing pp. 21 - 28
Main Authors Hodorog, M, Mourrain, B, Schicho, J
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2010
Subjects
Accuracy
Convergence
Electronic mail
Labeling
Polynomials
Tin
Online AccessGet full text
ISBN1424498163
9781424498161
DOI10.1109/SYNASC.2010.41

Cover

More Information
Summary: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.
ISBN:1424498163
9781424498161
DOI:10.1109/SYNASC.2010.41