摘要
引用图论理论到网格的节点编号优化算法中,把网格看成是简单的无向图,应用图的分层理论,生成整个网格的树结构,然后在树结构中按照从上到下、从左到右的顺序重新编号。算法用于覆盖件冲压成形分析程序中,计算实例速度表明,算法能大大缩短刚度矩阵带宽,提高计算速度。
Graph theory is referred to for the optimizing algorithm of node number. Mesh is regarded as an indirected graph, then tree structure of mesh is formed based on the delamination theory. Node number is renumbered according to the sequence of from the top down and left to right. The algorithm is applied to the program for sheet metal forming, which indicates that it can shorten the bandwidth of stiffness matrix consumedly and improves the calculation speed.
出处
《塑性工程学报》
EI
CAS
CSCD
北大核心
2006年第2期29-31,共3页
Journal of Plasticity Engineering
关键词
网格
有限元
无向图
mesh
finite element
indirected graph