Quantcast

The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data

Research paper by Iveta Hnětynková, Martin Plešinger, Zdeněk Strakoš

Indexed on: 22 Sep '09Published on: 22 Sep '09Published in: BIT Numerical Mathematics



Abstract

Regularization techniques based on the Golub-Kahan iterative bidiagonalization belong among popular approaches for solving large ill-posed problems. First, the original problem is projected onto a lower dimensional subspace using the bidiagonalization algorithm, which by itself represents a form of regularization by projection. The projected problem, however, inherits a part of the ill-posedness of the original problem, and therefore some form of inner regularization must be applied. Stopping criteria for the whole process are then based on the regularization of the projected (small) problem.In this paper we consider an ill-posed problem with a noisy right-hand side (observation vector), where the noise level is unknown. We show how the information from the Golub-Kahan iterative bidiagonalization can be used for estimating the noise level. Such information can be useful for constructing efficient stopping criteria in solving ill-posed problems.