Adaptive Wavelet and Frame Schemes for Elliptic and Parabolic Equations
This thesis is concerned with the application of wavelet methods to the adaptive numerical solution of elliptic and parabolic operator equations over a polygonal domain. Driven by the insight that the construction of wavelet bases on more general domains is complicated and may pose stability proble...
|Online Access:||PDF Full Text|
No Tags, Be the first to tag this record!
|Summary:||This thesis is concerned with the application of wavelet methods to the adaptive numerical solution of elliptic and parabolic operator equations over a polygonal domain.
Driven by the insight that the construction of wavelet bases on more general domains is complicated and may pose stability problems, we analyze the option to replace the concept of wavelet bases by the more flexible concept of wavelet frames. Frames are redundant systems that still allow for stable decomposition and reconstruction of a given function. In the first part of this thesis, is shown how to construct so-called Gelfand frames on polygonal domains by a simple overlapping domain decomposition approach. Gelfand frames are able to characterize function spaces in a similar way as in the case of wavelet bases.
The second part is concerned with the application of Gelfand frames to the adaptive numerical treatment of linear elliptic problems. We propose inexact versions of well-known iterative schemes for the frame coordinate representation of the given operator equation. Both convergence and optimality of the considered methods can be proved and illustrated by numerical examples.
In the third part, we consider adaptive wavelet methods for the numerical treatment of linear parabolic equations. Due to the initial value problem structure of the latter, we consider a semidiscretization in time with linearly implicit methods first. The arising sequence of elliptic operator equations is then solved adaptively with wavelet methods. It is shown how to exploit the key properties of wavelet bases to a considerable extent, e.g., in preconditioning strategies and for the convergence and complexity analysis of the overall algorithm. We finish with numerical experiments in one and two spatial dimensions.|
|Physical Description:||187 Pages|