Semi-convergence and relaxation parameters for a class of SIRT algorithms
zbMATH Open1205.65148MaRDI QIDQ625581FDOQ625581
Authors: T. Elfving, Touraj Nikazad, Per Christian Hansen
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Convergence and the optimal choice of the relaxation parameter for a class of iterative methods
- Convergence and the optimal choice of the relaxation parameter for a class of iterative methods
- On semi-convergence of a class of relaxation methods for singular saddle point problems
- Convergence of relaxation iterative methods for saddle point problem
- On the optimum relaxation factor in the SSOR method, and its estimated rate of convergence
- Rates of convergence of semi-stochastic approximation procedures for solving stochastic optimization problems
- scientific article; zbMATH DE number 3876930
- Publication:4867024
- Convergence properties of relaxation algorithms
Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for integral equations (65R32)
Cited In (28)
- Choosing relaxation parameter in randomized Kaczmarz method
- Convergence analyses based on frequency decomposition for the randomized row iterative method
- Relaxation factor optimization for common iterative algorithms in optical computed tomography
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Projected randomized Kaczmarz methods
- Randomized progressive iterative approximation for B-spline curve and surface fittings
- Weighting algorithm and relaxation strategies of the Landweber method for image reconstruction
- Inverse space-dependent force problems for the wave equation
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Iterative inversion of Radon transform via discretization by fuzzy basic functions
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Controlling semi-convergence phenomenon in non-stationary simultaneous iterative methods
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Numerical aspects of the nonstationary modified linearized Bregman algorithm
- Convergence and semi-convergence of a class of constrained block iterative methods
- Preconditioned iterative regularization in Banach spaces
- Preconditioners for image restoration by reblurring techniques
- Two-subspace projection method for coherent overdetermined systems
- Choosing the relaxation parameter in sequential block-iterative methods for linear systems
- Numerical investigation of Fredholm integral equation of the first kind with noisy data
- Inversion of a generalized Radon transform by algebraic iterative methods
- Controlling noise error in block iterative methods
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Convergence studies on block iterative algorithms for image reconstruction
- Identification of the time-dependent conductivity of an inhomogeneous diffusive material
- The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems
This page was built for publication: Semi-convergence and relaxation parameters for a class of SIRT algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625581)