点击次数：

论文类型：期刊论文

发表时间：2014-01-01

发表刊物：DISCRETE DYNAMICS IN NATURE AND SOCIETY

收录刊物：SCIE、Scopus

卷号：2014

ISSN号：1026-0226

摘要：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.