Algebraic computation of resolvents without extraneous powers

Authors:
Philippe Aubry;Annick Valibouze
Affiliations:
LIP6, Université Pierre et Marie Curie (Paris 6), 4, place Jussieu, F-75252 Paris Cedex 05, France;LIP6, LSTA, Université Pierre et Marie Curie (Paris 6), 4, place Jussieu, F-75252 Paris Cedex 05, France
Venue:
European Journal of Combinatorics
Year:
2012

Citing 6
Cited 1

Polynomial decomposition algorithms

Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Resolvent computations by resultants without extraneous powers

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Automatic Computations with Power Series

Journal of the ACM (JACM)
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Using Galois ideals for computing relative resolvents

Journal of Symbolic Computation - Algorithmic methods in Galois Theory

Algorithms for the universal decomposition algebra

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for computing algebraically relative resolvents which enhances an existing algorithm by avoiding the accumulation of superfluous powers in the intermediate computations. The superfluous power generated at each step is predetermined over a certain quotient ring. As a byproduct, an efficient algorithm for extracting an n-th root of a univariate polynomial is obtained.