Quantitative estimates on Jacobians for hybrid inverse problems

We consider $\sigma$-harmonic mappings, that is mappings $U$ whose components $u_i$ solve a divergence structure elliptic equation ${\rm div} (\sigma \nabla u_i)=0$, for $i=1,\ldots,n$. We investigate whether, with suitably prescribed Dirichlet data, the Jacobian determinant can be bounded away from zero. Results of this sort are required in the treatment of the so-called hybrid inverse problems, and also in the field of homogenization studying bounds for the effective properties of composite materials.Comment: 15 pages, submitte

Multi-patch discontinuous Galerkin isogeometric analysis for wave propagation: explicit time-stepping and efficient mass matrix inversion

We present a class of spline finite element methods for time-domain wave propagation which are particularly amenable to explicit time-stepping. The proposed methods utilize a discontinuous Galerkin discretization to enforce continuity of the solution field across geometric patches in a multi-patch setting, which yields a mass matrix with convenient block diagonal structure. Over each patch, we show how to accurately and efficiently invert mass matrices in the presence of curved geometries by using a weight-adjusted approximation of the mass matrix inverse. This approximation restores a tensor product structure while retaining provable high order accuracy and semi-discrete energy stability. We also estimate the maximum stable timestep for spline-based finite elements and show that the use of spline spaces result in less stringent CFL restrictions than equivalent piecewise continuous or discontinuous finite element spaces. Finally, we explore the use of optimal knot vectors based on L2 n-widths. We show how the use of optimal knot vectors can improve both approximation properties and the maximum stable timestep, and present a simple heuristic method for approximating optimal knot positions. Numerical experiments confirm the accuracy and stability of the proposed methods

High-order DG solvers for under-resolved turbulent incompressible flows: A comparison of L2L^2 and HH(div) methods

The accurate numerical simulation of turbulent incompressible flows is a challenging topic in computational fluid dynamics. For discretisation methods to be robust in the under-resolved regime, mass conservation as well as energy stability are key ingredients to obtain robust and accurate discretisations. Recently, two approaches have been proposed in the context of high-order discontinuous Galerkin (DG) discretisations that address these aspects differently. On the one hand, standard $L^2$-based DG discretisations enforce mass conservation and energy stability weakly by the use of additional stabilisation terms. On the other hand, pointwise divergence-free $H(\operatorname{div})$-conforming approaches ensure exact mass conservation and energy stability by the use of tailored finite element function spaces. The present work raises the question whether and to which extent these two approaches are equivalent when applied to under-resolved turbulent flows. This comparative study highlights similarities and differences of these two approaches. The numerical results emphasise that both discretisation strategies are promising for under-resolved simulations of turbulent flows due to their inherent dissipation mechanisms.Comment: 24 pages, 13 figure

Two-parameter nonsmooth grazing bifurcations of limit cycles: classification and open problems

This paper proposes a strategy for the classification of codimension-two grazing bifurcations of limit cycles in piecewise smooth systems of ordinary differential equations. Such nonsmooth transitions (C-bifurcations) occur when the cycle interacts with a discontinuity boundary of phase space in a non-generic way. Several such codimension-one events have recently been identified, causing for example period-adding or sudden onset of chaos. Here, the focus is on codimension-two grazings that are local in the sense that the dynamics can be fully described by an appropriate Poincaré map from a neighbourhood of the grazing point (or points) of the critical cycle to itself. It is proposed that codimension-two grazing bifurcations can be divided into three distinct types: either the grazing point is degenerate, or the the grazing cycle is itself degenerate (e.g. non-hyperbolic) or we have the simultaneous occurrence of two grazing events. A careful distinction is drawn between their occurrence in systems with discontinuous states, discontinuous vector fields, or that have discontinuity in some derivative of the vector field. Examples of each kind of bifurcation are presented, mostly derived from mechanical applications. For each example, where possible, principal bifurcation curves characteristic to the codimension-two scenario are presented and general features of the dynamics discussed. Many avenues for future research are opened.

Computability of Julia sets

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.Comment: Revised. To appear in Moscow Math. Journa