作　　者： ; ; ;

机构地区： 吉林大学机械科学与工程学院

出　　处： 《吉林大学学报（工学版）》 2004年第4期684-688,共5页

摘　　要： 结合结构有限元方程组的特征,提出了刚度矩阵的稀疏分块矩阵的双向正交链表存储方案。它不需要行指标和列指标索引,每个子矩阵块使用一个表头,指针和行列号都是4字节整数,有效存储量在84.21%以上。存储数据的复杂度为O(1),大大提高了数据存储速度。 Based on the property of sparse matrices in finite element method (FEM), a two-way cross list for the storage of FEM matrices was proposed, in which the large-scale sparse matrix is partitioned into small matrices, and only none-zero matrices were stored. With four pointers and two position indeces as the head of every small matrices, the row and column indeces are not needed. Thus, the effective storage is larger than 84.21%. The proposed data structure is able to use block algorithm, which is important in high performance computing and is more efficient in many computing environments than those organized at lower linear algebraic lever. In addition, it makes data motion very fast when the memory complexity is reduced to O (1).

关 键 词： 工程力学 有限元 稀疏分块矩阵 高性能计算 面向对象

领　　域： [理学] [理学]