Krylov-Type Methods for Tensor Computations

Details Krylov-Type Methods for Tensor Computations Krylov-Type Methods for Tensor Computations

2010-05-05

arxiv.org/abs/1005.0683v2

Mathematics

Numerical Analysis

30 pages.

Scientific paper

Several Krylov-type procedures are introduced that generalize matrix Krylov methods for tensor computations. They are denoted minimal Krylov recursion, maximal Krylov recursion, contracted tensor product Krylov recursion. It is proved that the for a given tensor with low rank, the minimal Krylov recursion extracts the correct subspaces associated to the tensor within certain number of iterations. An optimized minimal Krylov procedure is described that gives a better tensor approximation for a given multilinear rank than the standard minimal recursion. The maximal Krylov recursion naturally admits a Krylov factorization of the tensor. The tensor Krylov methods are intended for the computation of low-rank approximations of large and sparse tensors, but they are also useful for certain dense and structured tensors for computing their higher order singular value decompositions or obtaining starting points for the best low-rank computations of tensors. A set of numerical experiments, using real life and synthetic data sets, illustrate some of the properties of the tensor Krylov methods.

Affiliated with

Also associated with

No associations

Rating

Krylov-Type Methods for Tensor Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Krylov-Type Methods for Tensor Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Krylov-Type Methods for Tensor Computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436576