Symbolic Computation Group

David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, Ontario, Canada

Tensor Algebra, Notation, and Finite Groups
Gerrard Liddell, University of Otago, New Zealand
Friday, September 7, 2001, at U. of Waterloo.

Abstract:

A recent PhD by Jason Harris has provided efficient algorithms for the computation of canonical forms for tensor expressions. He also created the first package for the manipulation of traditional tensor expressions as used in general relativity.

The tensor simplification is based on a new class of finite groups. The analysis of these groups involves the Schreier Simms algorithm for strong group bases. These results will be described and illustrated by an interactive implemention in Mathematica.

 

Last modified on Sunday, 04 November 2012, at 20:42 hours.