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

迭代分数Tikhonov正则化

Iterated fractional Tikhonov regularization

Università dell’Insubria(因苏布里亚大学)

Davide Bianchi, Alessandro Buccini, Marco Donatelli, Stefano Serra-Capizzano

AI总结:

本文研究了迭代分数Tikhonov正则化方法,通过改进传统Tikhonov正则化以减少过度平滑问题,提出新的迭代方法并证明其收敛性及最优阶数。

摘要:

分数Tikhonov正则化方法最近被提出,以减少标准形式Tikhonov正则化中的过度平滑特性,从而保留近似解的细节。此前的研究已探讨了其正则化和收敛性质,显示其具有最优阶数。本文提供了关于其收敛速率的饱和和逆结果。使用与迭代Tikhonov正则化相同的迭代精炼策略,引入了新的迭代分数Tikhonov正则化方法。我们证明这些迭代方法具有最优阶数,并克服了之前的饱和结果。此外,研究了非稳态的迭代分数Tikhonov正则化方法,在一般迭代参数条件下建立了其收敛速率。数值结果证实了所提正则化迭代的有效性。

英文摘要:

Fractional Tikhonov regularization methods have been recently proposed to reduce the oversmoothing property of the Tikhonov regularization in standard form, in order to preserve the details of the approximated solution. Their regularization and convergence properties have been previously investigated showing that they are of optimal order. This paper provides saturation and converse results on their convergence rates. Using the same iterative refinement strategy of iterated Tikhonov regularization, new iterated fractional Tikhonov regularization methods are introduced. We show that these iterated methods are of optimal order and overcome the previous saturation results. Furthermore, nonstationary iterated fractional Tikhonov regularization methods are investigated, establishing their convergence rate under general conditions on the iteration parameters. Numerical results confirm the effectiveness of the proposed regularization iterations.

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

↑