摘要
基于传统迭代算法在求解不动点方程的过程中求解结果与初始点选取有很大关系且很难满足并行性的要求,提出了一种求解不动点方程的改进人工鱼群算法。该算法实现了求解不动点方程的并行性,克服了初始点的影响,同时把Cauchy序列引入到觅食行为中,提高整个算法的求解精度和速度。仿真实验验证了该算法的有效性。
Solving fixed point equation by traditional iterative algorithm not only has the very big relation with the initial point but also cannot satisfy parallel. This paper presented a novel improved artificial fish school algorithm to solving fixed point equation. The algorithm achieved parallel and global solution,and it overcame the influence of the initial point. Meanwhile added Cauchy iterative sequence in preying behavior to find the solution of high-precision and improve convergence. Several simulation experiments have confirmed this algorithm validity.
出处
《计算机应用研究》
CSCD
北大核心
2010年第9期3356-3357,3367,共3页
Application Research of Computers
基金
广西自然科学基金资助项目(0728054)
关键词
不动点方程
人工鱼群算法
Cauchy迭代序列
fixed point equation
artificial fish school algorithm
Cauchy iterative sequence
