一个新的计算动力缩聚矩阵的迭代公式  

A new iterative formula calculating the dynamic reduction matrix

作　　者：魏震松[1] 王建成[2] 岳志勇[1] 

机构地区：[1]北京大学力学与工程科学系,北京100871 [2]兰州大学物理科学与技术学院,甘肃兰州730000

出　　处：《兰州大学学报（自然科学版）》2002年第6期40-43,共4页Journal of Lanzhou University(Natural Sciences)

摘　　要：从系统的特征方程出发推导出一个新的计算动力缩聚矩阵的迭代公式 .与目前广泛使用的改进逐级近似法的迭代公式相比较 ,此迭代公式更简单 .通过大量的数值计算还发现它的收敛速度也更快 .它优于改进逐级近似法的迭代公式 ,尤其在惯性作用明显和 (或 )缩聚的自由度很大的情况下 ,它的计算效率可以提高 10倍以上 .Based on the system eigenequation,a new iterative formula calculating the dynamic reduction matrix is deduced.Compared with the widely used iterative formula of improved successionlevel approximate reduction(SAR) method,this is much simpler.Its convergence rate is also much quicker than that of the iterative formula of SAR method,which can be testified by a mass of numerical calculation.It is better than the iterative formula of SAR method,especially when the inertial effect is obvious,and (or) when many degrees of freedom are reduced.Here,a numerical example is provided to testify this opinion.

关 键 词：动力缩聚 有限元模型 模型降价 频率 模态 

分 类 号：O302[理学—力学]