Comparison of Tikhonov Regularization and Adaptive Regularization for III-Posed Problems

Article Preview

Abstract:

nverse problems are important interdisciplinary subject, which receive more and more attention in recent years in the areas of mathematics, computer science, information science and other applied natural sciences. There is close relationship between inverse problems and ill-posedness. Regularization is an important strategy when computing the ill-posed problems to maintain the stability of the computation.This paper compares a new regularization method,which is called Adaptive regularization, with the traditional Tikhonov regularization method. The conclusion that Adaptive regularization method is a stronger regularization method than the traditional Tikhonov regularization method can be made by computing some numerical examples.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1193-1196

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y.F. Wang. Computational Methods for Inverse Problems and Their Applications. Beijing: Higher Education Press, (2007).

Google Scholar

[2] T.Y. Xiao, C.G. Yu, Y.F. Wang. Numerical methods for the solution of inverse problems. Beijing: Science Press, (2003).

Google Scholar

[3] J. Hadamard. Lectures on the Cauchy Problems in Linear Partial Differential Equations. New Haven, Yale University Press, (1923).

Google Scholar

[4] Y.F. Wang. On the Optimization and Regularization Algorithms for Inverse Problems. AMSS-Ph D Thesis, Graduate University of Chinese Academy of Sciences, (2002).

Google Scholar

[5] E. Robinson, S. Treitel. Geophysical Signal Analysis. Prentice-Hall, Englewood Cliffs, (1980).

Google Scholar

[6] G. Webster, F. Levin. Deconvolution. Geophysics Reprint Series No. 1., Society of Exploration Geophysicists, Tulsa, (1978).

Google Scholar

[7] H. Gfrerer. An A-posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates,. Mathematics of Computation. Vol. 49, pp.507-522, (1987).

DOI: 10.1090/s0025-5718-1987-0906185-4

Google Scholar