Higher order tensor inversion is possible for even order. This is due to the fact that a tensor group endowed with the contracted product is isomorphic to the general linear group of degree n. With these isomorphic group structures, we derive a tensor SVD which we have shown to be equivalent to well-known canonical polyadic decomposition and multilinear SVD provided that some constraints are satisfied. Moreover, within this group structure framework, multilinear systems are derived and solved for problems of high-dimensional PDEs and large discrete quantum models. We also address multilinear systems which do not fit the framework in the least-squares sense. These are cases when there is an odd number of modes or when each mode has distinct dimension. Numerically we solve multilinear systems using iterative techniques, namely, biconjugate gradient and Jacobi methods.

We study the convergence of the Regularized Alternating LeastSquares algorithm for tensor decompositions. As a main result, we have shown that given the existence of critical points of the Alternating Least-Squares method, the limit points of the converging subsequences of the RALS are the critical points of the least squares cost functional. Some numerical examples indicate a faster convergence rate for the RALS in comparison to the usual Alternating LeastSquares method.

No abstract

No abstract