Back to Search
Start Over
Single-factor lifting and factorization of polynomials over local fields
- Source :
-
Journal of Symbolic Computation . Nov2012, Vol. 47 Issue 11, p1318-1346. 29p. - Publication Year :
- 2012
-
Abstract
- Abstract: Let be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of , with strong arithmetic properties. In this paper, we develop an algorithm to improve any one of these approximations, till a prescribed precision is attained. The most natural application of this “single-factor lifting” routine is to combine it with the Montes algorithm to provide a fast polynomial factorization algorithm. Moreover, the single-factor lifting algorithm may be applied as well to accelerate the computational resolution of several global arithmetic problems in which the improvement of an approximation to a single local irreducible factor of a polynomial is required. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 47
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 76328506
- Full Text :
- https://doi.org/10.1016/j.jsc.2012.03.001