Abstract
Computer algebra is increasingly used in research and applied computations. An example is tensor computations or, in a wide sense, simplification of expressions containing indices. In this paper, the method of colored graphs designed for simplifying abstract expressions containing indices is developed for the case when the indices are of different types. An example of such indices are upper and lower indices in tensor expressions. The proposed approach significantly reduces the number of combinations to be considered when the canonical form of the expression is sought; as a result, the computations are drastically accelerated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
