An efficient randomized fixed-precision algorithm for tensor singular value decomposition

DOI10.1007/s42967-022-00218-warXiv2207.08307MaRDI QIDQ6085323

Salman Ahmadi-Asl

Publication date: 12 December 2023

Published in: Communications on Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

randomizationfixed-precision algorithmtubal tensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (1)

A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes

Cites Work

• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• A note on tensor chain approximation
• Factorization strategies for third-order tensors
• A tensor-based dictionary learning approach to tomographic image reconstruction
• Tensor-tensor products with invertible linear transforms
• Generalized tensor function via the tensor singular value decomposition based on the T-product
• T-Jordan canonical form and T-Drazin inverse based on the T-product
• A randomized singular value decomposition for third-order oriented tensors
• A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices
• The power and Arnoldi methods in an algebra of circulants
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
• The tensor t‐function: A definition for functions of third‐order tensors
• 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 Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
• Practical Sketching Algorithms for Low-Rank Matrix Approximation
• Exact Tensor Completion Using t-SVD
• Tensor Decomposition for Signal Processing and Machine Learning
• An Order-$p$ Tensor Factorization with Applications in Imaging
• Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
• Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
• Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
• Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
• 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
• Fast randomized tensor singular value thresholding for low‐rank tensor optimization
• Third-order tensors as linear operators on a space of matrices

This page was built for publication: An efficient randomized fixed-precision algorithm for tensor singular value decomposition