Error Estimates for Arnoldo-Tikhonov Regularization for Ill-Posed Operator Equations
It addresses the gap between infinite-dimensional theory and discrete computations for practitioners solving large-scale ill-posed problems.
This paper analyzes discretization errors in solving linear ill-posed operator equations using Arnoldi-Tikhonov regularization with the discrepancy principle, providing error bounds validated by numerical examples.
Most of the literature on the solution of linear ill-posed operator equations, or their discretization, focuses only on the infinite-dimensional setting or only on the solution of the algebraic linear system of equations obtained by discretization. This paper discusses the influence of the discretization error on the computed solution. We consider the situation when the discretization used yields an algebraic linear system of equations with a large matrix. An approximate solution of this system is computed by first determining a reduced system of fairly small size by carrying out a few steps of the Arnoldi process. Tikhonov regularization is applied to the reduced problem and the regularization parameter is determined by the discrepancy principle. Errors incurred in each step of the solution process are discussed. Computed examples illustrate the error bounds derived.