×

Recursive decomposition of multidimensional tensors. (English. Russian original) Zbl 1183.15024

Dokl. Math. 80, No. 1, 460-462 (2009); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 427, No. 1, 14-16 (2009).
From the introduction: We suggest a recursive decomposition; given a \(d\)-dimensional tensor, we construct a tree in which the vertices at each level are associated with tensors of halved or approximately halved dimension, and the vertex-leaves are associated with two- or three-dimensional tensors. As a result, the initial \(d\)-dimensional tensor is determined by a tree and a set of two- or three-dimensional tensors.

MSC:

15A72 Vector and tensor algebra, theory of invariants
05C05 Trees
05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
Full Text: DOI

References:

[1] N. L. Zamarashkin, S. A. Goreinov, and E. E. Tyrtyshnikov, Dokl. Akad. Nauk 343, 151–152 (1995).
[2] G. Beylkin and M. J. Mohlenkamp, Proc. Nat. Acad. Sci. USA 99, 10 246–10 251 (2002). · Zbl 1008.65026 · doi:10.1073/pnas.112329799
[3] D. Bini and M. Capovani, SIAM J. Comput. 2, 179–203 (1987).
[4] J. D. Caroll and J. J. Chang, Psychometrica 35, 283–319 (1970). · Zbl 0202.19101 · doi:10.1007/BF02310791
[5] S. A. Goreinov, E. E. Tyrtyshnikov, and N. L. Zamarashkin, Linear Algebra Appl. 261, 1–21 (1997). · Zbl 0877.65021 · doi:10.1016/S0024-3795(96)00301-1
[6] W. Hackbush, B. N. Khoromskij, and E. E. Tyrtyshnikov, Numer. Math. 109, 365–383 (2008). · Zbl 1144.65029 · doi:10.1007/s00211-008-0143-0
[7] R. A. Harshman, UCLA Working Papers in Phonetics 16, 1–84 (1970).
[8] F. L. Hitchcock, J. Math. Phys. 6, 164–189 (1927). · JFM 53.0095.01 · doi:10.1002/sapm192761164
[9] I. Oseledets, D. Savostyanov, and E. Tyrtyshnikov, SIAM J. Matrix Anal. Appl. 30, 939–956 (2008). · Zbl 1180.15025 · doi:10.1137/060655894
[10] V. De Silva and L.-H. Lim, SIAM J. Matrix Anal. Appl. 30, 1084–1127 (2008). · Zbl 1167.14038 · doi:10.1137/06066518X
[11] L. R. Tucker, Psychometrika 31, 279–311 (1966). · doi:10.1007/BF02289464
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.