X. Dahan
Abstract
The standard approach for computing with an algebraic number is through the data of its irreducible minimal polynomial over some base field k. However, in typical tasks such as polynomial system solving, involving many algebraic numbers of high degree, following this approach will require using probably costly factorization algorithms. Della Dora, Dicrescenzo and Duval introduced "dynamic evaluation" techniques (also termed "D5 principle") [3] as a means to compute with algebraic numbers, while avoiding factorization. Roughly speaking, this approach leads one to compute over direct products of field extensions of k, instead of only field extensions.
In this work, we address complexity issues for basic operations in such structures. Precisely, let
[EQUATION]
be a family of polynomials, called a <i>triangular set</i>, such that <i>k</i> ← <i>K</i> = <i>k</i>[<i>X</i><inf>1</inf>,...,<i>X<inf>n</inf></i>]/<b>T</b> is a direct product of field extensions. We write δ for the dimension of <i>K</i> over <i>k</i>, which we call the <i>degree</i> of <b>T.</b> Using fast polynomial multiplication and Newton iteration for power series inverse, it is a folklore result that for any ε > 0, the operations (+, X) in <i>K</i> can be performed in <i>c</i><sup><i>n</i></sup><inf>ε</inf>δ<sup>1+ε</sup> operations in <i>k</i>, for some constant <i>c</i><inf>ε</inf>. Using a fast Euclidean algorithm, a similar result easily carries over to inversion, <i>in the special case when K is a field.</i>
Our main results are similar estimates for the general case, where <i>K</i> is merely a product of fields. Following the D5 philosophy, meeting zero-divisors in the computation will lead to <i>splitting</i> the triangular set <b>T</b> into a family thereof, defining the same extension. Inversion is then replaced by <i>quasi-inversion:</i> a quasi-inverse [6] of α ∈ <i>K</i> is a splitting of <b>T</b>, such that α is either zero or invertible in each component, together with the data of the corresponding inverses.
- D. J. Bernstein. Factoring into coprimes in essentially linear time. J. Algorithms, 54(1):1--30, 2005. Google Scholar
Digital Library
- X.Dahan, M. Moreno Maza, É. Schost, W. Wu and Y. Xie. Lifting techniques for triangular decompositions. In proc. ISSAC'05, 2005. Google ScholarDigital Library
- J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Eurocal '85 Vol. 2, volume 204 of Lecture Notes in Computer Science, pages 289--290, 1985. Google ScholarDigital Library
- J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999. Google ScholarDigital Library
- T. Gautier and J.-L. Roch. NC2 computation of gcd-free basis and application to parallel algebraic numbers computation. In PASCO'97, pages 31--37. ACM Press, 1997. Google ScholarDigital Library
- M. Moreno Maza and R. Rioboo. Polynomial gcd computations over towers of algebraic extensions. In Proc. AAECC-11, pages 365--382. Springer, 1995. Google ScholarDigital Library
Index Terms
- On the complexity of the D5 principle
Recommendations
Sheffer polynomials, monomiality principle, algebraic methods and the theory of classical polynomials
The Sheffer polynomials and the monomiality principle, along with the underlying operational formalism, offer a powerful tool for investigation of the properties of a wide class of polynomials. We present, within such a context, a self-contained theory ...
Complexity analysis of hypergeometric orthogonal polynomials
The complexity measures of the Crámer-Rao, Fisher-Shannon and LMC (López-Ruiz, Mancini and Calvet) types of the Rakhmanov probability density n ( x ) = ω ( x ) p n 2 ( x ) of the polynomials p n ( x ) orthogonal with respect to the weight function ω ( x ...
Comments