Abstract
An elementary introduction to computer-based symbolic mathematical computation is presented. Features of symbolic computation as contrasted by familiar numerical computation are described. Some insight into how these symbolic systems work, the internal organization, and data structures are given. Two examples of basic algorithms implemented in symbolic computational systems are provided.
Work reported herein has been supported in part by the National Science Foundation under Grant MCS 82-01239, and in part by the Department of Energy under Grant DE-AC02-ER7602075-A010.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van Hulzen, J. A. and Calmet, J.: “Computer Algebra Systems” in Buchberger, B., Collins, G. E., and Loos, R., ed. Computer Algebra, Symbolic and Algebraic Manipulation Springer-Verlag, Wien, New York (1983).
Knuth, D. E.: Seminumerical Algorithms, The Art of Computer Programming Vol. 2, 2nd ed., Addison-Wesley, Reading, Mass. (1980).
Pavelle, R., Rothstein, M. and Fitch J. P.: “Computer Algebra,” Scientific American 245 (December 1981).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Kluwer Academic Publishers
About this chapter
Cite this chapter
Wang, P.S. (1985). Modern Symbolic Mathematical Computation Systems. In: Pavelle, R. (eds) Applications of Computer Algebra. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-6888-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6888-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-6890-8
Online ISBN: 978-1-4684-6888-5
eBook Packages: Springer Book Archive