SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. Sci. Comput. 34, pp. A1-A27 (27 pages)

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

S. A. Goreinov, I. V. Oseledets, and D. V. Savostyanov

Full Text: Download PDF | Buy PDF (US$25) | View Cart
New algorithms are proposed for the Tucker approximation of a 3-tensor accessed only through a tensor-by-vector-by-vector multiplication subroutine. In the matrix case, the Krylov methods are methods of choice to approximate the dominant column and row subspaces of a sparse or structured matrix given through a matrix-by-vector operation. Using the Wedderburn rank reduction formula, we propose a matrix approximation algorithm that computes the Krylov subspaces and can be generalized to 3-tensors. The numerical experiments show that on quantum chemistry data the proposed tensor methods outperform the minimal Krylov recursion of Savas and Eldén.

© 2012 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

PUBLICATION DATA

ISSN

1064-8275 (print)  
1095-7197 (online)

ARTICLE DATA

History
Received April 12, 2010
Accepted September 14, 2011
Published online January 31, 2012

For access to fully linked references, you need to log in.

Close

close