A multilevel approach for obtaining locally optimal finite element meshes

In this paper we consider the adaptive finite element solution of a general class of variational problems using a combination of node insertion, node movement and edge swapping. The adaptive strategy that is proposed is based upon the construction of a hierarchy of locally optimal meshes starting with a coarse grid for which the location and connectivity of the nodes is optimized. This grid is then locally refined and the new mesh is optimized in the same manner. Results presented indicate that this approach is able to produce better meshes than those possible by more conventional adaptive strategies and in a relatively efficient manner

Controllers for imposing continuum-to-molecular boundary conditions in arbitrary fluid flow geometries

We present a new parallelised controller for steering an arbitrary geometric region of a molecular dynamics (MD) simulation towards a desired thermodynamic and hydrodynamic state. We show that the controllers may be applied anywhere in the domain to set accurately an initial MD state, or solely at boundary regions to prescribe non-periodic boundary conditions (PBCs) in MD simulations. The mean molecular structure and velocity autocorrelation function remain unchanged (when sampled a few molecular diameters away from the constrained region) when compared with those distributions measured using PBCs. To demonstrate the capability of our new controllers, we apply them as non-PBCs in parallel to a complex MD mixing nano-channel and in a hybrid MD continuum simulation with a complex coupling region. The controller methodology is easily extendable to polyatomic MD fluids

Parallel implementation of an optimal two level additive Schwarz preconditioner for the 3-D finite element solution of elliptic partial differential equations

This paper presents a description of the extension and parallel implementation of a new two level additive Schwarz (AS) preconditioner for the solution of 3-D elliptic partial differential equations (PDEs). This preconditioner, introduced in Bank et al. (SIAM J. Sci. Comput. 2002; 23: 1818), is based upon the use of a novel form of overlap between the subdomains which makes use of a hierarchy of meshes: with just a single layer of overlapping elements at each level of the hierarchy. The generalization considered here is based upon the restricted AS approach reported in (SIAM J. Sci. Comput. 1999; 21: 792) and the parallel implementation is an extension of work in two dimensions (Concurrency Comput. Practice Experience 2001; 13: 327)

Locally optimal unstructured finite element meshes in 3 dimensions

This paper investigates the adaptive finite element solution of a general class of variational problems in three dimensions using a combination of node movement, edge swapping, face swapping and node insertion. The adaptive strategy proposed is a generalization of previous work in two dimensions and is based upon the construction of a hierarchy of locally optimal meshes. Results presented, both for a single equation and a system of coupled equations, suggest that this approach is able to produce better meshes of tetrahedra than those obtained by more conventional adaptive strategies and in a relatively efficient manner

Low-order continuous finite element spaces on hybrid non-conforming hexahedral-tetrahedral meshes

This article deals with solving partial differential equations with the finite element method on hybrid non-conforming hexahedral-tetrahedral meshes. By non-conforming, we mean that a quadrangular face of a hexahedron can be connected to two triangular faces of tetrahedra. We introduce a set of low-order continuous (C0) finite element spaces defined on these meshes. They are built from standard tri-linear and quadratic Lagrange finite elements with an extra set of constraints at non-conforming hexahedra-tetrahedra junctions to recover continuity. We consider both the continuity of the geometry and the continuity of the function basis as follows: the continuity of the geometry is achieved by using quadratic mappings for tetrahedra connected to tri-affine hexahedra and the continuity of interpolating functions is enforced in a similar manner by using quadratic Lagrange basis on tetrahedra with constraints at non-conforming junctions to match tri-linear hexahedra. The so-defined function spaces are validated numerically on simple Poisson and linear elasticity problems for which an analytical solution is known. We observe that using a hybrid mesh with the proposed function spaces results in an accuracy significantly better than when using linear tetrahedra and slightly worse than when solely using tri-linear hexahedra. As a consequence, the proposed function spaces may be a promising alternative for complex geometries that are out of reach of existing full hexahedral meshing methods

Investigation of mixed element hybrid grid-based CFD methods for rotorcraft flow analysis

Accurate first-principles flow prediction is essential to the design and development of rotorcraft, and while current numerical analysis tools can, in theory, model the complete flow field, in practice the accuracy of these tools is limited by various inherent numerical deficiencies. An approach that combines the first-principles physical modeling capability of CFD schemes with the vortex preservation capabilities of Lagrangian vortex methods has been developed recently that controls the numerical diffusion of the rotor wake in a grid-based solver by employing a vorticity-velocity, rather than primitive variable, formulation. Coupling strategies, including variable exchange protocols are evaluated using several unstructured, structured, and Cartesian-grid Reynolds Averaged Navier-Stokes (RANS)/Euler CFD solvers. Results obtained with the hybrid grid-based solvers illustrate the capability of this hybrid method to resolve vortex-dominated flow fields with lower cell counts than pure RANS/Euler methods

A Multi-signal Variant for the GPU-based Parallelization of Growing Self-Organizing Networks

Among the many possible approaches for the parallelization of self-organizing networks, and in particular of growing self-organizing networks, perhaps the most common one is producing an optimized, parallel implementation of the standard sequential algorithms reported in the literature. In this paper we explore an alternative approach, based on a new algorithm variant specifically designed to match the features of the large-scale, fine-grained parallelism of GPUs, in which multiple input signals are processed at once. Comparative tests have been performed, using both parallel and sequential implementations of the new algorithm variant, in particular for a growing self-organizing network that reconstructs surfaces from point clouds. The experimental results show that this approach allows harnessing in a more effective way the intrinsic parallelism that the self-organizing networks algorithms seem intuitively to suggest, obtaining better performances even with networks of smaller size.Comment: 17 page

One machine, one minute, three billion tetrahedra

This paper presents a new scalable parallelization scheme to generate the 3D Delaunay triangulation of a given set of points. Our first contribution is an efficient serial implementation of the incremental Delaunay insertion algorithm. A simple dedicated data structure, an efficient sorting of the points and the optimization of the insertion algorithm have permitted to accelerate reference implementations by a factor three. Our second contribution is a multi-threaded version of the Delaunay kernel that is able to concurrently insert vertices. Moore curve coordinates are used to partition the point set, avoiding heavy synchronization overheads. Conflicts are managed by modifying the partitions with a simple rescaling of the space-filling curve. The performances of our implementation have been measured on three different processors, an Intel core-i7, an Intel Xeon Phi and an AMD EPYC, on which we have been able to compute 3 billion tetrahedra in 53 seconds. This corresponds to a generation rate of over 55 million tetrahedra per second. We finally show how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator which takes as input the triangulated surface boundary of the volume to mesh