Information-based complexity
Randomization for continuous problems
Journal of Complexity
Finite Element Method for Elliptic Problems
Finite Element Method for Elliptic Problems
Monte Carlo approximation of weakly singular integral operators
Journal of Complexity
The randomized information complexity of elliptic PDE
Journal of Complexity
Sampling numbers and function spaces
Journal of Complexity
Randomized approximation of Sobolev embeddings, III
Journal of Complexity
Randomized approximation of Sobolev embeddings, III
Journal of Complexity
The randomized complexity of indefinite integration
Journal of Complexity
Hi-index | 0.00 |
We study the approximation of Sobolev embeddings by linear randomized algorithms based on function values. Both the source and the target space are Sobolev spaces of non-negative smoothness order, defined on a bounded Lipschitz domain. The optimal order of convergence is determined. We also study the deterministic setting. Using interpolation, we extend the results to other classes of function spaces. In this context a problem posed by Novak and Wozniakowski is solved. Finally, we present an application to the complexity of general elliptic PDE.