Eigenvalues and s-numbers
On the degree of nonlinear spline approximation in Besov-Sobolev spaces
Journal of Approximation Theory
s-numbers in information-based complexity
Journal of 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
Continuous algorithms in n-term approximation and non-linear widths
Journal of Approximation Theory
Adaptive wavelet methods for elliptic operator equations: convergence rates
Mathematics of Computation
The randomized information complexity of elliptic PDE
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
Optimal approximation of elliptic problems by linear and nonlinear mappings II
Journal of Complexity
The quantum query complexity of elliptic PDE
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
Journal of Complexity
Randomized approximation of Sobolev embeddings, III
Journal of Complexity
Hi-index | 0.00 |
We study the optimal approximation of the solution of an operator equation A(u)=f by linear and different types of nonlinear mappings. In our earlier papers we only considered the error with respect to a certain H^s-norm where s was given by the operator since we assumed that A:H"0^s(@W)-H^-^s(@W) is an isomorphism. The most typical case here is s=1. It is well known that for certain regular problems the order of convergence is improved if one takes the L"2-norm. In this paper we study error bounds with respect to such a weaker norm, i.e., we assume that H"0^s(@W) is continuously embedded into a space X and we measure the error in the norm of X. A major example is X=L"2(@W) or X=H^r(@W) with r