巴拿赫空间中Landweber迭代算法的收敛性  

Convergence Analysis on Landweber Iterative Algorithm in Banach Spaces

作　　者：杜玲玲[1] 王金平[1] 

机构地区：[1]宁波大学理学院,浙江宁波315211

出　　处：《宁波大学学报（理工版）》2016年第2期85-88,共4页Journal of Ningbo University：Natural Science and Engineering Edition

基　　金：国家自然科学基金(61271398)

摘　　要：为了得到可逆问题的近似解,在Banach空间中引入Bregman距离,构造迭代步长,得到Bregman距离序列在迭代中单调递减的性质.然后利用非线性Landweber迭代算法,证明了该算法的收敛性.In order to obtain the approximate solution of inverse problem, we introduce the first definition of Bregman distance followed by constructing the itertive step. In this work, that the sequence of Bregman distance is monotone decreasing is derived. Then using the nonlinear Landweber iterative algorithm, the convergence of the iterative algorithm is proved in theory and the inverse problem is solved as a result.

关 键 词：BANACH空间 Bregman距离 非线性Landweber迭代算法 对偶映射 

分 类 号：O177.6[理学—数学] O175.5[理学—基础数学]