Vector extrapolation based Landweber method for discrete ill-posed problems (Q1992317): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: LSQR / rank | |||
Normal rank |
Revision as of 16:58, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Vector extrapolation based Landweber method for discrete ill-posed problems |
scientific article |
Statements
Vector extrapolation based Landweber method for discrete ill-posed problems (English)
0 references
5 November 2018
0 references
Summary: 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.
0 references