Tensor-Tensor Products with Invertible Linear Transforms

Research in tensor representation and analysis has been rising in popularity in direct re-sponse to a) the increased ability of data collection systems to store huge volumes of multidimensional data and b) the recognition of potential modeling accuracy that can be provided by leaving the data and/or the operator in its natural, multidimensional form. In recent work [1], the authors introduced the notion of the t-product, a generalization of matrix multiplication for tensors of order three, which can be extended to multiply tensors of arbitrary order [2]. The multiplication is based on a convolution-like operation, which can be implemented efficiently using the Fast Fourier Transform (FFT). The correspond-ing linear algebraic framework from the original work was further developed in [3], and it allows one to elegantly generalize all classical algorithms from numerical linear algebra. In this paper, we extend this development so that tensor-tensor products can be defined in a so-called transform domain for any invertible linear transform. In order to properly motivate this transform-based approach, we begin by defining a new tensor-tensor product alternative to the t-product. We then show that it can be implemented efficiently usin