A literature survey of low‐rank tensor approximation techniques

By Lars Grasedyck, Daniel Kressner, Christine Tobler. 2013

719 citations recorded by the source corpus.

During the last years, low‐rank tensor approximation has been established as a new tool in scientific computing to address large‐scale linear and multilinear algebra problems, which would be intractable by classical techniques. This survey attempts to give a literature overview of current developments in this area, with an emphasis on function‐related tensors. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Subfields: Computational Mathematics, Computational Theory and Mathematics, Mathematical Optimization, Numerical Methods & Scientific Computing

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

  1. Andrzej S. Cichocki
  2. Ivan V. Oseledets
  3. Dmitry V. Savostyanov
  4. Qibin Zhao
  5. Boris N. Khoromskij
  6. Anh Huy Phan
  7. Christine Tobler
  8. Daniel Kressner

In Computational Theory and Mathematics

  1. Dmitry V. Savostyanov
  2. Andrzej S. Cichocki
  3. Ivan V. Oseledets
  4. V. Dolgov
  5. Boris N. Khoromskij
  6. Qibin Zhao
  7. Anh Huy Phan
  8. Bart Vandereycken

In Mathematical Optimization

  1. Dmitry V. Savostyanov
  2. Daniel Kressner
  3. Zeyuan Allen-Zhu
  4. Bart Vandereycken
  5. V. Dolgov
  6. Qibin Zhao
  7. Andrzej S. Cichocki
  8. Guoxu Zhou

In Numerical Methods & Scientific Computing

  1. Dmitry V. Savostyanov
  2. Ivan V. Oseledets
  3. Andrzej S. Cichocki
  4. V. Dolgov
  5. Jimeng Sun
  6. Bart Vandereycken
  7. Qibin Zhao
  8. Daniel Kressner

Citations in the corpus