Fast truncation of mode ranks for bilinear tensor operations
From MaRDI portal
Publication:4909731
DOI10.1002/nla.765zbMath1274.15041arXiv1004.4919OpenAlexW3121395605MaRDI QIDQ4909731
Nikolai L. Zamarashkin, Dmitry V. Savostyanov, Evgenij E. Tyrtyshnikov
Publication date: 21 March 2013
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.4919
low-rank matrix approximationmultidimensional arraysinterpolative decompositionTucker approximationstructured tensorsmatrix pseudo-skeleton approximation
Related Items
Exploiting Efficient Representations in Large-Scale Tensor Decompositions, Superfast Fourier transform using QTT approximation, Numerical tensor calculus, Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation, A literature survey of low-rank tensor approximation techniques
Uses Software
Cites Work
- Unnamed Item
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- Linear algebra for tensor problems
- Black box low tensor-rank approximation using fiber-crosses
- On cross approximation of multi-index arrays
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- A theory of pseudoskeleton approximations
- Incomplete cross approximation in the mosaic-skeleton method
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Cross approximation in tensor electron density computations
- Verification of the cross 3D algorithm on quantum chemistry data
- Fast Simultaneous Orthogonal Reduction to Triangular Matrices
- Fast Revealing of Mode Ranks of Tensor in Canonical Form
- Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
