Randomized Krylov-Projected Iterated Tikhonov Regularization for Large-Scale Ill-posed Problems Under A Posteriori Stopping Rule

Ravi Verma, Harshit Bajpai, Ankik Kumar Giri

Abstract

We introduce two novel randomized iterative regularization frameworks, termed \texttt{RIGKT} and \texttt{RIAT}, for solving large-scale linear ill-posed inverse problems governed by systems of equations. The proposed methods combine randomized iterated Tikhonov regularization with Krylov subspace projection techniques, utilizing Golub--Kahan bidiagonalization for general rectangular systems (\texttt{RIGKT}) and Arnoldi decomposition for square systems (\texttt{RIAT}). Unlike existing deterministic schemes that rely on fixed iteration counts, our framework incorporates randomized equation selection, an adaptive step-size strategy, and a global, discrepancy-based a posteriori early-stopping rule tailored specifically to the stochastic setting. We present a comprehensive regularization analysis establishing Bregman-distance monotonicity, finite termination, exact-data convergence, and pathwise stability under noise. Furthermore, we prove that the stopped iterates converge almost surely and in the mean-square sense to the true solution, establishing a rigorous regularization property. To the best of our knowledge, this is the first theoretical framework to simultaneously account for randomization, Krylov-subspace dimension reduction, and implementable early stopping. Numerical experiments involving two-dimensional X-ray computed tomography (CT) and image deblurring demonstrate that \texttt{RIGKT} and \texttt{RIAT} reliably reconstruct structural features across various noise regimes.

Disclosure

“bility. The data and source code underlying the results of this study can be obtained from the authors upon reasonable request. Acknowledgment The authors acknowledge the use of the coding assistant Claude for code debugging and verifica- tion.”

PDF page 33
Classification
Code generation, completion, or debugging
Multiplier
2
Verified

Structural counts

Pages 35 pdf
Theorems 4 source
Lemmas 8 source
Propositions 1 source
Corollaries 0 source
Definitions 0 source
Displayed equations 186 source
Bibliography entries 64 source
Appendix pages 0 estimated

Count notes

  • Source counts use the expanded primary TeX file main.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.