Pages that link to "Item:Q5027024"
From MaRDI portal
The following pages link to Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024):
Displaying 18 items.
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions (Q2093707) (← links)
- Multilinear POD-DEIM model reduction for 2D and 3D semilinear systems of differential equations (Q2136223) (← links)
- On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- Nonintrusive model order reduction for cross-diffusion systems (Q2170824) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
- Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558) (← links)
- Structured Matrix Approximations via Tensor Decompositions (Q5057769) (← links)
- (Q5149011) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
- Randomized tensor decomposition for large-scale data assimilation problems for carbon dioxide sequestration (Q6084299) (← links)
- Practical sketching algorithms for low-rank Tucker approximation of large tensors (Q6101551) (← links)
- Incremental algorithms for truncated higher-order singular value decompositions (Q6139252) (← links)
- Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (Q6154935) (← links)
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition (Q6184280) (← links)
- Optimality conditions for Tucker low-rank tensor optimization (Q6188055) (← links)