Fast computation tools for adaptive wavelet schemes

During the past few years, a new algorithmic paradigm for adaptive wavelet schemes was developed. First approaches covered elliptic problems, but meanwhile, the class of feasible problems could be significantly enlarged, including even certain nonlinear problems. This thesis will present and analyze routines for key tasks arising in connection with those schemes. The central point will be a so called recovery scheme that allows to compute arrays of wavelet coefficients efficiently by treating the array as a whole instead of treating each entry separately by quadrature schemes. The tools and methods we develop are realized in a C++ implementation by the author, which we present in form of a schematic overview. All numerical studies presented in the thesis are based on this implementation.

Grantor dc:publisher

Publikationsserver der RWTH Aachen University

Year dc:date

2005

Author dc:creator

• Barinka, Arne

Contributors dc:contributor

• Dahmen, Wolfgang

• info:eu-repo/classification/ddc/530
• Wavelet-Transformation
• Adaptives Verfahren
• Physik
• Nonlinear Approximation
• Adaptive
• wavelets
• recovery
• quadrature
• quasi-sorting

Statement dc:rights

• info:eu-repo/semantics/openAccess

Language dc:language

eng

Identifier

https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-121498%22

OAI identifier oai:identifier

oai:publications.rwth-aachen.de:59738