{'fraction_non_alphanumeric': 0.015665796344647518, 'fraction_numerical': 0.0, 'mean_word_length': 5.391666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An adaptive wavelet solution to generalized Stokes problem

In this paper we will present an adaptive wavelet scheme to solve the generalized Stokes problem. Using divergence free wavelets, the problem is transformed into an equivalent matrix vector system, that leads to a positive denite system of reduced size for the velocity. This system is solved iteratively, where the application of the innite stiness matrix, that is suciently compressible, is replaced by an adaptive approximation. Finally we prove that this adaptive method has optimal computational complexity, that is it recovers an approximate solution with desired accuracy at a computational expense that stays proportional to the number of terms in a corresponding wavelet-best N-term approximation.