Global saturation of regularization methods for inverse ill-posed problems (Q630010)

This paper develops the concept of global saturation for arbitrary regularization methods for inverse ill-posed problems as a formalization based upon the best global order of convergence that a method can achieve independently of the smoothness assumptions on the exact solution and on the selection of the parameter choice rule [cf.\ \textit{A. Neubauer}, ``On converse and saturation results for regularization methods'', in: A.\,Schock (ed.), Beiträge zur angewandten Analysis und Informatik.\ Helmut Brakhage zu Ehren (Berichte aus der Mathematik; Aachen: Shaker Verlag), 262--270 (1994; Zbl 0810.65048); \textit{P. Mathé}, SIAM J. Numer. Anal. 42, No.~3, 968--973 (2004; Zbl 1080.47016)]. Necessary and sufficient conditions for a regularization method to have global saturation are provided. It is shown that for a method to have global saturation, the total error must be optimal in two senses, namely, as optimal order of convergence over a certain set which, at the same time, must be optimal with respect to the error. Two convergence results are proved. Sufficient conditions for the existence of global saturation for spectral methods with classical qualification of finite positive order and for spectral methods with maximal qualification are derived as applications. Three examples of regularization methods possessing global saturation are presented.