arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.07962math.NAcs.NA
收藏

大规模线性反问题的抽样有限记忆方法

Sampled Limited Memory Methods for Massive Linear Inverse Problems

Julianne Chung, Matthias Chung, J. Tanner Slagel, Luis Tenorio

摘要:

在许多现代成像应用中,重建高分辨率图像的愿望,加上来自使用超快探测器采集的丰富数据,导致了图像重建的新挑战。一个主要的挑战是,由此产生的线性逆问题是巨大的。正演模型矩阵的大小超过了计算机内存的存储能力,或者观测数据集非常庞大,无法一次性获得。可以使用行操作方法来近似解决方案,同时避免内存和数据可用性约束。然而,它们的总体趋同可能是缓慢的。本文提出了一种求解线性最小二乘问题的采样有限记忆行处理方法,该方法利用最小二乘问题的全局曲率来加快初始收敛速度,提高迭代精度.我们证明了这种有限记忆方法是阻尼块Kaczmarz方法的推广,并证明了迭代的期望值和误差范数在收敛范围内的线性收敛.数值实验表明,这些采样有限内存行处理方法在层析成像应用中的大规模二维和三维反问题的好处。

英文摘要:

In many modern imaging applications the desire to reconstruct high resolution images, coupled with the abundance of data from acquisition using ultra-fast detectors, have led to new challenges in image reconstruction. A main challenge is that the resulting linear inverse problems are massive. The size of the forward model matrix exceeds the storage capabilities of computer memory, or the observational dataset is enormous and not available all at once. Row-action methods that iterate over samples of rows can be used to approximate the solution while avoiding memory and data availability constraints. However, their overall convergence can be slow. In this paper, we introduce a sampled limited memory row-action method for linear least squares problems, where an approximation of the global curvature of the underlying least squares problem is used to speed up the initial convergence and to improve the accuracy of iterates. We show that this limited memory method is a generalization of the damped block Kaczmarz method, and we prove linear convergence of the expectation of the iterates and of the error norm up to a convergence horizon. Numerical experiments demonstrate the benefits of these sampled limited memory row-action methods for massive 2D and 3D inverse problems in tomography applications.

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

↑