A polynomial decomposition algorithm

Authors:
David R. Barton;Richard E. Zippel
Affiliations:
-;-
Venue:
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Year:
1976

Citing 0
Cited 5

Polynomial decomposition algorithms

Journal of Symbolic Computation
Rational function decomposition

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
On the functional decomposition of multivariate laurent polynomials (abstract only)

ACM Communications in Computer Algebra
Algorithms for the Functional Decomposition of Laurent Polynomials

Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Lower bounds for decomposable univariate wild polynomials

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) &equil; g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.