ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS

Abstract

Multi-dimensional arrays, or tensors, are fundamental objects in computational science for their ability to store multi-dimensional data and to encode bilinear forms. We will consider algorithms and applications of the CP and Tucker tensor decompositions, focusing our efforts on optimizing subroutines required to compute tensor decompositions.