Pages that link to "Item:Q2226319"

The following pages link to Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319):

Displaying 30 items.

• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (Q831251) (← links)
• A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
• 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)
• On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← 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)
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
• A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
• Random Projections for Low Multilinear Rank Tensors (Q2806290) (← links)
• Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data (Q2818256) (← links)
• Fast low rank approximations of matrices and tensors (Q3165168) (← links)
• A randomized tensor singular value decomposition based on the t‐product (Q4558717) (← links)
• Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
• Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms (Q4615298) (← links)
• A Practical Randomized CP Tensor Decomposition (Q4643335) (← links)
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations (Q5137221) (← links)
• (Q5159482) (← 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)
• 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)
• Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering (Q6593833) (← links)
• Two-sided randomized algorithms for approximate \(K\)-term t-SVD (Q6595465) (← links)
• A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data (Q6608123) (← links)
• SVD-based algorithms for tensor wheel decomposition (Q6624467) (← links)