Semi-convergence and relaxation parameters for a class of SIRT algorithms
From MaRDI portal
Publication:625581
zbMath1205.65148MaRDI QIDQ625581
Touraj Nikazad, Per Christian Hansen, Tommy Elfving
Publication date: 17 February 2011
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233818
Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for integral equations (65R32)
Related Items (23)
Inverse space-dependent force problems for the wave equation ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Numerical investigation of Fredholm integral equation of the first kind with noisy data ⋮ AIR tools II: algebraic iterative reconstruction methods, improved implementation ⋮ The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems ⋮ Inversion of a generalized Radon transform by algebraic iterative methods ⋮ AIR tools -- a MATLAB package of algebraic iterative reconstruction methods ⋮ Iterative inversion of Radon transform via discretization by fuzzy basic functions ⋮ Preconditioned iterative regularization in Banach spaces ⋮ Weighting algorithm and relaxation strategies of the Landweber method for image reconstruction ⋮ Column-oriented algebraic iterative methods for nonnegative constrained least squares problems ⋮ Choosing the relaxation parameter in sequential block-iterativemethods for linear systems ⋮ Two-subspace projection method for coherent overdetermined systems ⋮ Convergence studies on block iterative algorithms for image reconstruction ⋮ Identification of the time-dependent conductivity of an inhomogeneous diffusive material ⋮ Controlling noise error in block iterative methods ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ Preconditioners for image restoration by reblurring techniques ⋮ Schultz matrix iteration based method for stable solution of discrete ill-posed problems ⋮ Convergence analyses based on frequency decomposition for the randomized row iterative method ⋮ Projected randomized Kaczmarz methods ⋮ Numerical aspects of the nonstationary modified linearized Bregman algorithm ⋮ Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods
This page was built for publication: Semi-convergence and relaxation parameters for a class of SIRT algorithms
