{'fraction_non_alphanumeric': 0.024324324324324326, 'fraction_numerical': 0.0, 'mean_word_length': 4.9411764705882355, '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}}
The Regularized Orthogonal Functional Matching Pursuit for Ill-Posed Inverse Problems

We propose a novel algorithm to solve a general class of linear ill-posed inverse problems. For our numerical tests, we consider ill-posed problems on the sphere as they appear in the geosciences. Based on an iterative greedy algorithm, called the orthogonal matching pursuit, the signal is expanded in terms of trial functions which are picked from a large redundant set of functions, the so-called dictionary. The method is able to combine arbitrary trial functions which is a great advantage to former approximation algorithms. In particular, we combine orthogonal polynomials (such as spherical harmonics in the case of the sphere) of low degrees with localized trial functions such as wavelets and/or scaling functions for the reconstruction of global trends and regional details of the signal, respectively. Since we deal with ill-posed problems, we use a Tikhonov-type regularization with a penalty term based on a (spherical) Sobolev norm. There is no need to solve any system of equations or any integration pro...