Journal
ENGINEERING WITH COMPUTERS
Volume 37, Issue 3, Pages 1921-1941Publisher
SPRINGER
DOI: 10.1007/s00366-019-00920-z
Keywords
Ill-posed problem; Iterative integration regularization; Filter function; Direct and iterative regularization methods; Force reconstruction; Cauchy problem
Funding
- National Natural Science Foundation of China [11702336, 11972380]
- Guangdong Province Natural Science Foundation [2017A030313007, 2018B030311001]
- Fundamental Research Funds of the Central Universities [17lgpy54, 19lgpy106]
Ask authors/readers for more resources
This paper proposes a new iterative integration regularization method for robust solution of ill-posed inverse problems, which efficiently computes the integral through two methods and guarantees regularization effect.
This paper proposes a new iterative integration regularization method for robust solution of ill-posed inverse problems. The proposed method is motivated from the fact that inversion of a positive definite matrix can be expressed in an integral form. Then, the development of the proposed method is mainly twofold. Firstly, two ways-including the linear iteration and the exponential (2(j)) iteration-are invoked to compute the integral, of which the exponential iteration is often preferred due to its fast convergence. Secondly, after stability analysis, the proposed method is shown able to filter out the undesired effect of relatively small singular values, while preserving the desired terms of relatively large singular values, i.e., the proposed method has the guaranteed regularization effect. Numerical examples on three typical ill-posed problems are conducted with detailed comparison to some usual direct and iterative regularization methods. Final results have highlighted the proposed method: (a) due to the iterative nature, the proposed method often turns out to be more efficient than the conventional direct regularization methods including the Tikhonov regularization and the truncated singular value decomposition (TSVD), (b) the proposed method converges much faster than the Landweber method and (c) the regularization effect is guaranteed in the proposed method, while may not be in the conjugate gradient method for least squares problem (CGLS).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available