Computing Singular Points of Projective Plane Algebraic Curves by Homotopy Continuation Methods
We present an algorithm that computes the singular points of projective plane algebraic curves and determines their multiplicities and characters. The feasibility of the algorithm is analyzed. We prove that the algorithm has the polynomial time complexity on the degree of the algebraic curve. The al...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2014/230847 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We present an algorithm that computes the singular points of projective plane algebraic curves and determines their multiplicities and characters. The feasibility of the algorithm is analyzed. We prove that the algorithm has the polynomial time complexity on the degree of the algebraic curve. The algorithm involves the combined applications of homotopy continuation
methods and a method of root computation of univariate polynomials. Numerical experiments show that our algorithm is feasible and efficient. |
---|---|
ISSN: | 1026-0226 1607-887X |