| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4608536 | Journal of Complexity | 2016 | 8 Pages |
Abstract
In this paper we study dd-variate approximation for weighted Korobov spaces in the worst-case setting. The considered algorithms use finitely many evaluations of arbitrary linear functionals. We give matching necessary and sufficient conditions for some notions of tractability in terms of two weight parameters. Our result is an affirmative answer to a problem which is left open in a recent paper of Kritzer, Pillichshammer and Woźniakowski.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Yongping Liu, Guiqiao Xu,