基于类模板链表结构的有限元程序设计
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP311

基金项目:

国家自然科学基金 (5 93 783 5 1)


Finite Element Programming Based on Template Chain Structure
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    传统的有限元程序设计一般采用结构化的程序设计方法和结构化语言(如FORTRAN),其数据存储形式都使用固定的数组结构,使得程序的扩展能力有限,代码的重复利用率低,调试复杂。模板是面向对象的C++语言中相对较新的重要特性,模板能够快速建立类库集合,极大地提高了大型软件的开发速度。采用面向对象的程序设计方法,遵循有限元分析的本质,建立了有关描述有限元模型的类,用链表方式实现结点、单元和材料的数据存放、用多态性实现单元的自由链接,方便地实现了单元增减等用传统语言无法实现的功能。据此编制了有限元分析的数值计算程序,并给出了一个实例。结果表明,程序设计和调试周期较传统设计方法明显缩短,代码的利用率也明显提高。

    Abstract:

    Traditional Finite Element Method is the structuralization programming method and the structuralization language (such as FORTRAN). Its data store uses fixed array structure, which makes the expanding ability of program limited, code's reuse ratio low, debugging complex. The template is an opposite new important characteristic of the object-oriented programming language C++. The template can quickly establish class library so as to increase greatly the development speed of the large software. The object-oriented programming concept is applied to finite element method. According to the nature of the finite element analysis, the classes and their methods, which describe virtual element, node, material etc., have been developed and implemented using the object-oriented programming language C++. The elements, nodes and materials are stored by chain. Many type's elements are stored mixedly by polymorphism characteristic. The program is implemented and a instance is given to show the programming of finite element method. The results show that the period of programming and debugging is obviously shorter than that of traditional method; the code's utilization ratio is also increased obviously.

    参考文献
    相似文献
    引证文献
引用本文

袁政强 白绍良 等.基于类模板链表结构的有限元程序设计[J].重庆大学学报,2002,25(6):102-105108.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期:
  • 出版日期: