Back to Search
Start Over
On factoring parametric multivariate polynomials
- Source :
-
Advances in Applied Mathematics . Oct2010, Vol. 45 Issue 4, p607-623. 17p. - Publication Year :
- 2010
-
Abstract
- Abstract: This paper presents a new algorithm for the absolute factorization of parametric multivariate polynomials over the field of rational numbers. This algorithm decomposes the parameters space into a finite number of constructible sets. The absolutely irreducible factors of the input parametric polynomial are given uniformly in each constructible set. The algorithm is based on a parametric version of Hensel''s lemma and an algorithm for quantifier elimination in the theory of algebraically closed field in order to reduce the problem of finding absolute irreducible factors to that of representing solutions of zero-dimensional parametric polynomial systems. The complexity of this algorithm is single exponential in the number n of the variables of the input polynomial, its degree d w.r.t. these variables and the number r of the parameters. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01968858
- Volume :
- 45
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Advances in Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 53380955
- Full Text :
- https://doi.org/10.1016/j.aam.2010.03.006