Information-based complexity
s-numbers in information-based complexity
Journal of Complexity
Optimal linear randomized methods for linear operators in Hilbert spaces
Journal of Complexity
Lower bounds for the complexity of Monte Carlo function approximation
Journal of Complexity
Average n-widths of the Wiener space in the L∞ -norm
Journal of Complexity
Linear widths of function spaces equipped with the Gaussian measure
Journal of Approximation Theory
Probabilistic and average linear widths in L∞ -norm with respect to r-fold Wiener measure
Journal of Approximation Theory
About widths of Wiener space in the Lq-norm
Journal of Complexity
Optimal approximation of elliptic problems by linear and nonlinear mappings II
Journal of Complexity
Hi-index | 0.00 |
In this paper, we determine the asymptotic degree of the linear average and stochastic n-widths of the compact embeddings B"q"""0^s^+^t(L"p"""0(@W))@?B"q"""1^s(L"p"""1(@W)),tmax{d(1/p"0-1/p"1),0},1@?p"0,p"1,q"0,q"1@?~, where B"q"""0^s^+^t(L"p"""0(@W)) is a Besov space defined on the bounded Lipschitz domain @W@?R^d.