scholarly journals Computing Singular Points of Projective Plane Algebraic Curves by Homotopy Continuation Methods

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Zhongxuan Luo ◽  
Erbao Feng ◽  
Jielin Zhang

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.

Acta Numerica ◽  
1997 ◽  
Vol 6 ◽  
pp. 399-436 ◽  
Author(s):  
T. Y. Li

Let P(x) = 0 be a system of n polynomial equations in n unknowns. Denoting P = (p1,…, pn), we want to find all isolated solutions offor x = (x1,…,xn). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Gröbner bases, are the classical approach to solving (1.1), but their reliance on symbolic manipulation makes those methods seem somewhat unsuitable for all but small problems.


Sign in / Sign up

Export Citation Format

Share Document