Global convergence gradient regularization algorithm for solving nonlinear inverse problems
  Revised:July 18, 2003
View Full Text  View/Add Comment  Download reader
DOI:10.7511/jslx20054082
KeyWord:inversion,gradient regularization method,homotopy method,regularization parameter
CUI Kai~1  LI Xing-si~
Hits: 1448
Download times: 8
Abstract:
      Based on idea of homotopy mapping, an improved gradient regularization algorithm was developed. By using this path-following algorithm, the convergent bound of the gradient regularization method was efficiently widened. Moreover, a Sigmoid function was adopted to adjust the regularization parameter, by using this function, the efficiency and the stability of computation procedure were highly improved, while observational noises could also be resisted effectively. Numerical examples showed that the convergence bound of this algorithm is wider than normal gradient regularization algorithm, and the average efficiency is improved about 40-90%, besides, even though observational quantities were contaminated heavily by noise, an appropriate result could also be found.