arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.0196math.NAcs.NA
收藏

Kaczmarz方法的收敛加速

Convergence acceleration of Kaczmarz's method

Université des Sciences et Technologies de Lille(里尔科学技术大学);Università degli Studi di Padova(帕多瓦大学)

Claude Brezinski, Michela Redivo-Zaglia

AI总结:

针对Kaczmarz方法收敛慢的问题,提出基于序列变换的加速策略,通过直接加速或重启加速提高效率,数值实验验证有效性。

摘要:

交替投影法(MAP)是一种迭代过程,用于寻找一个点在Hilbert空间中闭子空间交上的投影。该方法收敛通常较慢,已有多种加速方法被提出。本文考虑一种特殊的MAP,即用于求解线性方程组的Kaczmarz方法。讨论了该方法的收敛性。在给出其矩阵形式和投影性质后,我们考虑了几种加速其收敛的程序。这些程序基于序列变换,其核包含与Kaczmarz方法生成的向量序列相同形式的序列。加速可以直接实现,即不修改该方法获得的序列,或者通过从加速获得的向量重新启动来实现。数值例子显示了两种程序的有效性。

英文摘要:

The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for its acceleration have already been proposed. In this work, we consider a special MAP, namely Kaczmarz' method for solving systems of linear equations. The convergence of this method is discussed. After giving its matrix formulation and its projection properties, we consider several procedures for accelerating its convergence. They are based on sequence transformations whose kernels contain sequences of the same form as the sequence of vectors generated by Kaczmarz' method. Acceleration can be achieved either directly, that is without modifying the sequence obtained by the method, or by restarting it from the vector obtained by acceleration. Numerical examples show the effectiveness of both procedures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑