HOME 
CONTACT Differences
This shows you the differences between two versions of the page.
|
programing_guide [2012/03/22 21:28] otadmin |
programing_guide [2014/10/10 16:01] (current) |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| ===== Introduction ===== | ===== Introduction ===== | ||
| - | == Why a Finite Element library ? == | + | === Why a Finite Element library ? === |
| A great number of finite element programs have been developed over the last few years at the EDF-LNHE. These have been based on a single data structure, initiated by the development of TELEMAC-2D. Algorithms used by one program, for example to process a diffusion operator, can also be used by another. It was therefore felt to be quite natural to group together all the numerical | A great number of finite element programs have been developed over the last few years at the EDF-LNHE. These have been based on a single data structure, initiated by the development of TELEMAC-2D. Algorithms used by one program, for example to process a diffusion operator, can also be used by another. It was therefore felt to be quite natural to group together all the numerical | ||
| Line 36: | Line 36: | ||
| - | == Brief description of BIEF == | + | === Brief description of BIEF === |
| The data structure and programming of BIEF is described in detail in Part B of this document. One of the important features of this structure is that matrices are stored either in elementary form or in an edge-by-edge storage. Compared with compact storage, this type of storage saves on memory space for numerous types of elements and also enables resolution algorithms to be obtained quickly and efficiently. In fact, one of the essential features of BIEF is to offer methods with very low computing costs. | The data structure and programming of BIEF is described in detail in Part B of this document. One of the important features of this structure is that matrices are stored either in elementary form or in an edge-by-edge storage. Compared with compact storage, this type of storage saves on memory space for numerous types of elements and also enables resolution algorithms to be obtained quickly and efficiently. In fact, one of the essential features of BIEF is to offer methods with very low computing costs. | ||
| Line 46: | Line 46: | ||
| - | == Fortran 90: Reasons for changes == | + | === Fortran 90: Reasons for changes === |
| TELEMAC was written in Fortran 77 up to version 3.2. There are a number of reasons | TELEMAC was written in Fortran 77 up to version 3.2. There are a number of reasons | ||
| Line 69: | Line 69: | ||
| ===== List of topics ===== | ===== List of topics ===== | ||
| - | * **Programming with BIEF 6.+** | + | === Programming with BIEF 6.+ === |
| * [[Programing Guide:Features of Fortran 90 used in BIEF|Features of Fortran 90 used in BIEF]] | * [[Programing Guide:Features of Fortran 90 used in BIEF|Features of Fortran 90 used in BIEF]] | ||
| Line 112: | Line 112: | ||
| * general structure of a programme based on BIEF 6.+ | * general structure of a programme based on BIEF 6.+ | ||
| - | * **Internal structure of BIEF** | + | === Internal structure of BIEF === |
| * [[Programing Guide:BIEF data structure|BIEF data structure]] | * [[Programing Guide:BIEF data structure|BIEF data structure]] | ||
