Tsogtgerel Gantamur, Helmut Harbrecht, Rob Stevenson:

An Optimal Adaptive Wavelet Method for Elliptic Equations without Coarsening

In this paper, an adaptive wavelet method for solving linear operator equations is constructed that is a modification of the method from [{\em Math. Comp}, 70 (2001), pp.27--75] by Cohen, Dahmen and DeVore, in the sense that there is no recurrent coarsening of the approximate solutions. Despite of this, it will be shown that the method has optimal computational complexity. Numerical results in a simple model problem indicate that the avoidance of coarsening results in a more efficient algorithm.

Erstveröffentlichung: Preprint 1325, (Department of Mathematics, Utrecht University, 2005,)

Mathematics Subject Classification (1991): 41A25, 41A46, 65F10, 65T60

Bibliographical note: Math. Comp. 76, 615-629 (2007) [An optimal adaptive wavelet method without coarsening of the iterands]

Keywords: Adaptive methods, operator equations, wavelets, optimal computational complexity, best N-term approximation

Mail an Jens Burmeister

[Thu Feb 19 18:56:36 2009]

Impressum