Randomized algorithms for computing tensor ring rounding

DOI10.1007/S40314-026-03911-1MaRDI QIDQ7390361zbMATH OpenFDO

Authors Zekun Wang, Huan Ren

Publication date 2027

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-026-03911-1

Mathematics Subject Classification ID

Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Cites work

• A block-randomized stochastic method with importance sampling for CP tensor decomposition
• A Practical Randomized CP Tensor Decomposition
• Distributed hierarchical SVD in the hierarchical Tucker format.
• Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Finitely correlated states on quantum spin chains
• Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications
• Low-rank Tucker approximation of a tensor from streaming data
• Multivariate regression and machine learning with sums of separable functions
• On algorithms for and computing with the tensor ring decomposition
• Practical alternating least squares for tensor ring decomposition.
• Practical sketching-based randomized tensor ring decomposition.
• 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 LU decomposition
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
• Randomized quaternion QLP decomposition for low-rank approximation
• Robust tensor completion using transformed tensor singular value decomposition
• Single-pass randomized QLP decomposition for low-rank approximation
• Subspace Iteration Randomization and Singular Value Problems
• SVD-based algorithms for fully-connected tensor network decomposition
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications
• Tensor product-type methods for solving Sylvester tensor equations
• Tensor-train decomposition
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• The expression of a tensor or a polyadic as a sum of products.
• Tikhonov regularization and randomized GSVD
• Tracking tensor ring decompositions of streaming tensors
• Triple decomposition and tensor recovery of third order tensors

This page was built for publication: Randomized algorithms for computing tensor ring rounding

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