Abstract
Heuristic, structure preserving algorithms are presented, based on Breuer's grow factor algorithm, for finding common subexpressions in a set of multivariate polynomials with integer coefficients. It is shown how these polynomials can be decomposed into a set of linear expressions and a set of monomials, interrelated via hierarchical structure information, the "noise". Then algorithms are shortly discussed to find common subexpressions, by reducing the arithmetic complexity of both sets, when viewing them as blocks of straightline code, and for communicating subresults between both sets, called "noise conquering". Further extensions are shortly indicated.
Keywords
- Nonzero Element
- Automatic Differentiation
- Multivariate Polynomial
- Arithmetic Complexity
- Integer Coefficient
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Johnson, S.C., Ullmann, J.D.: Code generation for expressions with common subexpressions. J. ACM 24,1, 146–160 (1977).
Aho, A.V., Ullmann, J.D.: The theory of parsing, translating and compiling, Vol II: Compiling. Englewoods Cliffs, N.J.: Prentice Hall (1973).
Aho, A.V., Ullmann, J.D.: Principles of compiler design. Reading, Mass: Addison Wesley (1979).
Allen, F.E.: Annotated bibliography of selected papers on program optimization. Yorktown Heights, N.Y.: IBM Research Report RC 5889 (1976).
Breuer, M.A.: Generation of optimal code for expressions via factorization. C.ACM 12,6, 333–340 (1969).
Bruno, J., Sethi, R.: Code generation for a one-register machine. J.ACM 23,3, 502–510 (1976).
Buchberger,B. Loos,R.: Algebraic simplification. Computer Algebra (B.Buchberger, G.E.Collins, R.Loos, ed's), Computing Supplementum 4 (1982).
Cook,Jr.,G.O.: Development of a magnetohydrodynamic code for axisymmetric, high-βplasmas with complex magnetic fields. Lawrence Livermore Nat. Lab.Cal.: Ph.D. Thesis (December 1982).
Gonzales, T., Ja'Ja', J.: Evaluation of arithmetic expressions with algebraic identities. SIAM J. Comp. 11, 4, 633–662 (1982).
Hulshof,B.J.A., van Hulzen,J.A., Smith,J.: Code optimization facilities applied in the NETFORM context.Twente University of Technology,TW-memorandum 368 (1981).
Hulshof,B.J.A.: private communication.
Kedem, G.: Automatic differentiation of computer programs. ACM TOMS 6,2, 150–165 (1980).
Knuth, D.E.: The art of computer programming, Vol.2 (second edition). Reading, Mass.: Addison-Wesley Publ. Comp. (1980).
Morgenstern, J.: The linear complexity of computation. J.ACM 22,2, 184–194 (1975).
Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comp. 9,2, 230–250(1980).
Rall, L.B.: Automatic differentiation techniques and applications. Springer LNCS series nr 120. Berlin-Heidelberg-New-York: Springer Verlag (1981).
Smit, J.: A cancellation free algorithm, with factoring capabilities for the efficient solution of large, sparse sets of equations. Proceedings SYMSAC '81 (P.S. Wang, ed.), 146–154. New York: ACM (1981).
Smit, J., van Hulzen, J.A., Hulshof, B.J.A.: NETFORM and code optimizer manual SIGSAM Bulletin 15,4, 23–32. New York: ACM (1981).
Smit, J., van Hulzen, J.A.: Symbolic-numeric methods in microwave technology. Proceedings EUROCAM '82 (J. Calmet, ed.). Springer LNCS series nr. 144,281–238. Berlin-Heidelberg-New York: Springer Verlag (1982).
van Hulzen, J.A.: Breuer's grow factor algorithm in computer algebra. Proceedings SYMSAC '81 (P.S. Wang, ed.), 100–104. New York: ACM (1981).
van Hulzen, J.A., Hulshof, B.J.A.: An expression analysis package for REDUCE. SIGSAM Bulletin 16,4. New York: ACM (1982).
Yao, A.C.C.: On the evaluation of powers. SIAM J. Comp. 5,1, 100–103 (1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
van Hulzen, J.A. (1983). Code optimization of multivariate polynomial schemes: A pragmatic approach. In: van Hulzen, J.A. (eds) Computer Algebra. EUROCAL 1983. Lecture Notes in Computer Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12868-9_112
Download citation
DOI: https://doi.org/10.1007/3-540-12868-9_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12868-7
Online ISBN: 978-3-540-38756-5
eBook Packages: Springer Book Archive