Using monodromy to decompose solution sets of polynomial systems into irreducible components

被引：0

作者：

Sommese, AJ ^{[1
]}

Verschelde, J ^{[1
]}

Wampler, CW ^{[1
]}

机构：

[1] Univ Notre Dame, Notre Dame, IN 46556 USA

来源：

APPLICATIONS OF ALGEBRAIC GEOMETRY TO CODING THEORY, PHYSICS AND COMPUTATION | 2001年 / 36卷

关键词：

components of solutions; embedding; generic points; homotopy continuation; irreducible components; monodromy group; numerical algebraic geometry; polynomial system; primary decomposition;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

To decompose solution sets of polynomial systems into irreducible components, homotopy continuation methods generate the action of a natural monodromy group which partially classifies generic points onto their respective irreducible components. As illustrated by the performance on several test examples, this new method achieves a great increase in speed and accuracy, as well as improved numerical conditioning of the multivariate interpolation problem.

引用

页码：297 / 315

页数：19

共 23 条

[1]

[Anonymous], THESIS U CALIFORNIA

[2]

[Anonymous], P 2000 IEEE INT C RO

[3]

BJORCK G, 1990, NATO ADV SCI I C-MAT, V315, P131

[4] A FASTER WAY TO COUNT THE SOLUTIONS OF INHOMOGENEOUS SYSTEMS OF ALGEBRAIC EQUATIONS, WITH APPLICATIONS TO CYCLIC N-ROOTS [J].