悬链线索单元算法的改进  

AN IMPROVED ALGORITHM FOR CATENARY CABLE ELEMENT

作　　者：聂建国[1] 陈必磊[1] 肖建春[1] 

机构地区：[1]清华大学土木工程系,北京100084

出　　处：《力学与实践》2003年第4期28-32,共5页Mechanics in Engineering

基　　金：国家杰出青年科学基金(50025822);北京市科委项目(H010610230112)

摘　　要：H.B.Jayaraman在20世纪80年代推导的悬链线索元有限元法计算精度高,特别适用于精度要求比较高的大型索结构。但是,当索原长Lu的取值与悬索两节点之间的直线长度相近时,迭代不易收敛,甚至发散。提出了当该迭代不收敛时,应采用的迭代策略。计算结果表明,该方法准确,计算精度高,可供悬索结构设计、施工时参考。The catenary finite element deduced by H.B. Jayaraman in the 1980's has a high precision compared to other finite cable element. However, when the initial unstressed length of the cable is near the length of the chord, iteration may be unsuccessful. In this paper, an improved algorithm is presented. The results show that the new method is effective and can be used in design.

关 键 词：悬索结构 悬链线单元 算法改进 结构设计 有限元法 计算方法 

分 类 号：TU351[建筑科学—结构工程] TU311.4