SVD-based algorithms for tensor wheel decomposition

DOI10.1007/S10444-024-10194-9MaRDI QIDQ6624467zbMATH OpenFDO

Authors Meng-yu Wang, Honghua Cui, Hanyu Li

Publication date 25 October 2024

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10444-024-10194-9

zbMATH Keywords

alternating least squaresrandomized algorithmsketchingSVDdeterministic algorithmtensor wheel decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20) Decomposition methods (49M27) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Randomized tensor wheel decomposition
• SVD-based algorithms for fully-connected tensor network decomposition
• A randomized tensor singular value decomposition based on the t-product.
• A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes
• A random sampling algorithm for fully-connected tensor network decomposition with applications

Cites work

• A Multilinear Singular Value Decomposition
• A fast randomized algorithm for the approximation of matrices
• A new truncation strategy for the higher-order singular value decomposition
• A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Low-rank Tucker approximation of a tensor from streaming data
• Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
• On best rank one approximation of tensors
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Randomized Algorithms for Rounding in the Tensor-Train Format
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Randomized algorithms for the low multilinear rank approximations of tensors
• Randomized numerical linear algebra: Foundations and algorithms
• Streaming Tensor Train Approximation
• Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
• Subspace Iteration Randomization and Singular Value Problems
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications
• Tensor completion via fully-connected tensor network decomposition with regularized factors
• Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
• Tensor-train decomposition
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• The dynamics of swamps in the canonical tensor approximation problem

Cited in

(4)

• Computing with traceable tensor networks
• SVD-based algorithms for fully-connected tensor network decomposition
• Accelerated alternating least squares for tensor wheel decomposition with applications
• Randomized tensor wheel decomposition

This page was built for publication: SVD-based algorithms for tensor wheel decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624467)