2017
DOI: 10.1155/2017/1375716
|View full text |Cite
|
Sign up to set email alerts
|

Vector Extrapolation Based Landweber Method for Discrete Ill‐Posed Problems

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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Therefore, we intend to extend the RcdMathLib with machine learning or digital signal processing algorithms. We also aim to extend the package with an additional algorithm for solving nonlinear problems called the Landweber method [ 65 ].…”
Section: Discussionmentioning
confidence: 99%
“…Therefore, we intend to extend the RcdMathLib with machine learning or digital signal processing algorithms. We also aim to extend the package with an additional algorithm for solving nonlinear problems called the Landweber method [ 65 ].…”
Section: Discussionmentioning
confidence: 99%
“…The repaired photos appear blocky as a result. To mitigate the staircase effects in restored images, one solution is to employ total fractional-order variation (TFOV)-based models [26][27][28][29][30][31][32]. These models have been proposed as an alternative approach to address the limitations of the TV model and reduce the undesirable staircase artifacts.…”
Section: Related Workmentioning
confidence: 99%
“…Due to their faster convergence, Krylov subspace methods have recently gained more attention compared with the Landweber and Kaczmarz techniques [25]. Nevertheless, due to more semi-convergence behavior, the Krylov subspace method is prone to poor solution accuracy without appropriate stopping criteria [26]. On the other hand, the Landweber method is still superior in terms of simplicity and stability, which makes it more suitable in some real-world applications [27,28].…”
Section: Introductionmentioning
confidence: 99%