有限元网格结点编号  

Numbering of Finite Element Mesh Nodes

作　　者：欧阳兴[1] 陈中奎[1] 施法中[1] 

机构地区：[1]北京航空航天大学机械工程及自动化学院

出　　处：《北京航空航天大学学报》2002年第3期339-342,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家高技术 863计划资助项目 (863 5 11 82 0 0 2 0 )

摘　　要：在有限元分析中 ,求解高阶线性代数方程组时整体刚度矩阵所需存储与由网格结点编号决定的顺序有关 .在基于等带宽存储的求解法与基于变带宽存储的求解法的基础上推导出它们的关系 .据此 ,提出了有限元网格结点编号的前沿法与矩形法 ,并给出了这两种编号法的内存消耗与结点数量的关系 .In finite element analysis, the storage needed by a total stiffness matrix for solving a large scale system of linear equations is related to the sequenace determined by numbering of mesh nodes. Based on the solutions for both constant and varible bandwidth storages, their relationship is derived. On the above basis, the frontal method and rectangle method are proposed, the relationships between memory spending for both methods and amount of nodes are given. Theoretical analyzing and practical examples have proved that the two methods can efficiently decrease the memory spending of computer.

关 键 词：有限法 刚度矩阵 线性方程 结点编号 排序 

分 类 号：TB115[理学—数学]