{'fraction_non_alphanumeric': 0.02390438247011952, 'fraction_numerical': 0.0, 'mean_word_length': 5.28125, '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}}
Arcangeli’s method for Fredholm equations of the first kind

It is well known that a linear operator equation of the first kind, with an operator having nonclosed range, is ill-posed, that is, the solution depends discontinuously on the data. Tikhonov's method for approximating the solution depends on the choice of a positive parameter which effects a trade-off between fidelity and regularity in the approximate solution. If the parameter is chosen according to Morozov's discrepancy principle, then the approximations converge to the true solution as the error level in the data goes to zero. If the operator is selfadjoint and positive and semidefinite, then "simplified" approximations can be formed. We show that Morozov's criterion for the simplified approximations does not result in a convergent method, however, Arcangeli's criterion does lead to convergence. We then prove the uniform convergence of Arcangeli's method for Fredholm integral equations of the first kind with continuous kernel.