Pages that link to "Item:Q2882777"
From MaRDI portal
The following pages link to Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case (Q2882777):
Displayed 13 items.
- Superfast Fourier transform using QTT approximation (Q1759431) (← links)
- Krylov-type methods for tensor computations.I (Q1931774) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors (Q2084262) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- Tensor neural network models for tensor singular value decompositions (Q2307707) (← links)
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
- A literature survey of low-rank tensor approximation techniques (Q2864808) (← 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)
- Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation (Q5254416) (← links)
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product (Q5864760) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)