An Optimal Preconditioner with an Alternate Relaxation Parameter Used to Solve Ill-Posed Linear Problems

被引:0
|
作者
Liu, Chein-Shan [1 ]
机构
[1] Natl Taiwan Univ, Dept Civil Engn, Taipei 10764, Taiwan
来源
关键词
Linear inverse problem; Ill-posed linear problem; Generalized relaxed steepest descent method (GRSDM); Optimal GRSDM (OGRSDM); Relaxation parameter; Optimal GRSDM with an Alternate Relaxation Parameter (OGRSDM-gamma); Fast manifold; NONLINEAR ALGEBRAIC EQUATIONS; DYNAMICAL TIKHONOV REGULARIZATION; CONJUGATE-GRADIENT METHOD; FUNDAMENTAL-SOLUTIONS; LAPLACE EQUATION; ITERATIVE ALGORITHM; INVERSE PROBLEMS; P-ASTERISK; SYSTEM; F(X)=0;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In order to solve an ill-posed linear problem, we propose an innovative Jacobian type iterative method by presetting a conditioner before the steepest descent direction. The preconditioner is derived from an invariant manifold approach, which includes two parameters alpha and gamma to be determined. When the weighting parameter alpha is optimized by minimizing a properly defined objective function, the relaxation parameter gamma can be derived to accelerate the convergence speed under a switching criterion. When the switch is turned-on, by using the derived value of gamma it can pull back the iterative orbit to the fast manifold. It is the first time that we have a formula for the relaxation parameter, by recognizing that gamma is specified case by case, previously. The presently developed optimal and generalized steepest descent method with an alternate value of the relaxation parameter is able to overcome the ill-posedness of linear inverse problem, and provides a rather accurate numerical solution.
引用
收藏
页码:241 / 269
页数:29
相关论文
共 50 条
  • [41] Optimal regularization for ill-posed problems in metric spaces
    Institute for Mathematical Stochastics, University of Göttingen, Maschmühlenweg 8-10, 37073 Göttingen, Germany
    J Inverse Ill Posed Probl, 2007, 2 (137-148):
  • [42] The block Lanczos algorithm for linear ill-posed problems
    A. H. Bentbib
    M. El Guide
    K. Jbilou
    Calcolo, 2017, 54 : 711 - 732
  • [43] An entropic Landweber method for linear ill-posed problems
    Burger, M.
    Resmerita, E.
    Benning, M.
    INVERSE PROBLEMS, 2020, 36 (01)
  • [44] Tractability of linear ill-posed problems in Hilbert space
    Mathe, Peter
    Hofmann, Bernd
    JOURNAL OF COMPLEXITY, 2024, 84
  • [45] A POSTERIORI PARAMETER CHOICE FOR GENERAL REGULARIZATION METHODS FOR SOLVING LINEAR ILL-POSED PROBLEMS
    ENGL, HW
    GFRERER, H
    APPLIED NUMERICAL MATHEMATICS, 1988, 4 (05) : 395 - 417
  • [46] A data assimilation process for linear ill-posed problems
    Yang, X. -M.
    Deng, Z. -L.
    MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2017, 40 (16) : 5831 - 5840
  • [47] The block Lanczos algorithm for linear ill-posed problems
    Bentbib, A. H.
    El Guide, M.
    Jbilou, K.
    CALCOLO, 2017, 54 (03) : 711 - 732
  • [48] OPTIMAL REGULARIZATION METHOD FOR ILL-POSED CAUCHY PROBLEMS
    Boussetila, Nadjib
    Rebbani, Faouzia
    ELECTRONIC JOURNAL OF DIFFERENTIAL EQUATIONS, 2006,
  • [49] A new method for solving linear ill-posed problems
    Zhang, Jianjun
    Mammadov, Musa
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (20) : 10180 - 10187
  • [50] Approximation of nonsmooth solutions of linear ill-posed problems
    Vasin V.V.
    Proceedings of the Steklov Institute of Mathematics, 2006, 253 (Suppl 1) : S247 - S262