Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case (Q2882777)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6031486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case |
scientific article; zbMATH DE number 6031486 |
Statements
7 May 2012
0 references
multidimensional arrays
0 references
sparse tensors
0 references
structured tensors
0 references
Tucker approximation
0 references
Krylov subspace methods
0 references
Wedderburn rank reduction
0 references
fast compression
0 references
numerical examples
0 references
Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case (English)
0 references
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.
0 references
0.8079080581665039
0 references
0.8021133542060852
0 references
0.7785572409629822
0 references
0.7785151600837708
0 references
0.7724418044090271
0 references
