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, class of feasible problems could be significantly enlarged, including even certain nonlinear problems. This thesis will present and analyze routines key tasks arising in connection with those schemes. The central point so called recovery scheme that allows to compute arrays coefficients efficiently by treating array as whole instead each entry separately quadrature tools methods we develop are realized C++ implementation author, which form schematic overview. All numerical studies presented based on this implementation.