Random Projections for Low Multilinear Rank Tensors
DOI10.1007/978-3-319-15090-1_5zbMath1338.65114OpenAlexW2274728378MaRDI QIDQ2806290
Carmeliza Navasca, Deonnia N. Pompey
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
numerical exampleerror boundhigher-order orthogonal iterationmatrix low rank approximationmultilinear tensor rankrandomized tensor algorithms
Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- The smallest eigenvalue of a large dimensional Wishart matrix
- A limit theorem for the norm of random matrices
- Monotonically convergent algorithms for symmetric tensor approximation
- Orthogonal Tensor Decompositions
- Solving Multilinear Systems via Tensor Inversion
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of 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
This page was built for publication: Random Projections for Low Multilinear Rank Tensors