Efficient Tensor Decompositions
From MaRDI portal
Publication:5027285
DOI10.1017/9781108637435.025OpenAlexW3127865728MaRDI QIDQ5027285
Publication date: 4 February 2022
Full work available at URL: https://arxiv.org/abs/2007.15589
Related Items (13)
On the optimization landscape of tensor decompositions ⋮ Parallel Algorithms for Computing the Tensor-Train Decomposition ⋮ Recursive fast algorithm and the role of the tensor product ⋮ Title not available (Why is that?) ⋮ High-Performance Tensor Contraction without Transposition ⋮ Title not available (Why is that?) ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Efficient vector and parallel manipulation of tensor products ⋮ A Practical Randomized CP Tensor Decomposition ⋮ Tensor Decompositions and Applications ⋮ xPerm: fast index canonicalization for tensor computer algebra ⋮ An algorithm to simplify tensor expressions ⋮ Faster tensor train decomposition for sparse data
This page was built for publication: Efficient Tensor Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027285)
