Integration and approximation in arbitrary dimensions

被引:98
作者
Hickernell, FJ
Wozniakowski, H
机构
[1] Hong Kong Baptist Univ, Dept Math, Hong Kong, Peoples R China
[2] Columbia Univ, Dept Comp Sci, New York, NY 10027 USA
[3] Warsaw Univ, Inst Appl Math, PL-02097 Warsaw, Poland
基金
美国国家科学基金会;
关键词
curse of dimension; tractability; multivariate integration; multivariate approximation;
D O I
10.1023/A:1018948631251
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We study multivariate integration and approximation for various classes of functions of d variables with arbitrary d. We consider algorithms that use function evaluations as the information about the function. We are mainly interested in verifying when integration and approximation are tractable and strongly tractable. Tractability means that the minimal number of function evaluations needed to reduce the initial error by a factor of epsilon is bounded by C(d)epsilon(-p) for some exponent p independent of d and some function C(d). Strong tractability means that C(d) can be made independent of d. The epsilon-exponents of tractability and strong tractability are defined as the smallest powers of epsilon(-1) in these bounds. We prove that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure. We obtain bounds on the epsilon-exponents, and for some cases we find their exact values. For some weighted Korobov and Sobolev spaces, the strong epsilon-exponent is the same as the epsilon-exponent for d = 1, whereas for the third space it is 2. For approximation we also consider algorithms that use general evaluations given by arbitrary continuous linear functionals as the information about the function. Our main result is that the epsilon-exponents are the same for general and function evaluations. This holds under the assumption that the orthonormal eigenfunctions of the covariance operator have uniformly bounded L-infinity norms. This assumption holds for spaces with shift-invariant kernels. Examples of such spaces include weighted Korobov spaces. For a space with non-shift-invariant kernel, we construct the corresponding space with shift-invariant kernel and show that integration and approximation for the non-shift-invariant kernel are no harder than the corresponding problems with the shift-invariant kernel. If we apply this construction to a weighted Sobolev space, whose kernel is non-shift-invariant, then we obtain the corresponding Korobov space. This enables us to derive the results for weighted Sobolev spaces.
引用
收藏
页码:25 / 58
页数:34
相关论文
共 24 条
[1]   THEORY OF REPRODUCING KERNELS [J].
ARONSZAJN, N .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1950, 68 (MAY) :337-404
[2]  
CIESIELSKI Z, 1975, LECT NOTES MATH, V472, P29
[3]  
Hellekalek P., 1998, Random and Quasi-Random Point Sets, P109, DOI [10.1007/978-1-4612-1702-2_3, DOI 10.1007/978-1-4612-1702-2_3]
[5]  
JOE S., 1994, LATTICE METHODS MULT
[6]  
Kuo H. H., 1975, LECT NOTES MATH, V463
[7]   The exponent of discrepancy is at least 1.0669 [J].
Matousek, J .
JOURNAL OF COMPLEXITY, 1998, 14 (04) :448-453
[8]   ON SOME PROBLEMS CONCERNING BROWNIAN MOTION IN LEVYS SENSE [J].
MOLCHAN, GM .
THEORY OF PROBILITY AND ITS APPLICATIONS,USSR, 1967, 12 (04) :682-&
[9]   Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials [J].
Novak, E .
JOURNAL OF COMPLEXITY, 1999, 15 (03) :299-316
[10]  
Papageorgiou A, 1996, RISK, V9, P63