2012Unpublished venueRequires access

Optimally Generalized Regularization Methods for Solving Linear Inverse Problems

Chein‐Shan Liu

Open publisher page 16 citations

Abstract

In order to solve ill-posed linear inverse problems, we modify the Tikhonov regularization method by proposing three different preconditioners, such that the resultant linear systems are equivalent to the original one, without drop- ping out the regularized term on the right-hand side. As a consequence, the new regularization methods can retain both the regularization effect and the accuracy of solution. The preconditioned coefficient matrix is arranged to be equilibrated or diagonally dominated to derive the optimal scales in the introduced precondi- tioning matrix. Then we apply the iterative scheme to find the solution of ill-posed linear inverse problem. Two theorems are proved that the iterative sequences are monotonically convergent to the true solution. The presently proposed optimally generalized regularization methods are able to overcome the ill-posedness of linear inverse problems, and provide rather accurate numerical solution.

About this research paper

What this paper is about

In order to solve ill-posed linear inverse problems, we modify the Tikhonov regularization method by proposing three different preconditioners, such that the resultant linear systems are equivalent to the original one, without drop- ping out the regularized term on the right-hand side. As a consequence, the new regularization methods can retain both the regularization effect and the accuracy of solution. The preconditioned coefficient matrix is arranged to be equilibrated or diagonally dominated to derive the optimal scales in the introduced precondi- tioning matrix. Then we apply the iterative scheme to find the solution of ill-posed linear inverse problem. Two theorems are proved that the iterative sequences are monotonically convergent to the true solution. The presently proposed optimally generalized regularization methods are able to overcome the ill-posedness of linear inverse problems, and provide rather accurate numerical solution.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to solve ill-posed linear inverse problems, we modify the Tikhonov regularization method by proposing three different preconditioners, such that the resultant linear systems are equivalent to the original one, without drop- ping out the regularized term on the right-hand side. As a consequence, the new regularization methods can retain both the regularization effect and the accuracy of solution. The preconditioned coefficient matrix is arranged to be equilibrated or diagonally dominated to derive the optimal scales in the introduced precondi- tioning matrix. Then we apply the iterative scheme to find the solution of ill-posed linear inverse problem. Two theorems are proved that the iterative sequences are monotonically convergent to the true solution. The presently proposed optimally generalized regularization methods are able to overcome the ill-posedness of linear inverse problems, and provide rather accurate numerical solution.

Key concepts: Tikhonov regularization, Regularization (linguistics), Backus–Gilbert method, Mathematics, Applied mathematics, Inverse problem, Coefficient matrix, Diagonally dominant matrix

Related papers

Back to paper searchBrowse research topicsOriginal source
Optimally Generalized Regularization Methods for Solving Linear Inverse Problems — Research Paper | ScholarLens