Abstract
Abstract
Linear ill-posed operator equations arise in various areas of science and engineering. The presence of errors in the operator and the data often makes the computation of an accurate approximate solution difficult. In this paper, we compute an approximate solution of an ill-posed operator equation by first determining an approximation of the operators of generally fairly small dimension by carrying out a few steps of a continuous version of the Golub–Kahan bidiagonalization process to the noisy operator. Then Tikhonov regularization is applied to the low-dimensional problem so obtained and the regularization parameter is determined by solving a low-dimensional nonlinear equation. The effect of the errors incurred in each step of the solution process is analyzed. Computed examples illustrate the theory presented.
Subject
Applied Mathematics,Computer Science Applications,Mathematical Physics,Signal Processing,Theoretical Computer Science