Abstract
In this paper we study d-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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
