The purpose of this article is to investigate（s, t）-weak tractability of multivariate linear problems in the average case setting. The considered algorithms use finitely many evaluations of arbitrary linear functionals. Generally, we obtained matching necessary and sufficient conditions for（s, t）-weak tractability in terms of the corresponding non-increasing sequence of eigenvalues. Specifically, we discussed（s, t）-weak tractability of linear tensor product problems and obtained necessary and sufficient conditions in terms of the corresponding one-dimensional problem. As an example of applications, we discussed also（s, t）-weak tractability of a multivariate approximation problem.
展开▼
