s-numbers in information-based complexity
Journal of Complexity
Multiscale characterizations of Besov spaces on bounded domains
Journal of Approximation Theory
Composite wavelet bases for operator equations
Mathematics of Computation
Continuous algorithms in n-term approximation and non-linear widths
Journal of Approximation Theory
Adaptive Solution of Operator Equations Using Wavelet Frames
SIAM Journal on Numerical Analysis
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
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 certain n-term approximations with respect to specific classes of frames. We consider worst case errors, where f is an element of the unit ball of a Sobolev or Besov space B"q^t(L"p(@W)) and @W@?R^d is a bounded Lipschitz domain; the error is always measured in the H^s-norm. We study the order of convergence of the corresponding nonlinear frame widths and compare it with several other approximation schemes. Our main result is that the approximation order is the same as for the nonlinear widths associated with Riesz bases, the Gelfand widths, and the manifold widths. This order is better than the order of the linear widths iff p