Table of Content

Open Access iconOpen Access

ARTICLE

An Optimal Multi-Vector Iterative Algorithm in a Krylov Subspace for Solving the Ill-Posed Linear Inverse Problems

Chein-Shan Liu 1

Department of Civil Engineering, National Taiwan University, Taipei, Taiwan. E-mail: liucs@ntu.edu.tw

Computers, Materials & Continua 2013, 33(2), 175-198. https://doi.org/10.3970/cmc.2013.033.175

Abstract

An optimal m-vector descent iterative algorithm in a Krylov subspace is developed, of which the m weighting parameters are optimized from a properly defined objective function to accelerate the convergence rate in solving an ill-posed linear problem. The optimal multi-vector iterative algorithm (OMVIA) is convergent fast and accurate, which is verified by numerical tests of several linear inverse problems, including the backward heat conduction problem, the heat source identification problem, the inverse Cauchy problem, and the external force recovery problem. Because the OMVIA has a good filtering effect, the numerical results recovered are quite smooth with small error, even under a large noise up to 10%.

Keywords


Cite This Article

APA Style
Liu, C. (2013). An optimal multi-vector iterative algorithm in a krylov subspace for solving the ill-posed linear inverse problems. Computers, Materials & Continua, 33(2), 175-198. https://doi.org/10.3970/cmc.2013.033.175
Vancouver Style
Liu C. An optimal multi-vector iterative algorithm in a krylov subspace for solving the ill-posed linear inverse problems. Comput Mater Contin. 2013;33(2):175-198 https://doi.org/10.3970/cmc.2013.033.175
IEEE Style
C. Liu, “An Optimal Multi-Vector Iterative Algorithm in a Krylov Subspace for Solving the Ill-Posed Linear Inverse Problems,” Comput. Mater. Contin., vol. 33, no. 2, pp. 175-198, 2013. https://doi.org/10.3970/cmc.2013.033.175



cc Copyright © 2013 The Author(s). Published by Tech Science Press.
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.
  • 1839

    View

  • 1186

    Download

  • 0

    Like

Share Link