Vector extrapolation based Landweber method for discrete ill-posed problems (Q1992317): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LSQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CRAIG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RestoreTools / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2017/1375716 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2771019660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Deficient and Discrete Ill-Posed Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cauchy noise removal by nonconvex ADMM with convergence guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Convex Optimization Model for Multiplicative Noise and Blur Removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSMR: An Iterative Algorithm for Sparse Least-Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for studying the regularizing properties of Krylov subspace methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Landweber iteration for matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO CSCS-BASED ITERATION METHODS FOR SOLVING ABSOLUTE VALUE EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector extrapolation methods. Applications and numerical comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrapolation Methods for Vector Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: FOM accelerated by an extrapolation method for solving PageRank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LU implementation of the modified minimal polynomial extrapolation method for solving linear and nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of minimal polynomial and reduced rank extrapolation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Stability Properties of Minimal Polynomial and Reduced Rank Extrapolation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-reflective boundary conditions and re-blurring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stopping rules for Landweber-type iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for image deblurring: A Matlab object-oriented approach / rank
 
Normal rank

Latest revision as of 06:22, 17 July 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
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references