Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
From MaRDI portal
Publication:2882777
DOI10.1137/100792056zbMath1242.15011arXiv1004.1986MaRDI QIDQ2882777
Ivan V. Oseledets, Dmitry V. Savostyanov, Sergei A. Goreinov
Publication date: 7 May 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.1986
numerical examples; Krylov subspace methods; multidimensional arrays; Tucker approximation; structured tensors; sparse tensors; fast compression; Wedderburn rank reduction
65F50: Computational methods for sparse matrices
15A23: Factorization of matrices
65F10: Iterative numerical methods for linear systems
15A69: Multilinear algebra, tensor calculus
Related Items
ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation, Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product, Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations, Superfast Fourier transform using QTT approximation, Krylov-type methods for tensor computations.I, An efficient randomized algorithm for computing the approximate Tucker decomposition, A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors, Randomized algorithms for the low multilinear rank approximations of tensors, Tensor neural network models for tensor singular value decompositions, Randomized algorithms for the approximations of Tucker and the tensor train decompositions, A literature survey of low-rank tensor approximation techniques
Uses Software
