15 August 2007 in ACM Transactions on Mathematical Software
An overview of the software design and data abstraction decisions chosen for deal.II, a general purpose finite element library written in C++, is given. The library uses advanced object-oriented and data encapsulation techniques to break finite element implementations into smaller blocks that can be arranged to fit users requirements. Through this approach, deal.II supports a large number of different applications covering a wide range of scientific areas, programming methodologies, and application-specific algorithms, without imposing a rigid framework into which they have to fit. A judicious use of programming techniques allows us to avoid the computational costs frequently associated with abstract object-oriented class libraries. The paper presents a detailed description of the abstractions chosen for defining geometric information of meshes and the handling of degrees of freedom associated with finite element spaces, as well as of linear algebra, input/output capabilities and of interfaces to other software, such as visualization tools. Finally, some results obtained with applications built atop deal.II are shown to demonstrate the powerful capabilities of this toolbox.
24 January 2013 in International Journal for Numerical Methods in Fluids
1 December 2002 in Journal of Computational Physics
1 November 2008 in Journal of Computational Physics
1 January 2007 in SIAM Journal on Numerical Analysis
This paper is concerned with the adjoint consistency of discontinuous Galerkin (DG) discretizations. Adjoint consistency—in addition to consistency—is the key requirement for DG discretizations to be of optimal order in $L^2$ as well as measured in terms of target functionals. We provide a general framework for analyzing the adjoint consistency of DG discretizations which is also useful for the derivation of adjoint consistent methods. This analysis will be performed for the DG discretizations of the linear advection equation, the interior penalty DG method for elliptic problems, and the DG discretization of the compressible Euler equations. This framework is then used to derive an adjoint consistent DG discretization of the compressible Navier–Stokes equations. Numerical experiments demonstrate the link of adjoint consistency to the accuracy of numerical flow solutions and the smoothness of discrete adjoint solutions.
1 January 2003 in SIAM Journal on Scientific Computing
We consider the a posteriori error analysis and adaptive mesh design for discontinuous Galerkin finite element approximations to systems of nonlinear hyperbolic conservation laws. In particular, we discuss the question of error estimation for general target functionals of the solution; typical examples include the outflow flux, local average and pointwise value, as well as the lift and drag coefficients of a body immersed in an inviscid fluid. By employing a duality argument, we derive so-called weighted or Type I a posteriori error bounds; these error estimates include the product of the finite element residuals with local weighting terms involving the solution of a certain dual or adjoint problem that must be numerically approximated. Based on the resulting approximate Type I bound, we design and implement an adaptive algorithm that produces meshes specifically tailored to the efficient computation of the given target functional of practical interest. The performance of the proposed adaptive strategy and the quality of the approximate Type I a posteriori error bound is illustrated by a series of numerical experiments. In particular, we demonstrate the superiority of this approach over standard mesh refinement algorithms which employ Type II error indicators.