Related papers: The Invar Tensor Package

We describe TensoriaCalc, a tensor calculus package written to be smoothly consistent with the Wolfram Language, so as to ensure ease of usage. It allows multiple metrics to be defined in a given session; and, once a metric is computed,…

This paper describes a package for calculations of expressions with Dirac matrixes. Advantages to existing similar packages are described. MatrixExp package is intended for simplification of complex expressions involving $\gamma$-matrixes,…

The group invariance of entanglement is obtained within a very general and simple setup of the latter, given by a recently introduced considerably extended concept of tensor products. This general approach to entanglement - unlike the usual…

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor…

Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) computationally…

We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…

We present trainsum, a versatile Python package for doing computations with multidimensional quantics tensor trains: https://github.com/fh-igd-iet/trainsum. Using the Array API standard together with opt_einsum, trainsum allows the…

We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…

In past few decades, tensor algebra also known as multi-linear algebra has been developed and customized as a tool to be used for various engineering applications. In particular, with the help of a special form of tensor contracted product,…

The "Spinors" software is a "Mathematica" package which implements 2-component spinor calculus as devised by Penrose for General Relativity in dimension 3+1. The "Spinors" software is part of the "xAct" system, which is a collection of…

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagram notation, which allows users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The…

We present an improved version of our program package oneloop which -- written as a package for MAPLE -- solves one-loop Feynman integrals. The package is calculating one-, two- and three-point functions both algebraically and numerically…

In this paper, we propose a method for importing tensor index notation, including Einstein summation notation, into functional programming. This method involves introducing two types of parameters, i.e, scalar and tensor parameters, and…

This article introduces the GNAR package, which fits, predicts, and simulates from a powerful new class of generalised network autoregressive processes. Such processes consist of a multivariate time series along with a real, or inferred,…

We introduce a new OpenMath content dictionary, named tensor1, containing symbols for the expression of tensor formulas. These symbols support the expression of non-Cartesian coordinates and invariant, multilinear expressions in the context…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of covariant…

We use computational algorithms recently developed by us to study completely four index divergence free quadratic in Riemann tensor polynomials in GR. Some results are new and some other reproduce and/or correct known ones. The algorithms…

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…

The paper presents a REDUCE program for the simplification of tensor expressions that are considered as formal indexed objects. The proposed algorithm is based on the consideration of tensor expressions as vectors in some linear space. This…

Matrix and tensor operations form the basis of a wide range of fields and applications, and in many cases constitute a substantial part of the overall computational complexity. The ability of general-purpose GPUs to speed up many of these…