Non-overlapping Schwarz algorithms for the Incompressible Navier-Stokes equations with DDFV discretizations

We propose and analyze non-overlapping Schwarz algorithms for the domain decomposition of the unsteady incompressible Navier-Stokes problem with Discrete Duality Finite Volume discretizations. The design of suitable transmission conditions for the velocity and the pressure is a crucial issue. We establish the well-posedness of the method and the convergence of the iterative process, pointing out how the numerical fluxes influence the asymptotic problem which is intended to be a discretization of the Navier-Stokes equations on the entire computational domain.Finally we numerically illustrate the behavior and performances of the algorithm. We discuss on numerical grounds the impact of the parameters for several mesh geometries and we perform simulations of the flow past an obstacle with several domains.

Modelling, computation and analysis on combustion of explosives

When an explosive burns, gaseous products are formed as a result. The interaction of the burning solid and gas is not well understood. More specifically, the process of the gaseous product heating the explosive is yet to be explored in detail. The present work sets out to fill some of that gap using mathematical modelling: this aims to track the temperature profile in the explosive. The work begins by modelling single-step reactions using a simple Arrhenius model. The model is then extended to include three-step reaction. An alternative asymptotic approach is also employed. There is close agreement between results from the full reaction-diffusion problem and the asymptotic problem.

Faces with given directions in anisotropic Poisson hyperplane mosaics

For stationary Poisson hyperplane tessellations in d-dimensional Euclidean space and a dimension k ∈ {1, …, d}, we investigate the typical k-face and the weighted typical k-face (weighted by k-dimensional volume), without isotropy assumptions on the tessellation. The case k = d concerns the previously studied typical cell and zero cell, respectively. For k < d, we first find the conditional distribution of the typical k-face or weighted typical k-face, given its direction. Then we investigate how the shapes of the faces are influenced by assumptions of different types: either via containment of convex bodies of given volume (including a new result for k = d), or, for weighted typical k-faces, in the spirit of D. G. Kendall's asymptotic problem, suitably generalized. In all these results on typical or weighted typical k-faces with given direction space L, the Blaschke body of the section process of the underlying hyperplane process with L plays a crucial role.

Faces with given directions in anisotropic Poisson hyperplane mosaics

For stationary Poisson hyperplane tessellations in d-dimensional Euclidean space and a dimension k ∈ {1, …, d}, we investigate the typical k-face and the weighted typical k-face (weighted by k-dimensional volume), without isotropy assumptions on the tessellation. The case k = d concerns the previously studied typical cell and zero cell, respectively. For k &lt; d, we first find the conditional distribution of the typical k-face or weighted typical k-face, given its direction. Then we investigate how the shapes of the faces are influenced by assumptions of different types: either via containment of convex bodies of given volume (including a new result for k = d), or, for weighted typical k-faces, in the spirit of D. G. Kendall's asymptotic problem, suitably generalized. In all these results on typical or weighted typical k-faces with given direction space L, the Blaschke body of the section process of the underlying hyperplane process with L plays a crucial role.

Optimal boarding policies for thin passengers

We deal with the problem of seating an airplane's passengers optimally, namely in the fastest way. Under several simplifying assumptions, whereby the passengers are infinitely thin and react within a constant time to boarding announcements, we are able to rewrite the asymptotic problem as a calculus of variations problem with constraints. This problem is solved in turn using elementary methods. While the optimal policy is not unique, we identify a rigid discrete structure which is common to all solutions. We also compare the (nontrivial) optimal solutions we find with some simple boarding policies, one of which is shown to be near-optimal.

Optimal boarding policies for thin passengers

We deal with the problem of seating an airplane's passengers optimally, namely in the fastest way. Under several simplifying assumptions, whereby the passengers are infinitely thin and react within a constant time to boarding announcements, we are able to rewrite the asymptotic problem as a calculus of variations problem with constraints. This problem is solved in turn using elementary methods. While the optimal policy is not unique, we identify a rigid discrete structure which is common to all solutions. We also compare the (nontrivial) optimal solutions we find with some simple boarding policies, one of which is shown to be near-optimal.