摘要
ＧＳ算法在解决相位恢复问题的计算中有容易陷入局部极小困境的缺点，为克服这一缺点我们提出一种利用中间计算结果及一个加权因子λ来切换初始条件的新算法，该算法能够方便而随机地切换初始相位从而达到在一定程度上克服上述缺点的目的．计算实例表明了改进算法的效果．
Usually GS algorithm falls into a state of local minimum when it is used to resolve the phase retrieval problem. In order to avoid this disadvantage, a new algorithm based on the GS algorithm has been designed, which uses a parameter λ to create a weighted average of the intermediate calculated results and then gives a new initial phase condition. Therefore the initial phase condition can be switched quickly and randomly to overcome this disadvantage. Several examples provided show the efficiency of the newly designed algorithm.
出处
《复旦学报（自然科学版）》
CAS
CSCD
北大核心
2000年第2期205-211,共7页
Journal of Fudan University：Natural Science
关键词
GS算法
初始相位切换
相位恢复
光束改形
激光
GS algorithms
steepest descent method
local minimum
the weighted average of intermediate re suits
initial phase conditions switching
