On Isolating Roots in a Multiple Field Extension

by   Christina Katsamaki, et al.

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial F ∈ L[Y], where L is a multiple algebraic extension of ℚ. We provide aggregate bounds for F and algorithmic and bit-complexity results for the problem of isolating its roots. For the latter problem we follow a common approach based on univariate root isolation algorithms. For the particular case where F does not have multiple roots, we achieve a bit-complexity in 𝒪̃_B(n d^2n+2(d+nτ)), where d is the total degree and τ is the bitsize of the involved polynomials.In the general case we need to enhance our algorithm with a preprocessing step that determines the number of distinct roots of F. We follow a numerical, yet certified, approach that has bit-complexity 𝒪̃_B(n^2d^3n+3τ + n^3 d^2n+4τ).


page 1

page 2

page 3

page 4


Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials

It is well-known that every non-negative univariate real polynomial can ...

Beyond Worst-Case Analysis for Root Isolation Algorithms

Isolating the real roots of univariate polynomials is a fundamental prob...

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

Given a zero-dimensional polynomial system consisting of n integer polyn...

Complexity Analysis of Root Clustering for a Complex Polynomial

Let F(z) be an arbitrary complex polynomial. We introduce the local root...

Quadratic Extensions in ACL2

Given a field K, a quadratic extension field L is an extension of K that...

The Complexity of Computing all Subfields of an Algebraic Number Field

For a finite separable field extension K/k, all subfields can be obtaine...

Please sign up or login with your details

Forgot password? Click here to reset