ATENSOR

ATENSOR - REDUCE program for tensor simplification. Nature of problem: Simplification of tensor expressions taking into account multiterm linear identities, symmetry relations and renaming dummy indices. This problem is important for the calculations in the gravity theory, differential geometry and other fields where indexed objects arise. Solution method: The group algebra technique for permutation group is applied to construct a canonical subspace and the effective algorithm for the corresponding projection. (Source: http://cpc.cs.qub.ac.uk/summaries/)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 8 articles , 1 standard article )

Showing results 1 to 8 of 8.
Sorted by year (citations)

  1. Liu, Jiang: Normalization in Riemann tensor polynomial ring (2018)
  2. Liu, Jiang: Normalization of indexed differentials based on function distance invariants (2017)
  3. Sabahi, Farnaz; Akbarzadeh-T, Mohammad-R.: Introducing validity in fuzzy probability for judicial decision-making (2014)
  4. Liu, Jiang; Li, Hongbo; Cao, Yuanhao: Simplification and normalization of indexed differentials involving coordinate transformation (2009)
  5. Peeters, Kasper: Cadabra: a field-theory motivated symbolic computer algebra system (2007)
  6. Portugal, R.: An algorithm to simplify tensor expressions (1998)
  7. Fiedler, B.: A use of ideal decomposition in the computer algebra of tensor expressions (1997)
  8. Ilyin, V. A.; Kryukov, A. P.: ATENSOR -- REDUCE program for tensor simplification (1996)