北京航空航天大学学报 ›› 2002, Vol. 28 ›› Issue (3): 339-342.

• 论文 • 上一篇    下一篇

有限元网格结点编号

欧阳兴, 陈中奎, 施法中   

  1. 北京航空航天大学 机械工程及自动化学院
  • 收稿日期:2000-10-22 出版日期:2002-03-31 发布日期:2010-09-26
  • 作者简介:欧阳兴(1968-),男,江西都昌人,博士生,100083,北京.
  • 基金资助:

    国家高技术863计划资助项目(863-511-820-020)

Numbering of Finite Element Mesh Nodes

OUYANG Xing, CHEN Zhong-kui, SHI Fa-zhong   

  1. Beijing University of Aeronautics and Astronautics, School of Mechanical Engineering and Automation
  • Received:2000-10-22 Online:2002-03-31 Published:2010-09-26

摘要: 在有限元分析中,求解高阶线性代数方程组时整体刚度矩阵所需存储与由网格结点编号决定的顺序有关.在基于等带宽存储的求解法与基于变带宽存储的求解法的基础上推导出它们的关系.据此,提出了有限元网格结点编号的前沿法与矩形法,并给出了这两种编号法的内存消耗与结点数量的关系.理论分析和实例表明这两种编号法能有效地减少计算机内存消耗.

Abstract: 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.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发