有限元方法中网格编码的优化问题  

Optimality Problem of Net Coding in Finite Element Method

作　　者：赵登虎[1] 李志敏[2] 

机构地区：[1]南京政治学院,南京210003 [2]青岛建筑工程学院,青岛266033

出　　处：《工科数学》2001年第2期21-28,共8页Journal of Mathematics For Technology

摘　　要：This thesis introduces a new method of net coding. The application of the common triangle net of six nodes, rectangle net of eight nodes and letrahedron net of twelve nodes suggests that the coding produced by this method reduces A) the storage space by 13,15,17 in comparison with common linear coding, and B) the amount of calculation by 70.4%, 48.8%, 37.1%. Moreover, realizing this coding is easy.This thesis introduces a new method of net coding. The application of the common triangle net of six nodes, rectangle net of eight nodes and letrahedron net of twelve nodes suggests that the coding produced by this method reduces A) the storage space by 13,15,17 in comparison with common linear coding, and B) the amount of calculation by 70.4%, 48.8%, 37.1%. Moreover, realizing this coding is easy.

关 键 词：有限元方法 网格编码 最佳编码 优化 总刚矩阵 

分 类 号：O157.4[理学—数学]