Block Kaczmarz–Motzkin Method via Mean Shift Clustering

Yimou Liao, Tianxiu Lu and Feng Yin
Additional contact information
Yimou Liao: College of Mathematical and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
Tianxiu Lu: College of Mathematical and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
Feng Yin: College of Mathematics and Physics, Chengdu University of Technology, Chengdu 643000, China

Mathematics, 2022, vol. 10, issue 14, 1-18

Abstract: Solving systems of linear equations is a fundamental problem in mathematics. Combining mean shift clustering (MS) with greedy techniques, a novel block version of the Kaczmarz–Motzkin method (BKMS), where the blocks are predetermined by MS clustering, is proposed in this paper. Using a greedy strategy, which collects the row indices with the almost maximum distance of the linear subsystem per iteration, can be considered an efficient extension of the sampling Kaczmarz–Motzkin algorithm (SKM). The new method linearly converges to the least-norm solution when the system is consistent. Several examples show that the BKMS algorithm is more efficient compared with other methods (for example, RK, Motzkin, GRK, SKM, RBK, and GRBK).

Keywords: consistent linear system; Kaczmarz–Motzkin; clustering method; convergence property (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/14/2408/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/14/2408/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:14:p:2408-:d:859337

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().