Tractability of multivariate analytic problems

In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which $s$-variate problems can be approximated to within $\varepsilon$ by using, say, polynomially many in $s$ and $\varepsilon^{-1}$ function values or arbitrary linear functionals. There is a recent stream of work for multivariate analytic problems for which we want to answer the usual tractability questions with $\varepsilon^{-1}$ replaced by $1+\log \varepsilon^{-1}$. In this vein of research, multivariate integration and approximation have been studied over Korobov spaces with exponentially fast decaying Fourier coefficients. This is work of J. Dick, G. Larcher, and the authors. There is a natural need to analyze more general analytic problems defined over more general spaces and obtain tractability results in terms of $s$ and $1+\log \varepsilon^{-1}$. The goal of this paper is to survey the existing results, present some new results, and propose further questions for the study of tractability of multivariate analytic questions.

[1]  Henryk Wozniakowski,et al.  Approximation of analytic functions in Korobov spaces , 2012, J. Complex..

[2]  E. Novak,et al.  Tractability of Multivariate Problems , 2008 .

[3]  Henryk Wozniakowski,et al.  Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces , 2013, Math. Comput..

[4]  Henryk Wozniakowski,et al.  Quasi-polynomial tractability , 2011, J. Complex..

[5]  F. Pillichshammer,et al.  Digital Nets and Sequences: Nets and sequences , 2010 .

[6]  Saburou Saitoh,et al.  Theory of Reproducing Kernels and Its Applications , 1988 .

[7]  Henryk Wozniakowski,et al.  Exponential convergence and tractability of multivariate integration for Korobov spaces , 2011, Math. Comput..

[8]  Henryk Wozniakowski,et al.  Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability , 2009, Found. Comput. Math..

[9]  Pawel Siedlecki,et al.  Uniform weak tractability , 2013, J. Complex..

[10]  Frances Y. Kuo,et al.  High-dimensional integration: The quasi-Monte Carlo way*† , 2013, Acta Numerica.

[11]  Anargyros Papageorgiou,et al.  A new criterion for tractability of multivariate problems , 2014, J. Complex..

[12]  F. Pillichshammer,et al.  Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration , 2010 .

[13]  I. Sloan,et al.  QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND , 2011, The ANZIAM Journal.

[14]  E. Novak,et al.  Tractability of Multivariate Problems Volume II: Standard Information for Functionals , 2010 .

[15]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[16]  Henryk Wozniakowski,et al.  Generalized Tractability for Multivariate Problems , 2005 .

[17]  H. Woxniakowski Information-Based Complexity , 1988 .

[18]  E. Novak,et al.  Tractability of Multivariate Problems, Volume III: Standard Information for Operators. , 2012 .

[19]  Henryk Wozniakowski,et al.  When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals? , 1998, J. Complex..