期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Numerical realization of the conditions of Max Nther's residual intersection theorem
1
作者 LUO Zhong-xuan feng er-bao ZHANG Jie-lin 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2014年第4期481-502,共22页
The aim of this paper is to study numerical realization of the conditions of Max Nother's residual intersection theorem. The numerical realization relies on obtaining the inter- section of two algebraic curves by hom... The aim of this paper is to study numerical realization of the conditions of Max Nother's residual intersection theorem. The numerical realization relies on obtaining the inter- section of two algebraic curves by homotopy continuation method, computing the approximate places of an algebraic curve, getting the exact orders of a polynomial at the places, and determin- ing the multiplicity and character of a point of an algebraic curve. The numerical experiments show that our method is accurate, effective and robust without using multiprecision arithmetic, even if the coefficients of algebraic curves are inexact. We also conclude that the computational complexity of the numerical realization is polynomial time. 展开更多
关键词 algebraic curve Puiseux expansion PLACE homotopy continuation multiple root.
下载PDF
Computing Numerical Singular Points of Plane Algebraic Curves
2
作者 Luo ZHONG-XUAN feng er-bao Hu WEN-YU 《Communications in Mathematical Research》 CSCD 2012年第2期146-158,共13页
Given an irreducible plane algebraic curve of degree d 〉 3, we compute its numerical singular points, determine their multiplicities, and count the number of distinct tangents at each to decide whether the singular p... Given an irreducible plane algebraic curve of degree d 〉 3, we compute its numerical singular points, determine their multiplicities, and count the number of distinct tangents at each to decide whether the singular points are ordinary. The numerical procedures rely on computing numerical solutions of polynomial systems by homotopy continuation method and a reliable method that calculates multiple roots of the univariate polynomials accurately using standard machine precision. It is completely different from the traditional symbolic computation and provides singular points and their related properties of some plane algebraic curves that the symbolic software Maple cannot work out. Without using multiprecision arithmetic, extensive numerical experiments show that our numerical procedures are accurate, efficient and robust, even if the coefficients of plane algebraic curves are inexact. 展开更多
关键词 numerical singular point MULTIPLICITY ordinary homotopy continuation
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部