Optimal approximation of elliptic problems by linear and nonlinear mappings I

  • Authors:

  • Stephan Dahlke;Erich Novak;Winfried Sickel

  • Affiliations:

  • Philipps-Universität Marburg, Mathematik und Informatik, Hans-Meerwein Straße, Lahnberge, Marburg, Germany;Friedrich-Schiller-Universität Jena, Mathematisches Institut, Jena, Germany;Friedrich-Schiller-Universität Jena, Mathematisches Institut, Jena, Germany

  • Venue:
  • Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the optimal approximation of the solution of an operator equation A(u) = f by linear mappings of rank n and compare this with the best n-term approximation with respect to an optimal Riesz basis. We consider worst case errors, where f is an element of the unit ball of a Hilbert space. We apply our results to boundary value problems for elliptic PDEs that are given by an isomorphism A: H0s(Ω) → H-s (Ω), where s 0 and (Ω) is an arbitrary bounded Lipschitz domain in Rd. We prove that approximation by linear mappings is as good as the best n-term approximation with respect to an optimal Riesz basis. We discuss why nonlinear approximation still is important for the approximation of elliptic problems.