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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.