On best rank one approximation of tensors

Details On best rank one approximation of tensors On best rank one approximation of tensors

2011-12-27

arxiv.org/abs/1112.5914v1

Mathematics

Numerical Analysis

14 pages, 2 figures and 1 table

Scientific paper

In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called \emph{alternating singular value decomposition}. This method is based on the computation of maximal singular values and the corresponding singular vectors of matrices. We also introduce a modification for this method and the alternating least squares method, which ensures that alternating iterations will always converge to a semi-maximal point. Finally, we introduce a new simple Newton-type method for speeding up the convergence of alternating methods near the optimum. We present several numerical examples that illustrate the computational performance of the new method in comparison to the alternating least square method.

Affiliated with

Also associated with

No associations

Rating

On best rank one approximation of tensors 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 On best rank one approximation of tensors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On best rank one approximation of tensors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36906