Improving modularity in object-oriented finite element programming
被引:0
|
作者:
DuboisPelerin, Y
论文数: 0引用数: 0
h-index: 0
机构:
COMMISS EUROPEAN COMMUNITIES, JOINT RES CTR, STRUCT MECH UNIT TP480, I-21020 ISPRA, VARESE, ITALYCOMMISS EUROPEAN COMMUNITIES, JOINT RES CTR, STRUCT MECH UNIT TP480, I-21020 ISPRA, VARESE, ITALY
DuboisPelerin, Y
[1
]
Pegon, P
论文数: 0引用数: 0
h-index: 0
机构:
COMMISS EUROPEAN COMMUNITIES, JOINT RES CTR, STRUCT MECH UNIT TP480, I-21020 ISPRA, VARESE, ITALYCOMMISS EUROPEAN COMMUNITIES, JOINT RES CTR, STRUCT MECH UNIT TP480, I-21020 ISPRA, VARESE, ITALY
Pegon, P
[1
]
机构:
[1] COMMISS EUROPEAN COMMUNITIES, JOINT RES CTR, STRUCT MECH UNIT TP480, I-21020 ISPRA, VARESE, ITALY
Making a finite element code easier to maintain is achieved by further modularizing it. Due to its two levels of modularity (of procedures and data), object-oriented programming is the method of choice. Its potential is investigated in two bottlenecks of finite element programming where so far it has not proved significantly more successful than classical Fortran programming. The first of these is the lack of adequate data structures between the analysis specifications and the basic objects of the finite element method, like the element and the node. This is solved by defining two classes of objects, namely problem and domain, with clearly differentiated specifications. The second gap deals with solving linear equation systems. Introducing an intermediate class UnassembledMatrix allows alternative storage/solving schemes to be implemented in a very flexible manner. (C) 1997 by John Wiley & Sons, Ltd.