4,256 research outputs found
High order direct Arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes
We present a new family of very high order accurate direct
Arbitrary-Lagrangian-Eulerian (ALE) Finite Volume (FV) and Discontinuous
Galerkin (DG) schemes for the solution of nonlinear hyperbolic PDE systems on
moving 2D Voronoi meshes that are regenerated at each time step and which
explicitly allow topology changes in time.
The Voronoi tessellations are obtained from a set of generator points that
move with the local fluid velocity. We employ an AREPO-type approach, which
rapidly rebuilds a new high quality mesh rearranging the element shapes and
neighbors in order to guarantee a robust mesh evolution even for vortex flows
and very long simulation times. The old and new Voronoi elements associated to
the same generator are connected to construct closed space--time control
volumes, whose bottom and top faces may be polygons with a different number of
sides. We also incorporate degenerate space--time sliver elements, needed to
fill the space--time holes that arise because of topology changes. The final
ALE FV-DG scheme is obtained by a redesign of the fully discrete direct ALE
schemes of Boscheri and Dumbser, extended here to moving Voronoi meshes and
space--time sliver elements. Our new numerical scheme is based on the
integration over arbitrary shaped closed space--time control volumes combined
with a fully-discrete space--time conservation formulation of the governing PDE
system. In this way the discrete solution is conservative and satisfies the GCL
by construction.
Numerical convergence studies as well as a large set of benchmarks for
hydrodynamics and magnetohydrodynamics (MHD) demonstrate the accuracy and
robustness of the proposed method. Our numerical results clearly show that the
new combination of very high order schemes with regenerated meshes with
topology changes lead to substantial improvements compared to direct ALE
methods on conforming meshes
Dense point sets have sparse Delaunay triangulations
The spread of a finite set of points is the ratio between the longest and
shortest pairwise distances. We prove that the Delaunay triangulation of any
set of n points in R^3 with spread D has complexity O(D^3). This bound is tight
in the worst case for all D = O(sqrt{n}). In particular, the Delaunay
triangulation of any dense point set has linear complexity. We also generalize
this upper bound to regular triangulations of k-ply systems of balls, unions of
several dense point sets, and uniform samples of smooth surfaces. On the other
hand, for any n and D=O(n), we construct a regular triangulation of complexity
Omega(nD) whose n vertices have spread D.Comment: 31 pages, 11 figures. Full version of SODA 2002 paper. Also available
at http://www.cs.uiuc.edu/~jeffe/pubs/screw.htm
High Order Cell-Centered Lagrangian-Type Finite Volume Schemes with Time-Accurate Local Time Stepping on Unstructured Triangular Meshes
We present a novel cell-centered direct Arbitrary-Lagrangian-Eulerian (ALE)
finite volume scheme on unstructured triangular meshes that is high order
accurate in space and time and that also allows for time-accurate local time
stepping (LTS). The new scheme uses the following basic ingredients: a high
order WENO reconstruction in space on unstructured meshes, an element-local
high-order accurate space-time Galerkin predictor that performs the time
evolution of the reconstructed polynomials within each element, the computation
of numerical ALE fluxes at the moving element interfaces through approximate
Riemann solvers, and a one-step finite volume scheme for the time update which
is directly based on the integral form of the conservation equations in
space-time. The inclusion of the LTS algorithm requires a number of crucial
extensions, such as a proper scheduling criterion for the time update of each
element and for each node; a virtual projection of the elements contained in
the reconstruction stencils of the element that has to perform the WENO
reconstruction; and the proper computation of the fluxes through the space-time
boundary surfaces that will inevitably contain hanging nodes in time due to the
LTS algorithm. We have validated our new unstructured Lagrangian LTS approach
over a wide sample of test cases solving the Euler equations of compressible
gasdynamics in two space dimensions, including shock tube problems, cylindrical
explosion problems, as well as specific tests typically adopted in Lagrangian
calculations, such as the Kidder and the Saltzman problem. When compared to the
traditional global time stepping (GTS) method, the newly proposed LTS algorithm
allows to reduce the number of element updates in a given simulation by a
factor that may depend on the complexity of the dynamics, but which can be as
large as 4.7.Comment: 31 pages, 13 figure
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology
- …