Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2014-01-01

Journal: DISCRETE DYNAMICS IN NATURE AND SOCIETY

Included Journals: Scopus、SCIE

Volume: 2014

ISSN: 1026-0226

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