Vector Extrapolation Based Landweber Method for Discrete Ill-Posed Problems-Reference-Cited by-同舟云学术

Vector Extrapolation Based Landweber Method for Discrete Ill-Posed Problems

Published:2017 Issue: Volume:2017 Page:1-8
ISSN:1024-123X
Container-title:Mathematical Problems in Engineering
language:en
Short-container-title:Mathematical Problems in Engineering

Author:

Zhao Xi-Le¹^ORCID,Huang Ting-Zhu¹^ORCID,Gu Xian-Ming²³^ORCID,Deng Liang-Jian¹

Affiliation:

1. School of Mathematical Sciences/Research Center for Image and Vision Computing, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China

2. School of Economic Mathematics, Southwestern University of Finance and Economics, Chengdu, Sichuan 611130, China

3. Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen, Nijenborgh 9, P.O. Box 407, 9700 AK Groningen, Netherlands

Abstract

Landweber method is one of the classical iterative methods for solving linear discrete ill-posed problems. However, Landweber method generally converges very slowly. In this paper, we present the vector extrapolation based Landweber method, which exhibits fast and stable convergence behavior. Moreover, a restarted version of the vector extrapolation based Landweber method is proposed for practical considerations. Numerical results are given to illustrate the benefits of the vector extrapolation based Landweber method.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Link

http://downloads.hindawi.com/journals/mpe/2017/1375716.pdf

Reference25 articles.

1. Introduction to Inverse Problems in Imaging

2. Mathematics and Its Applications,1996

3. Rank-Deficient and Discrete Ill-Posed Problems