Choosing the relaxation parameter in sequential block-iterativemethods for linear systems
From MaRDI portal
Publication:4633311
DOI10.3906/mat-1503-6zbMath1424.65034MaRDI QIDQ4633311
Shsghayegh Heidarzade, Touraj Nikazad
Publication date: 2 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1503-6
semiconvergence; relaxation parameters; tomographic imaging; Cimmino and CAV iteration; sequential block-iterative methods
65F10: Iterative numerical methods for linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Block-iterative methods for consistent and inconsistent linear equations
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Steepest descent, CG, and iterative regularization of ill-posed problems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- The Mathematics of Computerized Tomography
- Multicore Performance of Block Algebraic Iterative Reconstruction Methods
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- On Diagonally Relaxed Orthogonal Projection Methods
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- Properties of a class of block-iterative methods
- Projected Landweber method and preconditioning
- Rank-Deficient and Discrete Ill-Posed Problems
- Block-iterative interior point optimization methods for image reconstruction from limited data
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Semi-convergence properties of Kaczmarz’s method
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Compressed sensing
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
