Table of Content

Open Access

ARTICLE

Double Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise

Chein-Shan Liu1, Satya N. Atluri2
Department of Civil Engineering, National Taiwan University, Taipei, Taiwan. E-mail: liucs@ntu.edu.tw
Center for Aerospace Research & Education, University of California, Irvine.

Computer Modeling in Engineering & Sciences 2015, 104(1), 1-39. https://doi.org/10.3970/cmes.2015.104.001

Abstract

A double optimal solution of an n-dimensional system of linear equations Ax = b has been derived in an affine m « n. We further develop a double optimal iterative algorithm (DOIA), with the descent direction z being solved from the residual equation Az = r0 by using its double optimal solution, to solve ill-posed linear problem under large noise. The DOIA is proven to be absolutely convergent step-by-step with the square residual error ||r||2 = ||b - Ax||2 being reduced by a positive quantity ||Azk||2 at each iteration step, which is found to be better than those algorithms based on the minimization of the square residual error in an m-dimensional Krylov subspace. In order to tackle the ill-posed linear problem under a large noise, we also propose a novel double optimal regularization algorithm (DORA) to solve it, which is an improvement of the Tikhonov regularization method. Some numerical tests reveal the high performance of DOIA and DORA against large noise. These methods are of use in the ill-posed problems of structural health-monitoring.

Keywords

Ill-posed linear equations system, Double optimal solution, Affine Krylov subspace, Double optimal iterative algorithm, Double optimal regularization algorithm.

Cite This Article

Liu, C., Atluri, S. N. (2015). Double Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise. CMES-Computer Modeling in Engineering & Sciences, 104(1), 1–39.



This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 610

    View

  • 485

    Download

  • 0

    Like

Share Link

WeChat scan