2.4.1 / February 29, 2016
|Operating system||Linux, Unix, OS X|
|Type||Finite element analysis|
|License||GPL (version 2) with "runtime exception"|
The DUNE library is divided into modules. In version 2.4 are the modules
- general classes and infrastructure: dune-common,
- geometry classes: dune-geometry,
- grid interface: dune-grid,
- linear algebra classes: dune-istl,
- local ansatz functions: dune-localfunctions,
and a documentation module available. In addition there are several further modules, including some which have been developed by third parties.
The development of DUNE started in 2002 on the initiative of Prof. Bastian (then Heidelberg University), Dr. Ohlberger (during his habilitation at the University of Freiburg), and Prof. Rumpf (then University of Duisburg-Essen). The aim was a development model which was not attached to a single university, in order to make the project attractive for a wide audience. For the same reason a license was chosen which allows DUNE together with proprietary libraries. While most of developers still have a university background, others are providing commercial support for DUNE.
Right from the start the main design goal of DUNE was to allow the coupling of new and legacy codes efficiently. This is what sets DUNE apart from other finite element programs.
DUNE is primarily a set of abstract interfaces, which embody concepts from scientific computing. These are mainly intended to be used in finite element and finite volume applications, but also finite difference methods are possible. The central interface is the grid interface. It describes structured and unstructured grids of arbitrary dimension, both with manifold and non-manifold structure. Also, functionality for parallel programming is described. Seven different implementations of the grid interface exist. Four of these are encapsulations of existing grid managers. It is hence possible to directly compare different grid implementations.
Various C++ techniques such as template programming, generic programming, C++ template metaprogramming, and static polymorphism are used. These are well known in other areas of software development and are slowly making their way into scientific computing. They allow the compiler to eliminate most of the overhead introduced by the extra layer of abstraction. A high level of standard conformance is required for this from the compiler.