7,571 research outputs found
Accurate gradient computations at interfaces using finite element methods
New finite element methods are proposed for elliptic interface problems in
one and two dimensions. The main motivation is not only to get an accurate
solution but also an accurate first order derivative at the interface (from
each side). The key in 1D is to use the idea from \cite{wheeler1974galerkin}.
For 2D interface problems, the idea is to introduce a small tube near the
interface and introduce the gradient as part of unknowns, which is similar to a
mixed finite element method, except only at the interface. Thus the
computational cost is just slightly higher than the standard finite element
method. We present rigorous one dimensional analysis, which show second order
convergence order for both of the solution and the gradient in 1D. For two
dimensional problems, we present numerical results and observe second order
convergence for the solution, and super-convergence for the gradient at the
interface
A Method for Geometry Optimization in a Simple Model of Two-Dimensional Heat Transfer
This investigation is motivated by the problem of optimal design of cooling
elements in modern battery systems. We consider a simple model of
two-dimensional steady-state heat conduction described by elliptic partial
differential equations and involving a one-dimensional cooling element
represented by a contour on which interface boundary conditions are specified.
The problem consists in finding an optimal shape of the cooling element which
will ensure that the solution in a given region is close (in the least squares
sense) to some prescribed target distribution. We formulate this problem as
PDE-constrained optimization and the locally optimal contour shapes are found
using a gradient-based descent algorithm in which the Sobolev shape gradients
are obtained using methods of the shape-differential calculus. The main novelty
of this work is an accurate and efficient approach to the evaluation of the
shape gradients based on a boundary-integral formulation which exploits certain
analytical properties of the solution and does not require grids adapted to the
contour. This approach is thoroughly validated and optimization results
obtained in different test problems exhibit nontrivial shapes of the computed
optimal contours.Comment: Accepted for publication in "SIAM Journal on Scientific Computing"
(31 pages, 9 figures
h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems
In this work we exploit agglomeration based -multigrid preconditioners to
speed-up the iterative solution of discontinuous Galerkin discretizations of
the Stokes and Navier-Stokes equations. As a distinctive feature -coarsened
mesh sequences are generated by recursive agglomeration of a fine grid,
admitting arbitrarily unstructured grids of complex domains, and agglomeration
based discontinuous Galerkin discretizations are employed to deal with
agglomerated elements of coarse levels. Both the expense of building coarse
grid operators and the performance of the resulting multigrid iteration are
investigated. For the sake of efficiency coarse grid operators are inherited
through element-by-element projections, avoiding the cost of numerical
integration over agglomerated elements. Specific care is devoted to the
projection of viscous terms discretized by means of the BR2 dG method. We
demonstrate that enforcing the correct amount of stabilization on coarse grids
levels is mandatory for achieving uniform convergence with respect to the
number of levels. The numerical solution of steady and unsteady, linear and
non-linear problems is considered tackling challenging 2D test cases and 3D
real life computations on parallel architectures. Significant execution time
gains are documented.Comment: 78 pages, 7 figure
A simple multigrid scheme for solving the Poisson equation with arbitrary domain boundaries
We present a new multigrid scheme for solving the Poisson equation with
Dirichlet boundary conditions on a Cartesian grid with irregular domain
boundaries. This scheme was developed in the context of the Adaptive Mesh
Refinement (AMR) schemes based on a graded-octree data structure. The Poisson
equation is solved on a level-by-level basis, using a "one-way interface"
scheme in which boundary conditions are interpolated from the previous coarser
level solution. Such a scheme is particularly well suited for self-gravitating
astrophysical flows requiring an adaptive time stepping strategy. By
constructing a multigrid hierarchy covering the active cells of each AMR level,
we have designed a memory-efficient algorithm that can benefit fully from the
multigrid acceleration. We present a simple method for capturing the boundary
conditions across the multigrid hierarchy, based on a second-order accurate
reconstruction of the boundaries of the multigrid levels. In case of very
complex boundaries, small scale features become smaller than the discretization
cell size of coarse multigrid levels and convergence problems arise. We propose
a simple solution to address these issues. Using our scheme, the convergence
rate usually depends on the grid size for complex grids, but good linear
convergence is maintained. The proposed method was successfully implemented on
distributed memory architectures in the RAMSES code, for which we present and
discuss convergence and accuracy properties as well as timing performances.Comment: 33 pages, 15 figures, accepted for publication in Journal of
Computational Physic
A discontinuous Galerkin method for a new class of Green-Naghdi equations on simplicial unstructured meshes
In this paper, we introduce a discontinuous Finite Element formulation on
simplicial unstructured meshes for the study of free surface flows based on the
fully nonlinear and weakly dispersive Green-Naghdi equations. Working with a
new class of asymptotically equivalent equations, which have a simplified
analytical structure, we consider a decoupling strategy: we approximate the
solutions of the classical shallow water equations supplemented with a source
term globally accounting for the non-hydrostatic effects and we show that this
source term can be computed through the resolution of scalar elliptic
second-order sub-problems. The assets of the proposed discrete formulation are:
(i) the handling of arbitrary unstructured simplicial meshes, (ii) an arbitrary
order of approximation in space, (iii) the exact preservation of the motionless
steady states, (iv) the preservation of the water height positivity, (v) a
simple way to enhance any numerical code based on the nonlinear shallow water
equations. The resulting numerical model is validated through several
benchmarks involving nonlinear wave transformations and run-up over complex
topographies
Reproducibility, accuracy and performance of the Feltor code and library on parallel computer architectures
Feltor is a modular and free scientific software package. It allows
developing platform independent code that runs on a variety of parallel
computer architectures ranging from laptop CPUs to multi-GPU distributed memory
systems. Feltor consists of both a numerical library and a collection of
application codes built on top of the library. Its main target are two- and
three-dimensional drift- and gyro-fluid simulations with discontinuous Galerkin
methods as the main numerical discretization technique. We observe that
numerical simulations of a recently developed gyro-fluid model produce
non-deterministic results in parallel computations. First, we show how we
restore accuracy and bitwise reproducibility algorithmically and
programmatically. In particular, we adopt an implementation of the exactly
rounded dot product based on long accumulators, which avoids accuracy losses
especially in parallel applications. However, reproducibility and accuracy
alone fail to indicate correct simulation behaviour. In fact, in the physical
model slightly different initial conditions lead to vastly different end
states. This behaviour translates to its numerical representation. Pointwise
convergence, even in principle, becomes impossible for long simulation times.
In a second part, we explore important performance tuning considerations. We
identify latency and memory bandwidth as the main performance indicators of our
routines. Based on these, we propose a parallel performance model that predicts
the execution time of algorithms implemented in Feltor and test our model on a
selection of parallel hardware architectures. We are able to predict the
execution time with a relative error of less than 25% for problem sizes between
0.1 and 1000 MB. Finally, we find that the product of latency and bandwidth
gives a minimum array size per compute node to achieve a scaling efficiency
above 50% (both strong and weak)
Degenerate anisotropic elliptic problems and magnetized plasma simulations
This paper is devoted to the numerical approximation of a degenerate
anisotropic elliptic problem. The numerical method is designed for arbitrary
space-dependent anisotropy directions and does not require any specially
adapted coordinate system. It is also designed to be equally accurate in the
strongly and the mildly anisotropic cases. The method is applied to the
Euler-Lorentz system, in the drift-fluid limit. This system provides a model
for magnetized plasmas
- …