Randomized Algorithms for Rounding in the Tensor-Train Format
From MaRDI portal
Publication:5886850
DOI10.1137/21M1451191MaRDI QIDQ5886850
Paul Cazeaux, Arvind K. Saibaba, Eric Hallman, Tim W. Reid, Mirjeta Pasha, Hussam al Daas, Grey Ballard, Agnieszka Miedlar
Publication date: 11 April 2023
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04393
Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Numerical linear algebra (65F99) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (4)
Generative modeling via tensor train sketching ⋮ Streaming Tensor Train Approximation ⋮ Tensor rank reduction via coordinate flows ⋮ Parallel Algorithms for Computing the Tensor-Train Decomposition
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- On the numerical approximation of the Perron-Frobenius and Koopman operator
- Finitely correlated states on quantum spin chains
- Nearest-neighbor interaction systems in the tensor-train format
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- A literature survey of low-rank tensor approximation techniques
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
- Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
- Low-Rank Tensor Approximation for High-Order Correlation Functions of Gaussian Random Fields
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- The density-matrix renormalization group
- Dynamical Tensor Approximation
- Tensor Spaces and Numerical Tensor Calculus
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Tensor-based dynamic mode decomposition
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Tensor Completion in Hierarchical Tensor Representations
- Multivariate Regression and Machine Learning with Sums of Separable Functions
- Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
- Accuracy and Stability of Numerical Algorithms
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Fast Solution of Parabolic Problems in the Tensor Train/Quantized Tensor Train Format with Initial Application to the Fokker--Planck Equation
- TT-GMRES: solution to a linear system in the structured tensor format
- Parallel Algorithms for Tensor Train Arithmetic
- Tensor Train Construction From Tensor Actions, With Application to Compression of Large High Order Derivative Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A projection method to solve linear systems in tensor format
This page was built for publication: Randomized Algorithms for Rounding in the Tensor-Train Format
