Numbering of Finite Element Mesh Nodes
-
摘要: 在有限元分析中,求解高阶线性代数方程组时整体刚度矩阵所需存储与由网格结点编号决定的顺序有关.在基于等带宽存储的求解法与基于变带宽存储的求解法的基础上推导出它们的关系.据此,提出了有限元网格结点编号的前沿法与矩形法,并给出了这两种编号法的内存消耗与结点数量的关系.理论分析和实例表明这两种编号法能有效地减少计算机内存消耗.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.
-
Key words:
- finite element methods /
- stiffness matrix /
- linear equations /
- numbering of nodes /
- sorting
-
[1]Bathe K J. Finite elenent procedures in engineering analysis[M]. PrenticeHall, Inc, Engewood Cliffs, NJ,1982. 441~449. [2]Irons B M. A frontal solution program for finite element analysis[J]. Int J Numer Meth Engng, 1986, 23:239~256. [3]Cuthill E, Mckee J. Reducing the bandwidth of sparse symmetric maxtrices . Proc 24th Nat Conf of the ACM . 1969.157~172. [4]Gibbs N E, Poole W G, Stockmeyer P K. An algorithm for reduce the bandwidth and profile of a sparse matrix[J]. SIMA J Num Anal,1976,13(2):236~250.
点击查看大图
计量
- 文章访问数: 3392
- HTML全文浏览量: 134
- PDF下载量: 1833
- 被引次数: 0