Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
Publication:2882777
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
numerical examplesKrylov subspace methodsmultidimensional arraysTucker approximationstructured tensorssparse tensorsfast compressionWedderburn rank reduction
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69)
Related Items (13)
Uses Software
This page was built for publication: Wedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case