Lecture 6. The Tucker Representation - Gene Golub SIAM Summer ...
Lecture 6. The Tucker Representation - Gene Golub SIAM Summer ...
Lecture 6. The Tucker Representation - Gene Golub SIAM Summer ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Summary of <strong>Lecture</strong> <strong>6.</strong><br />
Key Words<br />
<strong>The</strong> <strong>Tucker</strong> Approximation Problem for a given tensor A and<br />
a given integer vector r, involves finding the nearest length-r<br />
<strong>Tucker</strong> tensor to A in the Frobenius norm.<br />
<strong>The</strong> alternating least squares framework is used by<br />
tucker als to solve the <strong>Tucker</strong> approximation problem. It<br />
proceeds by solving a sequence of SVD problems.<br />
<strong>The</strong> k-rank of a tensor is the matrix rank of its mode-k<br />
unfolding.<br />
⊗ Transition to Computational Multilinear Algebra ⊗ <strong>Lecture</strong> <strong>6.</strong> <strong>The</strong> <strong>Tucker</strong> <strong>Representation</strong>
Change language