Abstract
The computer algebra system STENSOR ("symbolic tensors") has its name from the objects originally dealt with: tensors with symbolic indices. However, since long the objects may also be anticommuting, noncommuting in various senses, spinors or eg operators, with or without indices. Its unique sum substitutor also makes it ideal whenever sum relations should be exploited. Thus it simplifies eg trigonometric expressions maximally (in demo).
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hörnfeldt, L. (1985). Demo of stensor. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_257
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_257
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive