On spectral properties and fast initial convergence of the Kaczmarz method

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Hansen, Per Christian, Hochstenbach, Michiel E.
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911369373155328
author Hansen, Per Christian
Hochstenbach, Michiel E.
author_facet Hansen, Per Christian
Hochstenbach, Michiel E.
contents The Kaczmarz method is successfully used for solving discretizations of linear inverse problems, especially in computed tomography where it is known as ART. Practitioners often observe and appreciate its fast convergence in the first few iterations, leading to the same favorable semi-convergence that we observe for simultaneous iterative reconstruction methods. While the latter methods have symmetric and positive definite iteration operators that facilitate their analysis, the operator in Kaczmarz's method is nonsymmetric and it has been an open question so far to understand this fast initial convergence. We perform a spectral analysis of Kaczmarz's method that gives new insight into its (often fast) initial behavior. We also carry out a statistical analysis of how the data noise enters the iteration vectors, which sheds new light on the semi-convergence. Our results are illustrated with several numerical examples.
format Preprint
id arxiv_https___arxiv_org_abs_2601_07498
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On spectral properties and fast initial convergence of the Kaczmarz method
Hansen, Per Christian
Hochstenbach, Michiel E.
Numerical Analysis
65F10, 65F22, 65R30, 65R32, 65F50
The Kaczmarz method is successfully used for solving discretizations of linear inverse problems, especially in computed tomography where it is known as ART. Practitioners often observe and appreciate its fast convergence in the first few iterations, leading to the same favorable semi-convergence that we observe for simultaneous iterative reconstruction methods. While the latter methods have symmetric and positive definite iteration operators that facilitate their analysis, the operator in Kaczmarz's method is nonsymmetric and it has been an open question so far to understand this fast initial convergence. We perform a spectral analysis of Kaczmarz's method that gives new insight into its (often fast) initial behavior. We also carry out a statistical analysis of how the data noise enters the iteration vectors, which sheds new light on the semi-convergence. Our results are illustrated with several numerical examples.
title On spectral properties and fast initial convergence of the Kaczmarz method
topic Numerical Analysis
65F10, 65F22, 65R30, 65R32, 65F50
url https://arxiv.org/abs/2601.07498