Generic and typical ranks of multi-way arrays
By Pierre Comon, J. Berge, Lieven De Lathauwer, Joséphine Castaing. 2009
105 citations recorded by the source corpus.
Subfields: Computational Mathematics, Computational Mechanics, Signal Processing
View Paper: https://www.semanticscholar.org/paper/95f9a180eb01c892227bced4966a2aebb67c167b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mathematics
- Tamara G. Kolda
- Pierre Comon
- Brett W. Bader
- Boris N. Khoromskij
- Ivan V. Oseledets
- Andrzej S. Cichocki
- André Uschmajew
- Anh Huy Phan
In Computational Mechanics
- Brett W. Bader
- Pierre Comon
- Tamara G. Kolda
- Xavier Luciani
- Giorgio Ottaviani
- A. D. Almeida
- Kfir Yehuda Levy
- Lieven De Lathauwer
In Signal Processing
- Tamara G. Kolda
- Pierre Comon
- Brett W. Bader
- Boris N. Khoromskij
- Ivan V. Oseledets
- Xavier Luciani
- Giorgio Ottaviani
- A. D. Almeida
Citations in the corpus
- Tensor decompositions, alternating least squares and other tales (2009, background): “The same principle extends to more general tensor decompositions [47].”
- Tensor Decompositions and Applications (2009, background): “[51] conjectures that the rank is 19 or 20).”
- On the typical rank of real binary forms (2009, background): “In other words, for given order and dimension, the smallest typical rank in the real field coincides with the generic rank in the complex field [15,18].”
- Tensors : A brief introduction (2014, unknown): “Contrary to the matrix case, they are not maximal; tables of rank values may be found in [24], as well as simple codes 7 to compute numerically the generic rank of a large panel of tensors.”