Pages that link to "Item:Q2226319"
From MaRDI portal
The following pages link to Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319):
Displaying 8 items.
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors (Q2087499) (← links)
- A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (Q2161453) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← 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)
- Practical sketching algorithms for low-rank Tucker approximation of large tensors (Q6101551) (← links)
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition (Q6184280) (← links)