Journal of Symbolic Computation - Special issue on computational algebraic complexity
Algorithms for computer algebra
Algorithms for computer algebra
Approximate multivariate polynomial factorization based on zero-sum relations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
ACM '73 Proceedings of the ACM annual conference
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
A numerical study of extended Hensel series
Proceedings of the 2007 international workshop on Symbolic-numeric computation
An improved EZ-GCD algorithm for multivariate polynomials
Journal of Symbolic Computation
Convergence and many-valuedness of hensel seriesnear the expansion point
Proceedings of the 2009 conference on Symbolic numeric computation
A study of Hensel series in general case
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Hi-index | 0.03 |
The extended Hensel construction is a Hensel construction at an unlucky evaluation point for the generalized Hensel construction, and it allows as to avoid shifting the origin in multivariate polynomial factorization. We have implemented a multivariate factorization algorithm which is based on the extended Hensel construction, by solving a leading coefficient problem which is peculiar to our method. We describe the algorithm and present some experimental results. Experiments show that the extended Hensel construction is quite useful for factoring multivariate polynomials which cause large expression swell by shifting the origin.