Random Projections for Low Multilinear Rank Tensors
DOI10.1007/978-3-319-15090-1_5zbMATH Open1338.65114OpenAlexW2274728378MaRDI QIDQ2806290FDOQ2806290
Authors: Deonnia N. Pompey, Carmeliza Navasca
Publication date: 17 May 2016
Published in: Visualization and Processing of Higher Order Descriptors for Multi-Valued Data (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15090-1_5
Recommendations
- Randomized algorithms for the low multilinear rank approximations of tensors
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Low-rank approximation of tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized Kaczmarz for tensor linear systems
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Low rank symmetric tensor approximations
- Randomized algorithms for the low-rank approximation of matrices
error boundnumerical examplehigher-order orthogonal iterationmatrix low rank approximationmultilinear tensor rankrandomized tensor algorithms
Numerical mathematical programming methods (65K05) Randomized algorithms (68W20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Orthogonal tensor decompositions
- Tensor Decompositions and Applications
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tensor-CUR Decompositions for Tensor-Based Data
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
- Title not available (Why is that?)
- A limit theorem for the norm of random matrices
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- The smallest eigenvalue of a large dimensional Wishart matrix
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Title not available (Why is that?)
- Solving multilinear systems via tensor inversion
- Monotonically convergent algorithms for symmetric tensor approximation
Cited In (6)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- A randomized singular value decomposition for third-order oriented tensors
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Sparse random tensors: concentration, regularization and applications
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Tensor decompositions with applications to local unitary and stochastic local operations and classical communication equivalence of multipartite pure states
This page was built for publication: Random Projections for Low Multilinear Rank Tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806290)