ABSTRACT
The main argument often put forward in physics to use tensors is their intrinsic definition allowing the invariance of their properties with respect to the coordinate system. In this paper, another interest of tensors is put forward, namely the uniqueness of their decomposition into a sum of simple tensors. This uniqueness allows to identify these simple tensors to quantities having a physical meaning. This unique property, described in detail in this article, has inspired numerous works in recent years in a wide variety of application domains, particularly in data science, which is outlined here.
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the article
AUTHOR
-
Pierre COMON
: Research Director, Université Grenoble Alpes, CNRS, Grenoble INP, Gipsa-Lab, Grenoble, France
INTRODUCTION
Tensors have long been used in physics, as they are invariant
to the coordinate systems used. They also appear when we want to evaluate
the arithmetic complexity of certain problems. Finally, we come across
them in statistics, with the moments and cumulants of multivariate
random variables. But more recently, tensors have found their way
into other sectors of the engineering world, such as telecommunications,
biomedical engineering, chemometrics, signal processing and many others.
Yet it is not the independence of the coordinate system in their definition
that has allowed tensors to return to the heart of the algebraic tools
used by engineers. So what happened?
One of the fundamental properties of tensors is that they can
be uniquely decomposed into a sum of simpler tensors, under fairly
weak assumptions. And in many situations, these simpler terms have
an interesting physical meaning. It's this uniqueness that has led
to their renewed interest over the past dozen years. We describe this
fundamental property in section
2
. However, in the presence
of measurement errors (e.g. noise), the measured tensor does not have
the expected rank, so the best low-rank approximation should be calculated.
However, this approximation does not always exist, as we show in section
3
, which complicates
the implementation of algorithms. Finally, several flagship applications
are described in the
4
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
KEYWORDS
tensor rank
| blind source separation
| canonical polyadic decomposition (CP)
| MLSVD
| antenna array processing
Ongoing reading
Tensors in Data Sciences