Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees

DOI10.1137/16M1102744zbMath1383.65037OpenAlexW2788854599WikidataQ114074325 ScholiaQ114074325MaRDI QIDQ4603494

Bora Uçar, Oguz Kaya

Publication date: 21 February 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1102744

zbMATH Keywords

parallel algorithmsCP decompositiondimension treesparse tensorsalternating least squares based algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Multilinear algebra, tensor calculus (15A69)

Related Items (5)

Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Computing dense tensor decompositions with optimal dimension trees ⋮ Parallel tensor methods for high-dimensional linear PDEs ⋮ Software for Sparse Tensor Decomposition on Emerging Computing Architectures ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition

Uses Software

• Unnamed Item
• SNAP
• TensorToolbox
• PaToH
• N-way Toolbox
• Python
• GigaTensor
• SPLATT
• DFacTo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• A comparison of algorithms for fitting the PARAFAC model
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Hierarchical Singular Value Decomposition of Tensors
• On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
• Tensor rank is NP-complete
• Efficient MATLAB Computations with Sparse and Factored Tensors

This page was built for publication: Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees