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

Hilbert尺度下一般光滑性条件的隐式迭代方法

Implicit iteration methods in Hilbert scales under general smoothness conditions

Virginia Tech(弗吉尼亚理工大学);University of Applied Sciences Zittau/Görlitz(齐陶/格尔利茨应用科技大学)

Qinian Jin, Ulrich Tautenhahn

AI总结:

针对带噪声右端项的线性不适定问题,本文利用Hilbert尺度下的隐式迭代方法,通过算子单调性和变尺度插值技术,在一般光滑性条件下获得正则化解,并给出先验和后验参数选取下的最优阶误差界,同时提出基于牛顿法的快速算法实现后验参数选取。

摘要:

对于求解线性不适定问题,当右端项带有噪声时需要正则化方法。本文通过Hilbert尺度下的隐式迭代方法获得正则化解。通过利用某些函数的算子单调性和变Hilbert尺度的插值技术,我们在一般光滑性条件下研究了这些方法。当正则化参数先验选取或通过偏差原理后验选取时,给出了阶最优误差界。为了实现偏差原理,提出了一种基于牛顿法的快速算法,该算法应用于适当变换后的方程。

英文摘要:

For solving linear ill-posed problems regularization methods are required when the right hand side is with some noise. In the present paper regularized solutions are obtained by implicit iteration methods in Hilbert scales. % By exploiting operator monotonicity of certain functions and interpolation techniques in variable Hilbert scales, we study these methods under general smoothness conditions. Order optimal error bounds are given in case the regularization parameter is chosen either {\it a priori} or {\it a posteriori} by the discrepancy principle. For realizing the discrepancy principle, some fast algorithm is proposed which is based on Newton's method applied to some properly transformed equations.

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

↑