An optimal adaptive wavelet method without coarsening of the iterands

Open Access
Authors
Publication date 2007
Journal Mathematics of Computation
Volume | Issue number 76 | 258
Pages (from-to) 615-629
Organisations
  • Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
Abstract In this paper, an adaptive wavelet method for solving linear operator equations is constructed that is a modification of the method from [Math. Comp, 70 (2001), pp. 27-75] by Cohen, Dahmen and DeVore, in the sense that there is no recurrent coarsening of the iterands. Despite this, it will be shown that the method has optimal computational complexity. Numerical results for a simple model problem indicate that the new method is more efficient than an existing alternative adaptive wavelet method.
Document type Article
Published at https://doi.org/10.1090/S0025-5718-06-01917-X
Downloads
Permalink to this page
Back