Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems
Year: 2022
Author: Guo-Feng Zhang, Fang Geng, Li-Xiao Duan, Guo-Feng Zhang
Numerical Mathematics: Theory, Methods and Applications, Vol. 15 (2022), Iss. 2 : pp. 464–483
Abstract
The Kaczmarz algorithm is a common iterative method for solving linear systems. As an effective variant of Kaczmarz algorithm, the greedy Kaczmarz algorithm utilizes the greedy selection strategy. The two-subspace projection method performs an optimal intermediate projection in each iteration. In this paper, we introduce a new greedy Kaczmarz method, which give full play to the advantages of the two improved Kaczmarz algorithms, so that the generated iterative sequence can exponentially converge to the optimal solution. The theoretical analysis reveals that our algorithm has a smaller convergence factor than the greedy Kaczmarz method. Experimental results confirm that our new algorithm is more effective than the greedy Kaczmarz method for coherent systems and the two-subspace projection method for appropriate scale systems.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/nmtma.OA-2021-0126
Numerical Mathematics: Theory, Methods and Applications, Vol. 15 (2022), Iss. 2 : pp. 464–483
Published online: 2022-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 20
Keywords: Kaczmarz algorithm two-subspace greedy methods linear systems.