Open Access

ARTICLE

# Optimally Generalized Regularization Methods for Solving Linear Inverse Problems

Chein-Shan Liu1

Department of Civil Engineering, National Taiwan University, Taipei, Taiwan. E-mail: liucs@ntu.edu.tw

Computers, Materials & Continua 2012, 29(2), 103-128. https://doi.org/10.3970/cmc.2012.029.103

## 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 dropping 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 preconditioning 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.

## Keywords

APA Style
Liu, C. (2012). Optimally generalized regularization methods for solving linear inverse problems. Computers, Materials & Continua, 29(2), 103-128. https://doi.org/10.3970/cmc.2012.029.103
Vancouver Style
Liu C. Optimally generalized regularization methods for solving linear inverse problems. Comput Mater Contin. 2012;29(2):103-128 https://doi.org/10.3970/cmc.2012.029.103
IEEE Style
C. Liu, "Optimally Generalized Regularization Methods for Solving Linear Inverse Problems," Comput. Mater. Contin., vol. 29, no. 2, pp. 103-128. 2012. https://doi.org/10.3970/cmc.2012.029.103

View