An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations

被引:2
作者
Ayad, Ali [1 ]
Fares, Ali [1 ]
Ayyad, Youssef [1 ]
机构
[1] Univ Libanaise, Fac Sci, Sect 1, Equipe Algebre & Combinatoire,EDST, Hadath, Lebanon
来源
JOURNAL OF NONLINEAR SCIENCES AND APPLICATIONS | 2012年 / 5卷 / 06期
关键词
Symbolic computation; complexity analysis; theory of resultants; algebraic polynomial systems; parametric systems; Rational Univariate Representation; parametric Gaussian elimination; QUANTIFIER ELIMINATION; COMPLEXITY;
D O I
10.22436/jnsa.005.06.03
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper presents a new algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations. This algorithm is based on the computation of what we call parametric U-resultants. The parameters space, i.e., the set of values of the parameters is decomposed into a finite number of constructible sets. The solutions of the input polynomial system are given uniformly in each constructible set by Polynomial Univariate Representations. The complexity of this algorithm is single exponential in the number n of the unknowns and the number r of the parameters.
引用
收藏
页码:426 / 438
页数:13
相关论文
共 41 条
[1]  
[Anonymous], 2003, Algorithms in Real Algebraic Geometry
[2]  
BUCHBERGER B, 1985, MULTIDIMENSIONAL SYS, P374
[3]  
BUCHBERGER B., 1983, COMPUTER ALGEBRA SYM
[4]   Vandermonde matrices, NP-completeness, and transversal subspaces [J].
Chistov, A ;
Fournier, H ;
Gurvits, L ;
Koiran, P .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2003, 3 (04) :421-427
[5]  
Chistov A., 1986, J Sov Math, V34, P1838, DOI DOI 10.1007/BF01095643
[6]  
Chistov A.L., 1983, LOMI PREPRINT
[7]  
CHISTOV AL, 1984, LECT NOTES COMPUT SC, V176, P17
[8]  
Cox D., 1997, Ideals, Varieties, and Algorithms
[9]  
Dahan X., P ISSAC 2004
[10]  
Gatermann Karin., 2003, EXISTENCE 3 POSITIVE