|国家预印本平台
首页|Two-dimensional greedy randomized extended Kaczmarz methods

Two-dimensional greedy randomized extended Kaczmarz methods

Two-dimensional greedy randomized extended Kaczmarz methods

来源:Arxiv_logoArxiv
英文摘要

The randomized extended Kaczmarz method, proposed by Zouzias and Freris (SIAM J. Matrix Anal. Appl. 34: 773-793, 2013), is appealing for solving least-squares problems. However, its randomly selecting rows and columns of A with probability proportional to their squared norm is unattractive compared to the greedy strategy. In this paper, we first consider a novel two-dimensional greedy randomized extended Kaczmarz method for solving large linear least-squares problems. The proposed method randomly selects two rows and two columns of A by grasping two larger entries in the magnitude of the corresponding residual vector per iteration. To improve its convergence, we then propose a two-dimensional semi-randomized extended Kaczmarz method and its modified version with simple random sampling, which is particularly favorable for big data problems. The convergence analysis of which is also established. Numerical results on some practical applications illustrate the superiority of the proposed methods compared with state-of-the-art randomized extended Kaczmarz methods, especially in terms of computing time.

Xin-Fang Zhang、Meng-Long Xiao、Tao Li

计算技术、计算机技术

Xin-Fang Zhang,Meng-Long Xiao,Tao Li.Two-dimensional greedy randomized extended Kaczmarz methods[EB/OL].(2025-06-19)[2025-07-23].https://arxiv.org/abs/2506.16106.点此复制

评论