Abstract
Algebraic computation systems produce results for either human or machine consumption. In the latter case, numerical evaluation of the resulting expressions is often the goal. In either case, it is important to produce results in an appropriately optimal form. In this paper, we consider some of the methods available for doing this. In particular, we shall see that several of our techniques mirror the methods used by human experts. In addition, we shall mention some new algorithms that promise to make the whole problem more tractable mathematically.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. C. Hearn, “The Personal Algebra Machine”, Information Processing 80 (Proc. IFIP Congress 80), North-Holland, 1980, 621–628.
W. Leler and N. Soiffer, “An Interactive Graphical Interface for Symbolic Algebra Systems”, this proceedings.
B. L. Gates and P. S. Wang, “A LISP-Based RATFOR Code Generator”, Proc. 1984 MACSYMA User's Conf., General Electric, Schenectady, New York, 1984, 319–329.
B. L. Gates, “GENTRAN: An Automatic Code Generation Facility for REDUCE”, SIGSAM Bulletin (to appear).
G. O. Cook, Jr., “Development of a Magnetohydrodynamic Code for Axisymmetric, High-beta Plasmas with Complex Magnetic Fields”, Lawrence Livermore National Laboratory Report No. UCRL-53324, 1982.
A. C. Hearn, “The Problem of Substitution”, Proc. of the IBM Summer Institute on Symbolic Mathematics by Computer, IBM Programming Laboratory Report No. FSC-69-0312 (1969).
A. C. Hearn, “Structure: The Key to Improved Algebraic Computation”, Proc. RSYMSAC, World Scientific Publ Co, Singapore, 1985 (in press).
W. S. Brown, “On Computing with Factored Rational Expressions”, SIGSAM Bulletin 31 (1974) 27–34.
A. C. Hearn, “The Structure of Algebraic Computations”, Proc. of the Fourth Colloquium on Advanced Methods in Theoretical Physics, 1–15, St. Maximin, France, 1977.
P. S. Wang, T. Y. P. Chang and J. A. Van Hulzen, “Code Generation and Optimization for Finite Element Analysis”, Proc. EUROSAM '84, 237–247, published as Lecture Notes on Comp. Science, No. 174, Springer-Verlag, Berlin, 1984.
R. S. Brenner, private communication.
B. J. A. Hulshof and J. A. van Hulzen, “An Expression Compression Package for REDUCE based on Factorization and Controlled Expansion”, informal contribution presented at EUROCAL 85, Linz, Austria, April 1–3, 1985.
J. Van Hulzen, “Code Optimization of Multivariate Polynomial Schemes: A Pragmatic Approach”, Proc. EUROCAL '83, 286–300, published as Lecture Notes on Comp. Science, No. 162, Springer-Verlag, Berlin, 1983.
M. A. Breuer, “Generation of Optimal Code for Expressions via Factorization”, CACM 12 (1969) 333–340.
B. Buchberger, “Groebner Bases: An Algorithmic Method in Polynomial Ideal Theory”, to appear in N. K. Bose (Ed.): “Recent Trends in Multidimensional Systems Theory”, D. Reidel Publ. Comp, 1984. Also available as Univ. of Linz Dept. of Math Report No. CAMP 83-29.0.
L. Hornfeldt, “A Sum-Substitutor used as Trigonometric Simplifier”, Proc. EUROCAM '82, 188–195, published as Lecture Notes on Comp. Science, No. 144, Springer-Verlag, Berlin, 1982.
P. van den Heuvel and J. Marti, “Automatic Translation vs Reimplementation — An Experiment”, to be published.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hearn, A.C. (1986). Optimal evaluation of algebraic expressions. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_744
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive