Some Tucker-like approximations based on the modal semi-tensor product
Authors:
Preprint
Abstract
Approximating higher-order tensors by the Tucker format has been applied in many fields such as psychometrics, chemometrics, signal processing, pattern classification, and so on. In this paper, we propose some new Tucker-like approximations based on the modal semi-tensor product (STP), especially, a new singular value decomposition (SVD) and a new higher-order SVD (HOSVD) are derived. Algorithms for computing new decompositions are provided. We also give some numerical examples to illustrate our theoretical results.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Multiplicative Algorithms for Symmetric Nonnegative Tensor Factorizations and Its ApplicationsJournal of Scientific Computing, 2020
- Randomized algorithms for the approximations of Tucker and the tensor train decompositionsAdvances in Computational Mathematics, 2018
- Differential-geometric Newton method for the best rank-(R 1, R 2, R 3) approximation of tensorsNumerical Algorithms, 2008
- A randomized algorithm for a tensor-based generalization of the singular value decompositionLinear Algebra and its Applications, 2007
- Dimensionality reduction in higher-order signal processing and rank-(R1,R2,…,RN) reduction in multilinear algebraLinear Algebra and its Applications, 2004
- Multi‐Way Analysis with Applications in the Chemical Sciences2004
- On Semi-tensor Product of Matrices and Its ApplicationsActa Mathematicae Applicatae Sinica, English Series, 2003
- Semi-tensor product of matrices and its application to Morgen’s problemScience China Information Sciences, 2001
- N-way principal component analysis theory, algorithms and applicationsChemometrics and Intelligent Laboratory Systems, 1994
- Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares AlgorithmsPsychometrika, 1980