Pages that link to "Item:Q2049079"
From MaRDI portal
The following pages link to An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079):
Displaying 14 items.
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms (Q2103418) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Nonlinear transform induced tensor nuclear norm for tensor completion (Q2162239) (← links)
- A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization (Q6172876) (← links)
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition (Q6184280) (← links)
- Randomized tensor wheel decomposition (Q6551213) (← links)
- SVD-based algorithms for fully-connected tensor network decomposition (Q6563146) (← links)
- An L-DEIM induced high order tensor interpolatory decomposition (Q6591530) (← links)
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data (Q6608123) (← links)
- A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format (Q6620442) (← links)
- SVD-based algorithms for tensor wheel decomposition (Q6624467) (← links)
- A stochastic perturbation analysis of the QR decomposition and its applications (Q6624472) (← links)
