Choosing the relaxation parameter in sequential block-iterative methods for linear systems
From MaRDI portal
Recommendations
- Controlling noise error in block iterative methods
- Notes on flexible sequential block iterative methods
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Convergence studies on block iterative algorithms for image reconstruction
Cites work
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Block-iterative interior point optimization methods for image reconstruction from limited data
- Block-iterative methods for consistent and inconsistent linear equations
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Compressed sensing
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Multicore performance of block algebraic iterative reconstruction methods
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Projected Landweber method and preconditioning
- Properties of a class of block-iterative methods
- Rank-Deficient and Discrete Ill-Posed Problems
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Semi-convergence properties of Kaczmarz's method
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- Steepest descent, CG, and iterative regularization of ill-posed problems
- The mathematics of computerized tomography
Cited in
(2)
This page was built for publication: Choosing the relaxation parameter in sequential block-iterative methods for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633311)
