期刊文献+

接触分析的光滑模型及迭代算法 被引量:9

SMOOTH MODEL AND ITERATION ALGORITHM FOR CONTACT ANALYSIS
在线阅读 下载PDF
导出
摘要 利用变分不等式和基于信息熵的凝聚函数把有摩擦接触问题模型化为一个标准的凸二次规划问题,极大地简化了这一复杂的问题,同时引入摩擦方向约束并构造了以无摩擦解为初值的迭代算法,在较大摩擦系数时计算也能保证收敛,算例表明算法高效可靠. The model of elastic frictionless contact problems, after finite element discretization, is a formulation of quadratic programming(QP), but the model of frictional contact problems will be more complicated. In tradition, the iterative methods with incremental loading are often adopted, the convergence is guaranteed only on the condition that the step length of the incremental load is sufficiently small. Recently, the linear or nonlinear complementary methods in mathematical programming are utilized as an alternative. Although many algorithms for complementarity problems have been developed in the past years, the convergence of most of these methods requires the monotonicity of the complementarity problems, and the monotonicity cannot be guaranteed by the complementary formulations resulting from the frictional contact, especially in the cases with larger coefficient of friction. In this paper a smooth model and iteration algorithm for solving frictional contact problems is presented. The model is obtained by regularizing the tangential frictional works using entropy based aggregation function. A similar smooth function is constructed to approximate the discrete value --1, 0 and 1, i.e. the inverse slipping, sticking and forward slipping of the potential contact node pairs on the contact surfaces. Several advantages or distinguished features are embodied in the algorithm. At first, the solution of the structure with frictionless contact is used to act as an initial value, and the frictional directions on potential contact surfaces in the current iteration are determined using the ones of the previous iteration. Then, in each iteration step only a very simple standard convex quadratic programming problem is to be solved, and the convergence can be guaranteed in each sub-step, it is one of the most important steps for the convergence for the whole iteration procedure. In addition, the algorithm uses only one loading step. Finally, some typical examples verify the feasibility and efficiency of the method.
出处 《力学学报》 EI CSCD 北大核心 2001年第3期340-348,共9页 Chinese Journal of Theoretical and Applied Mechanics
基金 国家自然科学基金资助项目(59775065).
关键词 摩擦接触 有限元 数学规划 极大熵函数 算法 凸二次规划 迭代方法 接触问题 frictional contact, finite element, mathematical programming, entropy-based regu-larized function, algorithm
  • 相关文献

参考文献6

  • 1李兴斯.解非线性规划的凝聚函数法[J].中国科学(A辑),1991,22(12):1283-1288. 被引量:81
  • 2陈万吉.用有限元混合方法分析弹性接触问题[J].大连工学院学报,1979,2:16-18.
  • 3钟万勰,参变量变分原理及其在工程中的应用,1997年
  • 4李兴斯,中国科学.C,1991年,22卷,1283页
  • 5Hung N D,Comput Struct,1980年,11卷,55页
  • 6陈万吉,大连工学院学报,1979年,2卷,16页

共引文献80

同被引文献68

引证文献9

二级引证文献90

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部