id: 06031486
dt: j
an: 06031486
au: Goreinov, S.A.; Oseledets, I.V.; Savostyanov, D.V.
ti: Wedderburn rank reduction and Krylov subspace method for tensor
    approximation. I: Tucker case.
so: SIAM J. Sci. Comput. 34, No. 1, A1-A27 (2012).
py: 2012
pu: Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA
la: EN
cc: 
ut: multidimensional arrays; sparse tensors; structured tensors; Tucker
    approximation; Krylov subspace methods; Wedderburn rank reduction; fast
    compression; numerical examples
ci: 
li: doi:10.1137/100792056
ab: The authors propose new algorithms for the Tucker approximation of a
    3-tensor accessed only through a tensor-by-vector-by-vector
    multiplication subroutine. They introduce a matrix aproximation
    algorithm that computes the Krylov subspaces using the Wedderburn rank
    reduction formula. Numerical examples are also performed to show the
    quality of the proposed algorithms.
rv: Răzvan Răducanu (Iaşi)