Constructive Representation of Functions in Low-Rank Tensor Formats
By Ivan V. Oseledets. 2012
142 citations recorded by the source corpus.
Subfields: Computational Mathematics, Statistical and Nonlinear Physics, Signal Processing
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
- Andrzej S. Cichocki
- Qibin Zhao
- Anh Huy Phan
- Danilo P. Mandic
- Namgil Lee
- Masashi Sugiyama
- Ivan V. Oseledets
- Martin Kiffner
In Statistical and Nonlinear Physics
- Andrzej S. Cichocki
- Qibin Zhao
- Namgil Lee
- Danilo P. Mandic
- Anh Huy Phan
- Ivan V. Oseledets
- Masashi Sugiyama
- Anne Humeau-Heurtier
In Signal Processing
- Andrzej S. Cichocki
- Qibin Zhao
- Anh Huy Phan
- Danilo P. Mandic
- Ivan V. Oseledets
- Namgil Lee
- Masashi Sugiyama
- Boris N. Khoromskij
Citations in the corpus
- A literature survey of low‐rank tensor approximation techniques (2013, neutral): “Only in exceptional cases, it will be possible to represent f exactly by such a sum, see [26,195,208].”
- Variational quantum algorithms for nonlinear problems (2019, background): “In the case of Fourier series of order J , the approximate potential is represented by an MPS of bond dimension χ = J [51,52].”
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives (2017, background): “Moreover, wide classes of functions formed by products and/or sums of trigonometric, polynomial and rational functions can be quantized in this way to yield (approximate) low-rank tensor train (TT) network formats [Khoromskij, 2011a,b, Oseledets, 2012].”