2012Unpublished venueRequires access

Comparison of Tikhonov regularization and Adaptive regularization for ill-posed problems

Wen Dong, Tao Sun

Open publisher page 0 citations

Abstract

Inverse 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.

About this research paper

What this paper is about

Inverse 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.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Inverse 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.

Key concepts: Tikhonov regularization, Regularization (linguistics), Regularization perspectives on support vector machines, Computer science, Backus–Gilbert method, Applied mathematics, Mathematical optimization, Inverse problem

Related papers

Back to paper searchBrowse research topicsOriginal source
Comparison of Tikhonov regularization and Adaptive regularization for ill-posed problems — Research Paper | ScholarLens