论文标题
一种新型贪婪的Kaczmarz方法，用于解决一致的线性系统
A Novel Greedy Kaczmarz Method For Solving Consistent Linear Systems
论文作者
论文摘要
通过确定工作行的完全不同的方式，我们提出了一种新型的贪婪的Kaczmarz方法，用于解决一致的线性系统。提供了新方法的收敛分析。数值实验表明，以相同的精度，我们的方法优于贪婪的随机Kaczmarz方法和Bai和Wu [Z.Z. Bai和W.T. Wu，关于贪婪的随机Kaczmarz方法，用于解决大型稀疏线性系统，Siam J. Sci。 Comput。，40（2018），第A592-A606页； Z.Z. Bai和W.T. Wu，在宽松的贪婪的随机Kaczmarz方法上，用于求解大型稀疏线性系统，应用。数学。 Lett。，83（2018），第21--26页]在计算时间期间。
With a quite different way to determine the working rows, we propose a novel greedy Kaczmarz method for solving consistent linear systems. Convergence analysis of the new method is provided. Numerical experiments show that, for the same accuracy, our method outperforms the greedy randomized Kaczmarz method and the relaxed greedy randomized Kaczmarz method introduced recently by Bai and Wu [Z.Z. BAI AND W.T. WU, On greedy randomized Kaczmarz method for solving large sparse linear systems, SIAM J. Sci. Comput., 40 (2018), pp. A592--A606; Z.Z. BAI AND W.T. WU, On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems, Appl. Math. Lett., 83 (2018), pp. 21--26] in term of the computing time.
