摘要
对平面复杂机构进行位移分析时,通常要建立一非线性的约束方程组。该方程组的方程个数越多,求解时收敛速度越慢。本文对如何确定该约束方程组最小方程数的问题进行了探讨并得出了结论:位移分析方程组最少约束方程数目为m=2r-S(r为机构独立环路个数,S为移动副的个数)。文中所举实例证明,这一结论是正确的。用此法建立约束方程组可以做到有的放矢,求解时可加快收敛速度、节省机时。
When analysing the displacement of a planar complicated linkage, it is necessary to establish a set of nonlinear constraint equations. The larger is the number of equations, the slower is the velocity of convergency in solving. In this paper a problem how to determine the smallest number of equations is investigated and, therefore, it is concluded that the smallest number is m=2r-S(r—the number of the independent loops of the linkage, S—the number of the sliding pairs of the linkage). By the examples given in this paper, it has been proved that this conclusion is correct. Using this method, we can establish a set of constraint equations speeding up the convergency in solving and thereby reducing the computing time.
出处
《江汉石油学院学报》
CSCD
北大核心
1990年第3期64-69,共6页
Journal of Jianghan Petroleum Institute
关键词
平面机构
位移
约束方程
连杆机构
mechanism
planar linkage
kinematics
displacement
constraint equation
numerical iterative method
convergency
starting value
