基于几何平滑动量的大规模线性方程组自适应确定性块Kaczmarz方法
An Adaptive Deterministic Block Kaczmarz Algorithm Based on Geometrically Smoothed Momentum for Solving Large-Scale Linear Systems
DOI: 10.12677/aam.2026.152068, PDF,    国家自然科学基金支持
作者: 马家靓*:青岛大学数学与统计学院,山东 青岛;丁洁玉#:青岛大学计算机科学技术学院,山东 青岛
关键词: 线性系统Kaczmarz迭代块方法动量加速System of Linear Equations Kaczmarz Iteration Block Method Momentum Acceleration
摘要: 为高效求解大规模相容线性方程组,本文在已有自适应确定性块Kaczmarz (ADBK)方法的基础上,引入几何平滑动量加速机制,提出了基于几何平滑动量的自适应确定性块Kaczmarz方法。该方法继承了ADBK通过残差范数自适应选取块索引、避免显式计算子矩阵伪逆的计算优势,并在不增加额外计算复杂度的前提下进一步提升了收敛速度。数值实验结果表明,与原始ADBK方法及多种典型算法相比,所提出的方法在迭代次数、计算时间和收敛速度方面均具有明显优势。
Abstract: To efficiently solve large-scale consistent systems of linear equations, this paper proposes an adaptive deterministic block Kaczmarz method based on geometric smooth momentum, building upon the existing Adaptive Deterministic Block Kaczmarz (ADBK) method. The proposed method inherits the computational advantages of ADBK in adaptively selecting block indices through residual norms and avoiding explicit computation of submatrix pseudoinverses. Furthermore, by introducing a geometric smooth momentum acceleration mechanism, the convergence speed is enhanced without increasing additional computational complexity. Numerical experimental results demonstrate that compared with the original ADBK method and various typical algorithms, the proposed method exhibits significant advantages in terms of iteration count, computational time, and convergence rate.
文章引用:马家靓, 丁洁玉. 基于几何平滑动量的大规模线性方程组自适应确定性块Kaczmarz方法[J]. 应用数学进展, 2026, 15(2): 270-280. https://doi.org/10.12677/aam.2026.152068

参考文献

[1] Kaczmarz, S. (1937) Angenaherte auflosung von systemen linearer glei-chungen. Bulletin International de l’Académie des Sciences de Cracovie, Classe des Sciences Mathématiques et Naturelles, 355-357.
[2] Herman, G.T. and Davidi, R. (2008) Image Reconstruction from a Small Number of Projections. Inverse Problems, 24, Article ID: 045011. [Google Scholar] [CrossRef] [PubMed]
[3] Strohmer, T. and Vershynin, R. (2008) A Randomized Kaczmarz Algorithm with Exponential Convergence. Journal of Fourier Analysis and Applications, 15, 262-278. [Google Scholar] [CrossRef
[4] Elfving, T. (1980) Block-Iterative Methods for Consistent and Inconsistent Linear Equations. Numerische Mathematik, 35, 1-12. [Google Scholar] [CrossRef
[5] Needell, D. and Tropp, J.A. (2014) Paved with Good Intentions: Analysis of a Randomized Block Kaczmarz Method. Linear Algebra and its Applications, 441, 199-221. [Google Scholar] [CrossRef
[6] Niu, Y. and Zheng, B. (2020) A Greedy Block Kaczmarz Algorithm for Solving Large-Scale Linear Systems. Applied Mathematics Letters, 104, Article ID: 106294. [Google Scholar] [CrossRef
[7] Rebrova, E. and Needell, D. (2020) On Block Gaussian Sketching for the Kaczmarz Method. Numerical Algorithms, 86, 443-473. [Google Scholar] [CrossRef
[8] Necoara, I. (2019) Faster Randomized Block Kaczmarz Algorithms. SIAM Journal on Matrix Analysis and Applications, 40, 1425-1452. [Google Scholar] [CrossRef
[9] Chen, J. and Huang, Z. (2021) On a Fast Deterministic Block Kaczmarz Method for Solving Large-Scale Linear Systems. Numerical Algorithms, 89, 1007-1029. [Google Scholar] [CrossRef
[10] Tan, L., Guo, X., Deng, M. and Chen, J. (2025) On the Adaptive Deterministic Block Kaczmarz Method with Momentum for Solving Large-Scale Consistent Linear Systems. Journal of Computational and Applied Mathematics, 457, Article ID: 116328. [Google Scholar] [CrossRef
[11] Alderman, S.J., Luikart, R.W. and Marshall, N.F. (2024) Randomized Kaczmarz with Geometrically Smoothed Momentum. SIAM Journal on Matrix Analysis and Applications, 45, 2287-2313. [Google Scholar] [CrossRef
[12] Davis, T.A. and Hu, Y. (2011) The University of Florida Sparse Matrix Collection. ACM Transactions on Mathematical Software, 38, 1-25. [Google Scholar] [CrossRef