Computing dense tensor decompositions with optimal dimension trees

DOI10.1007/s00453-018-0525-3zbMath1421.68259OpenAlexW2736906781WikidataQ129081818 ScholiaQ129081818MaRDI QIDQ1741867

Oguz Kaya, Yves Robert

Publication date: 7 May 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01974471/file/algorithmica-revision-submitted.pdf

zbMATH Keywords

Tucker decompositionCP decompositiontensor computationsdimension tree

Mathematics Subject Classification ID

Related Items (2)

Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition

Uses Software

• TensorToolbox
• N-way Toolbox
• GigaTensor
• SPLATT
• DFacTo

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Hierarchical Singular Value Decomposition of Tensors
• Tensor rank is NP-complete
• Efficient MATLAB Computations with Sparse and Factored Tensors
• A Multilinear Singular Value Decomposition
• Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
• Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees

This page was built for publication: Computing dense tensor decompositions with optimal dimension trees