A polynomial decomposition algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A polynomial decomposition algorithm

Full text

Pdf (243 KB)

Source

Symposium on Symbolic and Algebraic Manipulation archive
Proceedings of the third ACM symposium on Symbolic and algebraic computation table of contents

Yorktown Heights, New York, United States

Pages: 356 - 358

Year of Publication: 1976

Authors

David R. Barton
Richard E. Zippel

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SYMSAC : SYMSAC

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800205.806356 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Evyatar, A. and Scott, D.B., "On Polynomials in a Polynomial," Bull. London Math. Soc. 4, 176-178 (1972).
	2	Fried, M.D. and MacRae, R.E., "On Curves with Separated Variables," Math. Ann. 180, 220-226 (1969).
	3	Ritt, J.F., "Prime and Composite Polynomials," Trans. AMS 23, 51-66 (1926).

CITED BY 2

	Richard Zippel, Rational function decomposition, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.1-6, July 15-17, 1991, Bonn, West Germany
	Stephen M. Watt, On the functional decomposition of multivariate laurent polynomials (abstract only), ACM Communications in Computer Algebra, v.42 n.1-2, March/June 2008