The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems
From MaRDI portal
Publication:6133119
Abstract: In this paper, we consider the standard forms of two kinds of Kaczmarz-Tanabe type methods, one is derived from the Kaczmarz method and the other is derived from the symmetric Kaczmarz method. As a famous image reconstruction method in computerized tomography, the Kaczmarz method is simple and easy to implement, but its convergence speed is slow, so is the symmetric Kaczmarz method. When the standard forms of the Kaczmarz-Tanabe type methods are obtained, their iteration matrices can be used continuously in the subsequent iterations. Moreover, the iteration matrices can be stored in the image reconstruction devices, which enables the Kaczmarz method and the symmetric Kaczmarz method to be used like the simultaneous iterative reconstructive techniques (SIRT). Meanwhile, theoretical analysis shows that the convergence rate of the symmetric Kaczmarz-Tanabe method is better than that of the Kaczmarz-Tanabe method but is slightly worse than that of two-step Kaczmarz-Tanabe method, which is verified numerically. Numerical experiments also show that the convergence rates of the Kaczmarz-Tanabe method and the symmetric Kaczmarz-Tanabe method are better than those of the SIRT methods.
Recommendations
- Convergence rates of the Kaczmarz-Tanabe method for linear systems
- Kaczmarz extended versus augmented system solution in image reconstruction
- Convergence rates for Kaczmarz-type regularization methods
- Generalized Gearhart-Koshy acceleration for the Kaczmarz method
- Convergence rates for Kaczmarz-type algorithms
Cites work
- scientific article; zbMATH DE number 205768 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- 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 methods for consistent and inconsistent linear equations
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Convergence of the simultaneous algebraic reconstruction technique (SART)
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Convergence rates for Kaczmarz-type algorithms
- Convergence rates of the Kaczmarz-Tanabe method for linear systems
- Gauss-Seidel method with oblique direction
- On Diagonally Relaxed Orthogonal Projection Methods
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Projection method for solving a singular system of linear equations and its applications
- Randomized block Kaczmarz method with projection for solving least squares
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
- The mathematics of computerized tomography
Cited in
(4)
This page was built for publication: The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133119)