摘要
本文从一般迭代法的级数形式出发,将一般迭代法的每一步分解为矩阵计算和求解两步,并对其中的矩阵计算部分进行了修改,在此基础上提出了快速迭代法,最后通过数值实验验证了我们的算法不仅提高了计算速度,同时也大大减少了计算量,是一种效率很高的算法.
This paper sets out from the series form of the general Landweber iteration method, We discompose the each one step of the general Landwber iteration method into two steps as the matrix computation and solution, and modified matrix computation step. Based on this foundation, we propose the fast Landweber iteration method. Finally the number experiment verifies our algorithm not only increasing calculation speed, but also reducing the calculation measures, and so it is a kind of algorithm with high efficiency.
出处
《数学杂志》
CSCD
北大核心
2005年第3期333-335,共3页
Journal of Mathematics
基金
南京理工大学科研发展基金项目(AB96042)
