基于GBFA求解复微分方程  

Solving Complex Differential Equations Based GBFA

作　　者：张志敏 

机构地区：[1]阳光学院基础教研部,福建福州350015

出　　处：《聊城大学学报（自然科学版）》2017年第1期33-37,43,共6页Journal of Liaocheng University:Natural Science Edition

基　　金：福建省自然科学基金项目(2012J01256)资助

摘　　要：为了提高传统方法在求解二阶以及高阶复微分方程之时搜索能力差、后期收敛速度较慢以及难以得到的缺陷,基于传统的免疫算法(generate and test)和BFA(Bacterial Foraging Algorithm,细菌觅食算法)的相关概念,融合半解析解的相关思想,构建一种新的算法GBFA(Generate Bacterial Foraging Algorithm),并基于此方法进行求解实验,结果表明该方法具有极高的收敛速度,可以得到二阶以及高阶复微分方程解析表达式.In order to enhance the traditional methods in solving when searching fo r second order and higher-order complex dif ferential equations of the poor, the latter is difficult to obtain and slow con-vergence defects, based on traditional immune algorithm （generate and test） and B FA （Bacterial Fora-ging Algorithm , bacterial foraging algor ithm） related concepts, integration of related thought semi-ana-lytical solution to construct a new algorithm GBFA （Generate bacterial foraging algorithm） , and solved by experiments based on this method, the results show that this method has a very high rate of conver-gence, you can be second order and higher-order complex dif ferential equations analytical expressions.

关 键 词：细菌觅食算法 全局搜索 半解析法 解析表达式 

分 类 号：O241.3[理学—计算数学]