Software for Sparse Tensor Decomposition on Emerging Computing Architectures
DOI10.1137/18M1210691WikidataQ127653016 ScholiaQ127653016MaRDI QIDQ5230593FDOQ5230593
Authors: Eric T. Phipps, Tamara G. Kolda
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.09175
Recommendations
Vector and tensor algebra, theory of invariants (15A72) Numerical algorithms for specific classes of architectures (65Y10) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Tensor Decompositions and Applications
- Algorithm 862
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Generalized canonical polyadic tensor decomposition
- Embedded ensemble propagation for improving performance, portability, and scalability of uncertainty quantification on emerging computational architectures
Cited In (3)
Uses Software
This page was built for publication: Software for Sparse Tensor Decomposition on Emerging Computing Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230593)