A randomized tensor singular value decomposition based on the t-product.

DOI10.1002/NLA.2179OpenAlexW2962826067MaRDI QIDQ4558717FDOQ4558717

Authors: Jiani Zhang, Arvind K. Saibaba, Misha E. Kilmer, Shuchin Aeron 

Publication date: 29 November 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.07086

Recommendations

• Randomized algorithms for the low multilinear rank approximations of tensors
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Random Projections for Low Multilinear Rank Tensors
• A randomized singular value decomposition for third-order oriented tensors
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions

zbMATH Keywords

tensorsingular value decompositiontruncated SVDrandomized SVDt-product

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (43)

• Generalized visual information analysis via tensorial algebra
• Hot-SVD: higher order t-singular value decomposition for tensors based on tensor-tensor product
• An efficient algorithm for computing the approximate t-URV and its applications
• Fast randomized tensor singular value thresholding for low‐rank tensor optimization
• Acute perturbation for Moore-Penrose inverses of tensors via the T-product
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes
• Generalized T-product tensor Bernstein bounds
• A randomized algorithm for a tensor-based generalization of the singular value decomposition
• A randomized singular value decomposition for third-order oriented tensors
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Tensor Golub-Kahan method based on Einstein product
• Randomized algorithm on tensor singular value decomposition for image and video reconstructions
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
• A numerical study of efficient sampling strategies for randomized singular value decomposition
• A low-rank tensor-based algorithm for face recognition
• Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
• Two-sided randomized algorithms for approximate \(K\)-term t-SVD
• Block diagonalization of block circulant quaternion matrices and the fast calculation for T-product of quaternion tensors
• Fast randomized matrix and tensor interpolative decomposition using countsketch
• A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
• Parallel Randomized Tucker Decomposition Algorithms
• Low tubal rank tensor completion based on singular value factors
• Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
• Color image inpainting based on low-rank quaternion matrix factorization
• Performance of the low-rank TT-SVD for large dense tensors on modern multicore CPUs
• SVD-based algorithms for tensor wheel decomposition
• On approximation algorithm for orthogonal low-rank tensor approximation
• Tensor CUR decomposition under T-product and its perturbation
• Randomized algorithms for the low multilinear rank approximations of tensors
• An orthogonal equivalence theorem for third order tensors
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Practical sketching algorithms for low-rank Tucker approximation of large tensors
• An efficient randomized fixed-precision algorithm for tensor singular value decomposition
• Characterization of s-diagonal tensors from t-SVD factorization of third order tensors
• Quantum context-aware recommendation systems based on tensor singular value decomposition
• The detection algorithm based on low rank tensor decomposition of large-scale MIMO
• A Randomized Tensor Singular Value Decomposition based on the t-product
• Randomized tensor wheel decomposition
• Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
• Characterizations and perturbations of the core-EP inverse of tensors based on the T-product
• T-product tensors. II: Tail bounds for sums of random T-product tensors

This page was built for publication: A randomized tensor singular value decomposition based on the t-product.

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