{'fraction_non_alphanumeric': 0.021710526315789475, 'fraction_numerical': 0.003947368421052632, 'mean_word_length': 5.76, '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}}
A wavelet‐based method for solving discrete first‐kind Fredholm equations with piecewise constant solutions

The inverse problem of finding piecewise constant solutions to discrete Fredholm integral equations of the first kind arises in many applied fields, e.g. in geophysics. This equation is usually an ill‐posed problem when it is considered in a Hilbert space framework, requiring regularization techniques to control arbitrary error amplifications and to get adequate solutions. In this work, we describe an iterative regularizing method for computing piecewise constant solutions to first‐kind discrete Fredholm integral equations. The algorithm involves two main steps at each iteration: (1) approximating the solution using a new signal reconstruction algorithm from its wavelet maxima which involves a previous step of detecting discontinuities by estimation of its local Hölder exponents; and (2) obtaining a regularized solution of the original equation using the a priori knowledge and the above approximation. In order to check the behaviour of the proposed technique, we have carried out a statistical study from a high number of simulations obtaining excellent results. Their comparisons with the results coming from using classical Tikhonov regularization by the multiresolution support, total variation (TV) regularization and piecewise polynomial truncated singular value decomposition (PP‐TSVD) algorithm, serve to illustrate the advantages of the new method. Copyright © 2003 John Wiley & Sons, Ltd.