Pages that link to "Item:Q977471"
From MaRDI portal
The following pages link to Generalizing the column-row matrix decomposition to multi-way arrays (Q977471):
Displaying 26 items.
- A note on tensor chain approximation (Q525265) (← links)
- Canonical row-column-exchangeable arrays (Q799303) (← links)
- The row/column pivoting strategy on multicomputers (Q1319522) (← links)
- Cross: efficient low-rank tensor completion (Q1731066) (← links)
- Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
- Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
- Hybrid CUR-type decomposition of tensors in the Tucker format (Q2114105) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- Perspectives on CUR decompositions (Q2300772) (← links)
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
- Generalized pseudoskeleton decompositions (Q2689153) (← links)
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation (Q2818274) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
- Petz recovery versus matrix reconstruction (Q4639371) (← links)
- Functional Tucker Approximation Using Chebyshev Interpolation (Q4997399) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- (Q5159482) (← links)
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data (Q5236621) (← links)
- Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation (Q5254416) (← links)
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases (Q5327163) (← links)
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (Q5376452) (← links)
- Robust tensor CUR decompositions: rapid low-Tucker-rank tensor recovery with sparse corruptions (Q6541912) (← links)
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format (Q6623671) (← links)