摘要
应用RCM(Reverse Cuthill-Mckee)算法进行带宽优化时存在优化结果不稳定的问题,通过对算法进行系统分析发现,正序排列过程中非完全依靠节点之间的拓扑关系是问题的关键。本文在考虑层、联结度判据基础上,通过新增列高和判据进行节点正序排列,解决了RCM算法存在的问题,通过实际结构算例验证了改进后的RCM算法的稳定性,并获得了列高和更小的优化方案,实现了节省计算机内存和提高运算效率的目的。
There exists a problem of instability in optimizing bandwidth by RCM(Reverse Cuthill-Mckee)algorithm in finite element analysis.Through systemic analysis on the algorithm,it is found that the key issue results from incomplete dependence on the topological relationship between the nodes during sequential arrangement.The instability of RCM algorithm is solved by increasing the column height sum as a new criterion for node sequential arrangement,on the base of considering layer and number of neighbor nodes as two old criterions.Via a real structure as an example,the stability of the modified RCM Algorithm is verified,an optimized scheme with less column height sum is achieved,and thus the goal is realized for saving computer memory and raising calculation efficiency.
出处
《计算力学学报》
EI
CAS
CSCD
北大核心
2010年第4期694-697,共4页
Chinese Journal of Computational Mechanics
基金
国家自然科学基金重大研究计划(90715008)
比利时-中国政府间合作(BIL07/07)资助项目
关键词
有限元
带宽优化
改进RCM算法
列高和
拓扑关系
finite element
bandwidth optimization
modified RCM algorithm
column height sum
topological relationship