On the Asymptotical Regularization for Linear Inverse Problems in Presence of White Noise

We interpret steady linear statistical inverse problems as artificial dynamic systems with white noise and introduce a stochastic differential equation system where the inverse of the ending time T naturally plays the role of the squared noise level. The time-continuous framework then allows us to apply classical methods from data assimilation, namely, the Kalman-Bucy filter and 3DVAR, and to analyze their behavior as a regularization method for the original problem. Such treatment offers some connections to the famous asymptotical regularization method, which has not yet been analyzed in the context of random noise. We derive error bounds for both methods in terms of the meansquared error under standard assumptions and discuss commonalities and differences between both approaches. If an additional tuning parameter alpha for the initial covariance is chosen appropriately in terms of the ending time T, one of the proposed methods gains order optimality. Our results extend theoretical findings in the discrete setting given in the recent paper by Iglesias et al. [Commun. Math. Sci., 15 (2017), pp. 1867-1895]. Numerical examples confirm our theoretical results.