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

Percolation by cumulative merging and phase transition for the contact process on random graphs

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging smaller clusters and cumulating their weights. For several classical random weighted graphs, we show that there exists a phase transition regarding the existence of an infinite cluster. The motivation for introducing this partition arises from a connection with the contact process as it roughly describes the geometry of the sets where the process survives for a long time. We give a sufficient condition on a graph to ensure that the contact process has a non trivial phase transition in terms of the existence of an infinite cluster. As an application, we prove that the contact process admits a sub-critical phase on d-dimensional random geometric graphs and on random Delaunay triangulations. To the best of our knowledge, these are the first examples of graphs with unbounded degrees where the critical parameter is shown to be strictly positive.Comment: 50 pages, many figure

Discrete Geometric Structures in Homogenization and Inverse Homogenization with application to EIT

We introduce a new geometric approach for the homogenization and inverse homogenization of the divergence form elliptic operator with rough conductivity coefficients $\sigma(x)$ in dimension two. We show that conductivity coefficients are in one-to-one correspondence with divergence-free matrices and convex functions $s(x)$ over the domain $\Omega$. Although homogenization is a non-linear and non-injective operator when applied directly to conductivity coefficients, homogenization becomes a linear interpolation operator over triangulations of $\Omega$ when re-expressed using convex functions, and is a volume averaging operator when re-expressed with divergence-free matrices. Using optimal weighted Delaunay triangulations for linearly interpolating convex functions, we obtain an optimally robust homogenization algorithm for arbitrary rough coefficients. Next, we consider inverse homogenization and show how to decompose it into a linear ill-posed problem and a well-posed non-linear problem. We apply this new geometric approach to Electrical Impedance Tomography (EIT). It is known that the EIT problem admits at most one isotropic solution. If an isotropic solution exists, we show how to compute it from any conductivity having the same boundary Dirichlet-to-Neumann map. It is known that the EIT problem admits a unique (stable with respect to $G$-convergence) solution in the space of divergence-free matrices. As such we suggest that the space of convex functions is the natural space in which to parameterize solutions of the EIT problem

Fully discrete approximation of rate-independent damage models with gradient regularization

This work provides a convergence analysis of a time-discrete scheme coupled with a finite-element approximation in space for a model for partial, rate-independent damage featuring a gradient regularization as well as a non-smooth constraint to account for the unidirectionality of the damage evolution. The numerical algorithm to solve the coupled problem of quasistatic small strain linear elasticity with rate-independent gradient damage is based on a Variable ADMM-method to approximate the nonsmooth contribution. Space-discretization is based on P1 finite elements and the algorithm directly couples the time-step size with the spatial grid size h. For a wide class of gradient regularizations, which allows both for Sobolev functions of integrability exponent r ∈ (1, ∞) and for BV-functions, it is shown that solutions obtained with the algorithm approximate as h → 0 a semistable energetic solution of the original problem. The latter is characterized by a minimality property for the displacements, a semistability inequality for the damage variable and an energy dissipation estimate. Numerical benchmark experiments confirm the stability of the method

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane

For a locally finite set in R2, the order-k Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in k. As an example, a stationary Poisson point process in R2 is locally finite, coarsely dense, and generic with probability one. For such a set, the distribution of angles in the Voronoi tessellations, Delaunay mosaics, and Brillouin tessellations are independent of the order and can be derived from the formula for angles in order-1 Delaunay mosaics given by Miles in 1970

A discrete uniformization theorem for decorated piecewise Euclidean metrics on surfaces

In this paper, we introduce a new discretization of the Gaussian curvature on surfaces, which is defined as the quotient of the angle defect and the area of some dual cell of a weighted triangulation at the conic singularity. A discrete uniformization theorem for this discrete Gaussian curvature is established on surfaces with non-positive Euler number. The main tools are Bobenko-Lutz's discrete conformal theory for decorated piecewise Euclidean metrics on surfaces and variational principles with constraints

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane

For a locally finite set in $\mathbb{R}^2$, the order-$k$ Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in $k$. As an example, a stationary Poisson point process in $\mathbb{R}^2$ is locally finite, coarsely dense, and generic with probability one. For such a set, the distribution of angles in the Voronoi tessellations, Delaunay mosaics, and Brillouin tessellations are independent of the order and can be derived from the formula for angles in order-$1$ Delaunay mosaics given by Miles in 1970

Fully discrete approximation of rate-independent damage models with gradient regularization

This work provides a convergence analysis of a time-discrete scheme coupled with a finite-element approximation in space for a model for partial, rate-independent damage featuring a gradient regularization as well as a non-smooth constraint to account for the unidirectionality of the damage evolution. The numerical algorithm to solve the coupled problem of quasistatic small strain linear elasticity with rate-independent gradient damage is based on a Variable ADMM-method to approximate the nonsmooth contribution. Space-discretization is based on P1 finite elements and the algorithm directly couples the time-step size with the spatial grid size h. For a wide class of gradient regularizations, which allows both for Sobolev functions of integrability exponent r ∈ (1, ∞) and for BV-functions, it is shown that solutions obtained with the algorithm approximate as h → 0 a semistable energetic solution of the original problem. The latter is characterized by a minimality property for the displacements, a semistability inequality for the damage variable and an energy dissipation estimate. Numerical benchmark experiments confirm the stability of the method