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

一次性反演方法收敛性分析

On the convergence analysis of one-shot inversion methods

Marcella Bonazzoli, Houssem Haddar, Tuan Anh Vu

AI总结:

本文分析一次性反演方法(内层迭代不完整)的收敛性,建立下降步长充分条件,并通过数值实验证明少量内迭代即可保证良好收敛。

摘要:

当通过基于梯度的优化算法求解反问题时,为计算梯度而引入的相应正问题和伴随问题也可以迭代求解。同时迭代反问题未知量以及正问题和伴随问题解的思想,催生了“一次性反演方法”的概念。我们特别关注内层迭代(针对直接问题和伴随问题)不完整的情况,即在其解达到高精度之前就停止迭代。在此,我们聚焦于一般线性反问题以及相关正问题的通用定点迭代。我们分析了所谓的多步一次性方法的变体,特别是带有正则化参数的半隐式格式。通过研究耦合迭代块矩阵的特征值,我们建立了下降步长收敛的充分条件。文中提供了若干数值实验,以说明这些方法相较于经典梯度下降法的收敛性,其中经典梯度下降法通过直接求解器精确求解正问题和伴随问题。我们观察到,即使存在噪声数据,很少的内层迭代次数就足以保证反演算法的良好收敛性。

英文摘要:

When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same time on the inverse problem unknown and on the forward and adjoint problem solutions yields the concept of one-shot inversion methods. We are especially interested in the case where the inner iterations for the direct and adjoint problems are incomplete, that is, stopped before achieving a high accuracy on their solutions. Here, we focus on general linear inverse problems and generic fixed-point iterations for the associated forward problem. We analyze variants of the so-called multi-step one-shot methods, in particular semi-implicit schemes with a regularization parameter. We establish sufficient conditions on the descent step for convergence, by studying the eigenvalues of the block matrix of the coupled iterations. Several numerical experiments are provided to illustrate the convergence of these methods in comparison with the classical gradient descent, where the forward and adjoint problems are solved exactly by a direct solver instead. We observe that very few inner iterations are enough to guarantee good convergence of the inversion algorithm, even in the presence of noisy data.

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

↑