Tensorlab

Tensorlab: A MATLAB Toolbox for Tensor Computations. Tensorlab is a MATLAB toolbox that offers algorithms for: structured data fusion: define your own (coupled) matrix and tensor factorizations with structured factors and support for dense, sparse and incomplete data sets, tensor decompositions: canonical polyadic decomposition (CPD), multilinear singular value decomposition (MLSVD), block term decompositions (BTD) and low multilinear rank approximation (LMLRA), complex optimization: quasi-Newton and nonlinear-least squares optimization with complex variables including numerical complex differentiation, global minimization of bivariate polynomials and rational functions: both real and complex exact line search (LS) and real exact plane search (PS) for tensor optimization, and much more: cumulants, tensor visualization, estimating a tensor’s rank or multilinear rank, …


References in zbMATH (referenced in 62 articles )

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

1 2 3 4 next

  1. Che, Maolin; Wei, Yimin; Yan, Hong: Randomized algorithms for the low multilinear rank approximations of tensors (2021)
  2. Che, Maolin; Wei, Yimin; Yan, Hong: An efficient randomized algorithm for computing the approximate Tucker decomposition (2021)
  3. Chu, Moody T.; Lin, Matthew M.: Nonlinear power-like and SVD-like iterative schemes with applications to entangled bipartite rank-1 approximation (2021)
  4. Luo, Yuetian; Raskutti, Garvesh; Yuan, Ming; Zhang, Anru R.: A sharp blockwise tensor perturbation bound for orthogonal iteration (2021)
  5. Oseledets, I. V.; Kharyuk, P. V.: Structuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution model (2021)
  6. Redman, William T.: On Koopman mode decomposition and tensor component analysis (2021)
  7. Vanderstukken, Jeroen; De Lathauwer, Lieven: Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition (2021)
  8. Vanderstukken, Jeroen; Kürschner, Patrick; Domanov, Ignat; De Lathauwer, Lieven: Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part II: The block term decomposition (2021)
  9. Xiao, Chuanfu; Yang, Chao; Li, Min: Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (2021)
  10. Ceruti, Gianluca; Lubich, Christian: Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors (2020)
  11. Che, Maolin; Wei, Yimin; Yan, Hong: The computation of low multilinear rank approximations of tensors via power scheme and random projection (2020)
  12. Chi, Eric C.; Gaines, Brian J.; Sun, Will Wei; Zhou, Hua; Yang, Jian: Provable convex co-clustering of tensors (2020)
  13. Domanov, Ignat; De Lathauwer, Lieven: On uniqueness and computation of the decomposition of a tensor into multilinear rank-((1,L_r,L_r)) terms (2020)
  14. Loli, Gabriele; Montardini, Monica; Sangalli, Giancarlo; Tani, Mattia: An efficient solver for space-time isogeometric Galerkin methods for parabolic problems (2020)
  15. Mao, Xianpeng; Yuan, Gonglin; Yang, Yuning: A self-adaptive regularized alternating least squares method for tensor decomposition problems (2020)
  16. Montardini, Monica; Negri, Matteo; Sangalli, Giancarlo; Tani, Mattia: Space-time least-squares isogeometric method and efficient solver for parabolic problems (2020)
  17. Nie, Jiawang; Yang, Zi: Hermitian tensor decompositions (2020)
  18. Usevich, Konstantin; Dreesen, Philippe; Ishteva, Mariya: Decoupling multivariate polynomials: interconnections between tensorizations (2020)
  19. Yang, Yuning: The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence (2020)
  20. Beltrán, Carlos; Breiding, Paul; Vannieuwenhoven, Nick: Pencil-based algorithms for tensor rank decomposition are not stable (2019)

1 2 3 4 next