Convergence properties of ART and SOR algorithms

DOI10.1007/BF01385772zbMath0724.65027OpenAlexW2090859690MaRDI QIDQ758103

Peter Lancaster, Israel Koltracht, Ludwig Elsner

Publication date: 1991

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133541

zbMATH Keywords

convergenceiterative methodssuccessive overrelaxationunderrelaxationAlgebraic reconstruction technique

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

The structure of some matrices arising in tomography, On the acceleration of Kaczmarz's method for inconsistent linear systems, Constrained Kaczmarz extended algorithm for image reconstruction, On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data, On the spectrum of the SOR operator for symmetric positive definite matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the ART of relaxation
• Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
• The angles between the null spaces of X rays
• Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• Projection method for solving a singular system of linear equations and its applications
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• A relaxation method for reconstructing objects from noisy X-rays
• Relaxation methods for image reconstruction
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
• Inconsistencies and S.O.R. Convergence for the Discrete Neumann Problem