Information-based complexity
The computational complexity of differential and integral equations: an information-based approach
The computational complexity of differential and integral equations: an information-based approach
Lower bounds for the complexity of Monte Carlo function approximation
Journal of Complexity
The complexity of definite elliptic problems with noisy data
Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
A new algorithm and worst case complexity for Feynman-Kac path integration
Journal of Computational Physics
Quantum integration in Sobolev classes
Journal of Complexity
Worst case complexity of multivariate Feynman-Kac path integration
Journal of Complexity
Quantum approximation I. Embeddings of finite-dimensional Lp spaces
Journal of Complexity
Optimal approximation of elliptic problems by linear and nonlinear mappings I
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Monte Carlo approximation of weakly singular integral operators
Journal of Complexity
Monte Carlo approximation of weakly singular integral operators
Journal of Complexity
Monte Carlo approximation of weakly singular integral operators
Journal of Complexity
On the randomized solution of initial value problems
Journal of Complexity
The randomized complexity of indefinite integration
Journal of Complexity
| Hi-index | 0.00 |
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q@?R^d with smooth coefficients and homogeneous boundary conditions. The solution is sought on a smooth submanifold M@?Q of dimension 0=