【摘要】 针对目前计算Banach不动点的迭代算法存在着收敛性和性能特征在很大程度上依赖于初始点和计算过程因串行运行造成效率低等问题,提出了应用进化策略算法来计算Banach不动点的并行算法,充分发挥了进化策略算法的群体搜索和全局收敛的特性,快速的并行搜索,有效地克服了经典Banach不动点的迭代算法初始点敏感和效率低的问题。数值计算结果表明该算法收敛速度快、精度高、鲁棒性强,为计算Banach不动点提供了一种可行的方法。更多还原

【Abstract】 Using iteration algorithm to solve Banach fixed point has the problems that the convergence and performance characteristics may be highly sensitive to the initial guess and the low efficiency.This paper presents a parallel algorithm for solving Banach fixed point.The method sufficiently takes the advantage of evolution strategies such as group search and global convergence,and quick parallel search can efficiently overcome the problems of high sensitivity to initial guess and the low efficiency.The numerical computation results indicate that the algorithm has high convergence rate and high accuracy,offers an effective way to solve Banach fixed point.更多还原