A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
From MaRDI portal
Publication:6608123
DOI10.1007/s10915-024-02653-8zbMATH Open1547.65079MaRDI QIDQ6608123
Hao Zhang, Ting-Zhu Huang, Mao-Lin Che, Xi-Le Zhao
Publication date: 19 September 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Multilinear algebra, tensor calculus (15A69) Computational aspects of data analysis and big data (68T09) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- Discretization of a distributed optimal control problem with a stochastic parabolic equation driven by multiplicative noise
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Tensor Q-rank: new data dependent definition of tensor rank
- Randomized algorithms for the low multilinear rank approximations of tensors
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- Data-driven multi-scale non-local wavelet frame construction and image recovery
- Low rank prior and total variation regularization for image deblurring
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Robust low transformed multi-rank tensor methods for image alignment
- Rank properties and computational methods for orthogonal tensor decompositions
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- Tensor Spaces and Numerical Tensor Calculus
- Robust tensor completion using transformed tensor singular value decomposition
- A Multilinear Singular Value Decomposition
- A randomized tensor singular value decomposition based on the t‐product
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- A Practical Randomized CP Tensor Decomposition
- An efficient algorithm for solving the nonnegative tensor least squares problem
- Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorization
- Alternating Group Lasso for Block-Term Tensor Decomposition and Application to ECG Source Separation
- Spectrum Cartography via Coupled Block-Term Tensor Decomposition
- Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Practical sketching algorithms for low-rank Tucker approximation of large tensors
This page was built for publication: A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608123)