Generalizing the column-row matrix decomposition to multi-way arrays

DOI10.1016/j.laa.2010.03.020zbMath1194.15025OpenAlexW1973246170WikidataQ60486704 ScholiaQ60486704MaRDI QIDQ977471

Andrzej Cichocki, Cesar F. Caiafa

Publication date: 22 June 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.03.020

zbMATH Keywords

low-rank approximationlarge-scale problems\(N\)-way arrayCUR matrix decompositionfiber sampling tensor decompositionpseudo-skeleton approximationTucker tensor decomposition

Mathematics Subject Classification ID

Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69)

Related Items (20)

Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Generalized pseudoskeleton decompositions ⋮ Literature survey on low rank approximation of matrices ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Cross: efficient low-rank tensor completion ⋮ Petz recovery versus matrix reconstruction ⋮ A note on tensor chain approximation ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Perspectives on CUR decompositions ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data ⋮ Functional Tucker Approximation Using Chebyshev Interpolation ⋮ Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation ⋮ Unnamed Item ⋮ Hybrid CUR-type decomposition of tensors in the Tucker format ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

Uses Software

• TensorToolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• CUR matrix decompositions for improved data analysis
• On cross approximation of multi-index arrays
• Pseudo-skeleton approximations by matrices of maximal volume
• A theory of pseudoskeleton approximations
• Incomplete cross approximation in the mosaic-skeleton method
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• A good submatrix is hard to find
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Relative-Error $CUR$ Matrix Decompositions
• Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Linear Systems
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
• Tensor-CUR Decompositions for Tensor-Based Data
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

This page was built for publication: Generalizing the column-row matrix decomposition to multi-way arrays