Affiliation:
1. University of Bath, England
Abstract
We are concerned with factoring polynomials over algebraic extensions of the rationals, and have implemented a variant of Trager's [1976] algorithm, which reduces this problem to that of factoring polynomials over the integers, for which we use Wang's [1978] algorithm (as implemented in REDUCE [Hearn 82] by Moore and Norman [1981]). However, Trager's method often produces a norm polynomial which factors profusely modulo every prime, leading to a combinatorial explosion of trial divisions in Wang's algorithm. We present some simple divisibility tests for polynomials to help combat the cost of this explosion.
Publisher
Association for Computing Machinery (ACM)
Reference5 articles.
1. {Swinnerton-Dyer 69} H. P. F. Swinnerton-Dyer Private communication to E. Berlekamp. {Swinnerton-Dyer 69} H. P. F. Swinnerton-Dyer Private communication to E. Berlekamp.
2. Implementing a polynomial factorization and GCD package
3. Algebraic factoring and rational function integration
4. An improved multivariate polynomial factoring algorithm
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computer Algebra;digital Encyclopedia of Applied Physics;2015-03-12
2. An efficient algorithm for factoring polynomials over algebraic extension field;Science China Mathematics;2013-03-22
3. Small algorithms for small systems;ACM Communications in Computer Algebra;2012-07-23
4. The Sparsity Challenges;2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing;2009-09
5. Scratchpad's view of algebra I: Basic commutative algebra;Design and Implementation of Symbolic Computation Systems;1990