International audienceWe formalize an algorithm to change the representation of a polynomial to a Newton power series. This provides a way to compute efficiently polynomials whose roots are the sums or products of roots of other polynomials, and hence provides a base component of efficient computation for algebraic numbers. In order to achieve this, we formalize a notion of truncated power series and develop an abstract theory of poles of fractions
AbstractThis paper explores the power series expansions of polynomial equations in N variables. Expa...
We propose fast algorithms for computing composed products and composed sums, as well as diamond pro...
Dedicated to Wolfgang Schmidt on the occasion of his sixtieth birthday. Abstract. In this paper we p...
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Pui...
International audienceEfficient algorithms are known for many operations on truncated power series (...
AbstractWe have designed a new symbolic–numeric strategy for computing efficiently and accurately fl...
International audienceWe have designed a new symbolic-numeric strategy for computing efficiently and...
For a polynomial P(z) = α0 + α1z + ... + αnzn = αn (z – z1) (z – z2) ... (z – zn), the power sums S...
In this paper we present various algorithms for multiplying multivariate polynomials and series. All...
Formal power series (FPS) of the form Σk=0∞ak(x−x0)k are important in calculus and complex analysis....
The classical Newton polygon is a device for computing the fractional power series expansions of alg...
International audienceLet L be a field of characteristic p with q elements and F ∈ L[X, Y ] be a pol...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
International audienceAlgebraic algorithms deal with numbers, vectors, matrices, polynomials, formal...
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmeti...
AbstractThis paper explores the power series expansions of polynomial equations in N variables. Expa...
We propose fast algorithms for computing composed products and composed sums, as well as diamond pro...
Dedicated to Wolfgang Schmidt on the occasion of his sixtieth birthday. Abstract. In this paper we p...
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Pui...
International audienceEfficient algorithms are known for many operations on truncated power series (...
AbstractWe have designed a new symbolic–numeric strategy for computing efficiently and accurately fl...
International audienceWe have designed a new symbolic-numeric strategy for computing efficiently and...
For a polynomial P(z) = α0 + α1z + ... + αnzn = αn (z – z1) (z – z2) ... (z – zn), the power sums S...
In this paper we present various algorithms for multiplying multivariate polynomials and series. All...
Formal power series (FPS) of the form Σk=0∞ak(x−x0)k are important in calculus and complex analysis....
The classical Newton polygon is a device for computing the fractional power series expansions of alg...
International audienceLet L be a field of characteristic p with q elements and F ∈ L[X, Y ] be a pol...
International audienceWe give an algorithm for computing all roots of polynomials over a univariate ...
International audienceAlgebraic algorithms deal with numbers, vectors, matrices, polynomials, formal...
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmeti...
AbstractThis paper explores the power series expansions of polynomial equations in N variables. Expa...
We propose fast algorithms for computing composed products and composed sums, as well as diamond pro...
Dedicated to Wolfgang Schmidt on the occasion of his sixtieth birthday. Abstract. In this paper we p...