The iterated Golub-Kahan-Tikhonov method
Abstract
The Golub-Kahan-Tikhonov method is a popular solution technique for large linear discrete ill-posed problems. This method first applies partial Golub-Kahan bidiagonalization to reduce the size of the given problem and then uses Tikhonov regularization to compute a meaningful approximate solution of the reduced problem. It is well known that iterated variants of this method often yield approximate solutions of higher quality than the standard non-iterated method. Moreover, it produces more accurate computed solutions than the Arnoldi method when the matrix that defines the linear discrete ill-posed problem is far from symmetric. This paper starts with an ill-posed operator equation in infinite-dimensional Hilbert space, discretizes the equation, and then applies the iterated Golub-Kahan-Tikhonov method to the solution of the latter problem. An error analysis that addresses all discretization and approximation errors is provided. Additionally, a new approach for choosing the regularization parameter is described. This solution scheme produces more accurate approximate solutions than the standard (non-iterated) Golub-Kahan-Tikhonov method and the iterated Arnoldi-Tikhonov method.
Cite
@article{arxiv.2507.12307,
title = {The iterated Golub-Kahan-Tikhonov method},
author = {Davide Bianchi and Marco Donatelli and Davide Furchì and Lothar Reichel},
journal= {arXiv preprint arXiv:2507.12307},
year = {2026}
}