Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case

DOI10.1137/100792056zbMath1242.15011arXiv1004.1986OpenAlexW2145687092MaRDI 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

zbMATH Keywords

numerical examplesKrylov subspace methodsmultidimensional arraysTucker approximationstructured tensorssparse tensorsfast compressionWedderburn rank reduction

Mathematics Subject Classification ID

Related Items (13)

Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Krylov-type methods for tensor computations.I ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Superfast Fourier transform using QTT approximation ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ Tensor neural network models for tensor singular value decompositions ⋮ A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors ⋮ Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

Uses Software

• Matlab

This page was built for publication: Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case