Abstract
We study EC-(s,t)-weak tractability of multivariate linear problems in the average case setting. This paper extends earlier work in the worst case setting. The parameters s≥0 and t≥0 allow us to study the information complexity n(ε,d) of a d-variate problem with respect to different powers of lnε−1, corresponding to the bits of accuracy, and d. We consider the absolute and normalized error criteria. In particular, a multivariate problem is EC-(s,t)-weakly tractable iff limd+ε−1→∞lnn(ε,d)∕[dt+lnsε−1]=0. We deal with general linear problems and linear tensor product problems. We show necessary and sufficient conditions for EC-(s,t)-weak tractability. In the case of general linear problem these conditions are matching. For linear tensor product problems, we also show matching conditions with the exception of some cases where s>1, in general.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
