Research reports

Adaptive wavelet algorithms for elliptic PDE's on product domains

by Ch. Schwab and R. Stevenson

(Report number 2006-10)

Abstract
With standard isotropic approximation by (piecewise) polynomials of fixed order in a domain $D\subset \mathbb{R}^d$, the convergence rate in terms of the number N of degrees of freedom is inversely proportional to the space dimension d. This so-called {\em curse of dimensionality} can be circumvented by applying sparse tensor product approximation, when certain high order mixed derivatives of the approximated function happen to be bounded in $L_2$. It was shown in [Nit06] that this regularity constraint can be dramatically reduced by considering best $N$-term approximation from tensor product wavelet bases. When the function is the solution of some well-posed operator equation, dimension independent approximation rates can be practically realized in linear complexity by adaptive wavelet algorithms, assuming that the infinite stiffness matrix of the operator with respect to such a basis is highly compressible. Applying piecewise smooth wavelets, we verify this compressibility for general, non-separable elliptic PDEs in tensor domains. Applications of the general theory developed include adaptive Galerkin discretizations of multiple scale homogenization problems and of anisotropic equations which are robust, i.e. independent of the scale parameters resp. of the size of the anisotropy.

Keywords: Elliptic PDE's on (high) dimensional product domains, multiple scale homogenization, tensor product approximation, sparse grids, wavelets, best N term approximation, optimal computational complexity, matrix compression

BibTeX
@Techreport{SS06_359,
  author = {Ch. Schwab and R. Stevenson},
  title = {Adaptive wavelet algorithms for elliptic PDE's on product domains},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2006-10},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2006/2006-10.pdf },
  year = {2006}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser