TensorToolbox
Efficient MATLAB computations with sparse and factored tensors. The term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. First, we study sparse tensors, which have the property that the vast majority of the elements are zero. We propose storing sparse tensors using coordinate format and describe the computational efficiency of this scheme for various mathematical operations, including those typical to tensor decomposition algorithms. Second, we study factored tensors, which have the property that they can be assembled from more basic components. We consider two specific types: A Tucker tensor can be expressed as the product of a core tensor (which itself may be dense, sparse, or factored) and a matrix along each mode, and a Kruskal tensor can be expressed as the sum of rank-1 tensors. We are interested in the case where the storage of the components is less than the storage of the full tensor, and we demonstrate that many elementary operations can be computed using only the components. All of the efficiencies described in this paper are implemented in the Tensor Toolbox for MATLAB.
Keywords for this software
References in zbMATH (referenced in 77 articles , 1 standard article )
Showing results 1 to 20 of 77.
Sorted by year (- Battaglino, Casey; Ballard, Grey; Kolda, Tamara G.: A practical randomized CP tensor decomposition (2018)
- Chang, Jingya; Ding, Weiyang; Qi, Liqun; Yan, Hong: Computing the $p$-spectral radii of uniform hypergraphs with applications (2018)
- Harrison, A. P.; Joseph, D.: High performance rearrangement and multiplication routines for sparse tensor arithmetic (2018)
- He, Hongjin; Ling, Chen; Qi, Liqun; Zhou, Guanglu: A globally and quadratically convergent algorithm for solving multilinear systems with $\mathcal M$-tensors (2018)
- Huang, Jianyu; Matthews, Devin A.; van de Geijn, Robert A.: Strassen’s algorithm for tensor contraction (2018)
- Massarenti, Alex; Mella, Massimiliano; Staglianò, Giovanni: Effective identifiability criteria for tensors and polynomials (2018)
- Springer, Paul; Bientinesi, Paolo: Design of a high-performance GEMM-like tensor-tensor multiplication (2018)
- Xu, Yangyang: On the convergence of higher-order orthogonal iteration (2018)
- Zhu, Wei; Wang, Bao; Barnard, Richard; Hauck, Cory D.; Jenko, Frank; Osher, Stanley: Scientific data interpolation with low dimensional manifold model (2018)
- Brezinski, Claude; Redivo-Zaglia, Michela: The simplified topological $\varepsilon$-algorithms: software and applications (2017)
- Che, Mao-Lin; Wei, Yi-Min: An inequality for the Perron pair of an irreducible and symmetric nonnegative tensor with application (2017)
- Chen, Bilian; He, Simai; Li, Zhening; Zhang, Shuzhong: On new classes of nonnegative symmetric tensors (2017)
- Hackbusch, Wolfgang; Kressner, Daniel; Uschmajew, André: Perturbation of higher-order singular values (2017)
- Hackbusch, Wolfgang; Uschmajew, André: On the interconnection between the higher-order singular values of real tensors (2017)
- Han, Lixing: A homotopy method for solving multilinear systems with M-tensors (2017)
- Hashemi, Behnam; Trefethen, Lloyd N.: Chebfun in three dimensions (2017)
- Insuasty, Edwin; Van den Hof, Paul M. J.; Weiland, Siep; Jansen, Jan-Dirk: Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach (2017)
- Kressner, Daniel; Periša, Lana: Recompression of Hadamard products of tensors in Tucker format (2017)
- Özay, Evrim Korkmaz; Demiralp, Metin: Weighted tridiagonal matrix enhanced multivariance products representation (WTMEMPR) for decomposition of multiway arrays: applications on certain chemical system data sets (2017)
- Peng, LiZhong; Zhang, Fan; Zhou, BingYin: Dynamic background modeling using tensor representation and ant colony optimization (2017)