The Internet Archive has a preservation copy of this work in our general collections.
The file type is
These lectures give a brief introduction to the Computer Algebra systems Reduce and Maple. The aim is to provide a systematic survey of most important commands and concepts. In particular, this includes a discussion of simplification schemes and the handling of simplification and substitution rules (e.g., a Lie Algebra is implemented in Reduce by means of simplification rules). Another emphasis is on the different implementations of tensor calculi and the exterior calculus by Reduce and MaplearXiv:cs/0105033v1 fatcat:um67ya34jff33meea3bcg2jlmi