Pages that link to "Item:Q856465"
From MaRDI portal
The following pages link to Handwritten digit classification using higher order singular value decomposition (Q856465):
Displaying 20 items.
- Structured multi-way arrays and their applications (Q373428) (← links)
- Factorization strategies for third-order tensors (Q541928) (← links)
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (Q831251) (← links)
- Spatio-temporal Koopman decomposition (Q1631295) (← links)
- Krylov-type methods for tensor computations.I (Q1931774) (← links)
- The tensor rank problem over the quaternions (Q2020675) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Decomposition for a quaternion tensor triplet with applications (Q2067212) (← 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)
- Optimization landscape of Tucker decomposition (Q2144548) (← links)
- Tensor-train decomposition for image recognition (Q2174198) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- Unfoldings and the rank-one approximation of the tensor (Q2309259) (← links)
- Low rank tensor recovery via iterative hard thresholding (Q2400255) (← links)
- Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions (Q2800432) (← links)
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation (Q2818274) (← links)
- The rank of a 2 × 2 × 2 tensor (Q3090739) (← links)
- (Q5011283) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)