An algorithm to simplify tensor expressions
DOI10.1016/S0010-4655(98)00117-9zbMATH Open1009.53013arXivgr-qc/9803023MaRDI QIDQ1807987FDOQ1807987
Authors: Yanyan Li
Publication date: 30 November 1999
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/gr-qc/9803023
Recommendations
- Algorithmic simplification of tensor expressions
- Strassen's Algorithm for Tensor Contraction
- scientific article; zbMATH DE number 1273666
- A use of ideal decomposition in the computer algebra of tensor expressions
- The arithmetic complexity of tensor contraction
- Efficient Tensor Decompositions
- A new scheme for the tensor representation
- Decomposition Algorithms for Tensors and Polynomials
- Tensor computations in computer algebra systems
tensorsymmetryalgorithm[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]canonical formsimplificationcanonicaldummy indicestensor symmetry
Computation of special functions and constants, construction of tables (65D20) Methods of local Riemannian geometry (53B21) Software, source code, etc. for problems pertaining to differential geometry (53-04)
Cites Work
- ATENSOR -- REDUCE program for tensor simplification
- Title not available (Why is that?)
- Normal forms for tensor polynomials. I. The Riemann tensor
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of Maple to general relativity
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Enumeration of the order-14 invariants formed from the Riemann tensor
Cited In (22)
- Distance invariant method for normalization of indexed differentials
- The method of colored graphs for simplifying expressions with indices
- Title not available (Why is that?)
- \textit{xTras}: a field-theory inspired \textit{xAct} package for Mathematica
- Combinatorial aspects of simplification of algebraic expressions
- Normalization in Riemann tensor polynomial ring
- Cadabra: a field-theory motivated symbolic computer algebra system
- Solution of the constraints for tensors generated by iterated integrals
- Riemann tensor polynomial canonicalization by graph algebra extension
- Strassen's Algorithm for Tensor Contraction
- FeynGrav: FeynCalc extension for gravity amplitudes
- Algorithmic simplification of tensor expressions
- The vectorization expressions of Taylor series multipole-BEM for 3D elasticity problems
- GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
- Spinorial geometry, off-shell Killing spinor identities and higher derivative 5D supergravities
- Title not available (Why is that?)
- New Finsler package
- The Canon package: a fast kernel for tensor manipulators
- Simplification and normalization of indexed differentials involving coordinate transformation
- Ideal decompositions and computation of tensor normal forms
- FeynGrav 2.0
- A complete classification of canonical forms of a class of Riemann tensor indexed expressions and its applications in differential geometry
Uses Software
This page was built for publication: An algorithm to simplify tensor expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807987)