In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition of multivariate polynomials, and then propose an algorithm for decomposing a regular set into a finite number of simple sets. From the output of this algorithm, the multiplicities of zeros could be directly read out, and the real solution isolation with multiplicity can also be easily produced. As a main theoretical result of this paper, we analyze the structure of dual space of the saturated ideal generated by a simple set as well as a regular set. Experiments with a preliminary implementation show the efficiency of our method.
翻译:在本文中,我们关注计算零维正态集成零的倍数问题。 我们把单亚丁多面体的平方分解法普遍化为所谓的多变量多面体的伪正方无方方分解法,然后提出将一个正方数组分解成数量有限的简单数组的算法。 从这一算法的输出中,可以直接读出零的倍数,也可以很容易地生成出与多重性的真正溶解隔离。 作为本文的主要理论结果,我们分析了由简单集体和常规集体产生的饱和理想的双重空间结构。 初步实施的实验显示了我们方法的效率。