Algorithm 862

Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. Tensors (also known as multidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB’s multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor_as_matrix class supports the “matricization” of a tensor, that is, the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp_tensor and tucker_tensor. We describe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 69 articles )

Showing results 1 to 20 of 69.
Sorted by year (citations)

1 2 3 4 next

  1. Hong, David; Kolda, Tamara G.; Duersch, Jed A.: Generalized canonical polyadic tensor decomposition (2020)
  2. Liu, Dongdong; Li, Wen; Vong, Seak-Weng: A new preconditioned SOR method for solving multi-linear systems with an (\mathcalM)-tensor (2020)
  3. Benson, Austin R.; Gleich, David F.: Computing tensor (Z)-eigenvectors with dynamical systems (2019)
  4. Bentkamp, Alexander; Blanchette, Jasmin Christian; Klakow, Dietrich: A formal proof of the expressiveness of deep learning (2019)
  5. Chen, Yannan; Sun, Wenyu; Xi, Min; Yuan, Jinyun: A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (2019)
  6. Chou, Lot-Kei; Lei, Siu-Long: Tensor-train format solution with preconditioned iterative method for high dimensional time-dependent space-fractional diffusion equations with error analysis (2019)
  7. Hnětynková, Iveta; Plešinger, Martin; Žáková, Jana: On TLS formulation and core reduction for data fitting with generalized models (2019)
  8. Li, Zhibao; Dai, Yu-Hong; Gao, Huan: Alternating projection method for a class of tensor equations (2019)
  9. Phipps, Eric T.; Kolda, Tamara G.: Software for sparse tensor decomposition on emerging computing architectures (2019)
  10. Battaglino, Casey; Ballard, Grey; Kolda, Tamara G.: A practical randomized CP tensor decomposition (2018)
  11. Eustaquio, Rodrigo G.; Ribeiro, Ademir A.; Dumett, Miguel A.: A new class of root-finding methods in (\mathbbR^n): the inexact tensor-free Chebyshev-Halley class (2018)
  12. Guan, Yu; Chu, Moody T.; Chu, Delin: Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation (2018)
  13. Gu, Chuanqing; Liu, Yong: The tensor Padé-type approximant with application in computing tensor exponential function (2018)
  14. Harrison, A. P.; Joseph, D.: High performance rearrangement and multiplication routines for sparse tensor arithmetic (2018)
  15. Kepner, Jeremy; Jananthan, Hayden: Mathematics of big data. Spreadsheets, databases, matrices, and graphs. With a foreword by Charles E. Leiserson (2018)
  16. Khoromskaia, Venera; Khoromskij, Boris N.: Tensor numerical methods in quantum chemistry (2018)
  17. Kumar, K. Harish; Vijesh, V. Antony: Wavelet based iterative methods for a class of 2D-partial integro differential equations (2018)
  18. Matthews, Devin A.: High-performance tensor contraction without transposition (2018)
  19. Springer, Paul; Bientinesi, Paolo: Design of a high-performance GEMM-like tensor-tensor multiplication (2018)
  20. Wang, Dingjie; Zou, Xiufen: A new centrality measure of nodes in multilayer networks under the framework of tensor computation (2018)

1 2 3 4 next