On the efficient computation of high-dimensional integrals and the approximation by exponential sums

57 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A literature survey of low‐rank tensor approximation techniques (2013, neutral): “For this purpose, various approaches have been discussed in [28–30, 37, 38].”
TT-cross approximation for multidimensional arrays (2010, methodology): “…f of d variables and are required to calculate a d -dimensional integral of the form For large values of the dimensionality d such integrals are usually computed by Monte Carlo or Quasi Monte Carlo methods [37], or by sparse grid approaches [18], or sometimes by using analytical decompositions [8].”
Tensorisation of vectors and their efficient convolution (2011, methodology): “The advantage of C pw([0, 1 ]) is that the convolution result lies again in C pw([0, 1]).”
Adaptive low rank wavelet methods and applications to two-electron Schrödinger equations (2012, background): “15 in [19] (see also [18]) relies on the assumption that the function f to be approximated, e.”