Abstract
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).
Similar content being viewed by others
References
Ertveldt J, Pintelon R, Vanlanduit S (2016) Identification of unsteady aerodynamic forces from forced motion wind tunnel experiments. AIAA J 54(10):3265–3273
Maes K, Weijtjens W, de Ridder EJ, Lombaert G (2018) Inverse estimation of breaking wave loads on monopile wind turbines. Ocean Eng 163:544–554
Wang L, Liu J, Xie Y, Gu Y (2018) A new regularization method for the dynamic load identification of stochastic structures. Comput Math Appl 76:741–759
Xu H, Zhang L, Li Q (2019) A novel inverse procedure for load identification based on improved artificial tree algorithm. Eng Comput. https://doi.org/10.1007/s00366-019-00848-4
Ahmadian H, Mottershead JE, Friswell MI (1998) Regularization methods for finite element model updating. Mech Syst Signal Process 12(1):47–64
Titurus B, Friswell MI (2008) Regularization in model updating. Int J Numer Methods Eng 75:440–478
Rubio PB, Louf F, Chamoin L (2018) Fast model updating coupling Bayesian inference and PGD model reduction. Comput Mech 62(6):1485–1509
Wei T, Hon YC, Ling L (2007) Method of fundamental solutions with regularization techniques for Cauchy problems of elliptic operators. Eng Anal Bound Elem 31:373–385
Shivanian E, Jafarabadi A (2017) Inverse Cauchy problem of annulus domains in the framework of spectral meshless radial point interpolation. Eng Comput 33:431–442
Kabanikhin SI (2008) Definitions and examples of inverse and ill-posed problems. J Inverse Ill Posed Probl 16:317–357
Benning M, Burger M (2018) Modern regularization methods for inverse problems. Acta Num 27:1–111
Tikhonov AN (1963) On the solution of ill-posed problems and the method of regularization. Soviet Mathe 4:1035–1038
Hansen PC (1992) Analysis of discrete ill-posed problems by means of the L-curve. SIAM Rev 34(4):561–580
Bryan K, Leise T (2013) Making do with less: an introduction to compressed sensing. SIAM Rev 55(3):547–566
Kim SJ, Koh K, Boyd S, Gorinevsky D (2009) \(\ell _1\) trend filtering. SIAM Rev 51(2):339–360
Grasmair M, Haltmeier M, Scherzer O (2008) Sparse regularization with \(\ell ^q\) penalty term. Inverse Probl 24(5):055020
Strong D, Chan T (2003) Edge-preserving and scale-dependent properties of total variation regularization. Inverse Probl 19:S165–S187
Hansen PC, O’Leary DP (1993) The use of the L-curve in the regularization of discrete ill-posed problems. SIAM J Sci Comput 14(6):1487–1503
Hansen PC (2007) Regularization tools version 4.1 for matlab 7.3. Numer Algorithms 46:189–194
Hansen PC (1987) The truncated SVD as a method for regularization. BIT Numer Math 27:354–553
Hansen PC (2002) Deconvolution and regularization with Toeplitz matrices. Numer Algorithms 29:323–378
Wang L, Xie Y, Wu Z, Du Y, He K (2019) A new fast convergent iteration regularization method. Eng Comput 35:127–138
Landweber L (1951) An iteration formula for Fredholm integration equations of the first kind. Am J Math 73:615–624
Hanke M (1995) The minimal error conjugate gradient method is a regularization method. Proc Am Math Soc 123(11):3487–3497
Nagy JG, Palmer KM (2003) Steepest descent, CG, and iterative regularization of ill-posed problems. BIT Numer Math 43:1003–1017
Bauer F, Lukas MA (2011) Comparing parameter choice methods for regularization of ill-posed problems. Math Comput Simul 81:1795–1841
Lukas MA (2006) Robust generalized cross-validation for choosing the regularization parameter. Inverse Probl 22:1883–1902
Liao H, Ng MK (2011) Blind deconvolution using generalized cross-validation approach to regularization parameter estimation. IEEE Trans Image Process 20(3):670–680
Hou R, Xia Y, Bao Y, Zhou X (2018) Selection of regularization prameter for \(l_1\)-regularized damage detection. J Sound Vib 423:141–160
Rieder A (2005) Inexact Newton regularization using conjugate gradients as inner iteration. SIAM J Numer Anal 43(2):604–622
Hanke M (2001) On Lanczos based methods for the regularization of discrete ill-posed problems. BIT Numer Math 41(5):1008–1018
Marin L, Lesnic D (2005) The method of fundamental solutions for the Cauchy problem associated with two-dimensional Helmholtz-type equations. Comput Struct 83:267–278
Dongarra J, Gates M, Haidar A, Kurzak J, Luszczek P, Tomov S, Yamazaki I (2018) The singular value decomposition: anatomy of optimizing an algorithm for extreme scale. SIAM Rev 60(4):808–865
Berntsson F, Lin C, Xu T, Wokiyi D (2017) An efficient regularization method for a large scale ill-posed geothermal problem. Comput Geosci 105:1–9
Hansen PC (1998) Rank-deficient and discrete ill-posed problems. Numerical aspects of linear inversion. SIAM, Philadelphia
Zhong WX (2004) On precise integration method. J Comput Appl Math 163:59–78
Castellanos JL, Gomez S, Guerra V (2002) The triangle method for finding the corner of the L-curve. Appl Numer Math 43:359–373
Wazwaz AM (2011) The regularization method for Fredholm integral equations of the first kind. Comput Math Appl 61:2981–2986
Vogel CR, Oman ME (1998) Fast, robust total variation-based reconstruction of noisy, blurred images. IEEE Trans Image Process 7(6):813–824
Chen Z, Chan THT (2017) A truncated generalized singular value decomposition algorithm for moving force identification with ill-posed problems. J Sound Vib 401:297–310
Chen Z, Chan THT, Nguten A (2018) Moving force identification based on modified conjugate gradient method. J Sound Vib 423:100–117
Acknowledgements
The present investigation was performed under the support of National Natural Science Foundation of China (nos. 11702336 and 11972380), Guangdong Province Natural Science Foundation (no. 2017A030313007 and no. 2018B030311001) and the Fundamental Research Funds of the Central Universities (no. 17lgpy54 and no. 19lgpy106).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
To get the matrix \({\mathbf {A}}\) for force reconstruction in structural systems, the Newmark method for solution of the dynamic equation is called for \(k=1,2,\ldots ,N_\mathrm{{T}}\),
where \(\gamma =1/2,\beta =1/4\) are fixed in this paper, \(\mathbf {M,C,K}\) are the mass, damping and stiffness matrices, \({\varvec{u}}(t)\) denotes the displacements, \({\varvec{f}}(t)\) collects all independent forces and \({\mathbf {G}}\) describes the spatial distributions of the forces. Simple manipulations on Eq. (71) can yield the following state equation
with
where \({\mathbf {I}}\) denotes the identity matrix, \(\Delta t=t_{k+1}-t_k\). The measured data \({\varvec{d}}(t_k),\forall k\) are often of the form
where \(\mathbf {O,D}\) are observation matrices. Setting the initial states \({\varvec{u}}(t_1)=\dot{{\varvec{u}}}(t_1)={\varvec{0}}\) and combining (72) with (74), it is acquired that
Rights and permissions
About this article
Cite this article
Huang, C., Wang, L., Fu, M. et al. A novel iterative integration regularization method for ill-posed inverse problems. Engineering with Computers 37, 1921–1941 (2021). https://doi.org/10.1007/s00366-019-00920-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00366-019-00920-z