Search Results
The enhanced Sanov theorem and propagation of chaos
We establish a Sanov type large deviation principle for an ensemble of interacting Brownian rough paths. As application a large deviations for the (-layer, enhanced) empirical measure of weakly interacting diffusions is obtained. This in turn implies a propagation of chaos result in a space of rough paths and allows for a robust analysis of the particle system and its McKean–Vlasov type limit, as shown in two corollaries.
Example dataset for the hMRI toolbox
The hMRI toolbox is an open-source toolbox for the calculation of quantitative MRI parameter maps from a series of weighted imaging data, and optionally additional calibration data. The multi-parameter mapping (MPM) protocol, incorporating calibration data to correct for spatial variation in the scanner's transmit and receive fields, is the most complete protocol that can be handled by the toolbox. Here we present a dataset acquired with such a full MPM protocol, which is made freely available to be used as a tutorial by following instructions provided on the associated toolbox wiki pages, which can be found at http://hMRI.info, and following the theory described in: hMRI – A toolbox for quantitative MRI in neuroscience and clinical research [1].
Tetrahedral Mesh Improvement Using Moving Mesh Smoothing and Lazy Searching Flips
We combine the new moving mesh smoothing, based on the integration of an ordinary differential equation coming from a given functional, with the new lazy flip technique, a reversible edge removal algorithm for local mesh quality improvement. These strategies already provide good mesh improvement on themselves, but their combination achieves astonishing results not reported so far. Provided numerical comparison with some publicly available mesh improving software show that we can obtain final tetrahedral meshes with dihedral angles between 40° and 123°.
On Tetrahedralisations of Reduced Chazelle Polyhedra with Interior Steiner Points
The non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], establishes a quadratic lower bound on the minimum number of convex pieces for the 3d polyhedron partitioning problem. In this paper, we study the problem of tetrahedralising the Chazelle polyhedron without modifying its exterior boundary. It is motivated by a crucial step in tetrahedral mesh generation in which a set of arbitrary constraints (edges or faces) need to be entirely preserved. The goal of this study is to gain more knowledge about the family of 3d indecomposable polyhedra which needs additional points, so-called Steiner points, to be tetrahedralised. The requirement of only using interior Steiner points for the Chazelle polyhedron is extremely challenging. We first “cut off” the volume of the Chazelle polyhedron by removing the regions that are tetrahedralisable. This leads to a 3d non-convex polyhedron whose vertices are all in the two slightly shifted saddle surfaces which are used to construct the Chazelle polyhedron. We call it the reduced Chazelle polyhedron. It is an indecomposable polyhedron. We then give a set of (N + 1)2 interior Steiner points that ensures the existence of a tetrahedralisation of the reduced Chazelle polyhedron with 4(N + 1) vertices. The proof is done by transforming a 3d tetrahedralisation problem into a 2d edge flip problem. In particular, we design an edge splitting and flipping algorithm and prove that it gives to a tetrahedralisation of the reduced Chazelle polyhedron.
A rough path perspective on renormalization
We develop the algebraic theory of rough path translation. Particular attention is given to the case of branched rough paths, whose underlying algebraic structure (Connes-Kreimer, Grossman-Larson) makes it a useful model case of a regularity structure in the sense of Hairer. Pre-Lie structures are seen to play a fundamental rule which allow a direct understanding of the translated (i.e. renormalized) equation under consideration. This construction is also novel with regard to the algebraic renormalization theory for regularity structures due to Bruned–Hairer–Zambotti (2016), the links with which are discussed in detail. © 2019 The Author(s)
Scattering matrices and Dirichlet-to-Neumann maps
A general representation formula for the scattering matrix of a scattering system consisting of two self-adjoint operators in terms of an abstract operator valued Titchmarsh–Weyl m-function is proved. This result is applied to scattering problems for different self-adjoint realizations of Schrödinger operators on unbounded domains, Schrödinger operators with singular potentials supported on hypersurfaces, and orthogonal couplings of Schrödinger operators. In these applications the scattering matrix is expressed in an explicit form with the help of Dirichlet-to-Neumann maps.
On Indecomposable Polyhedra and the Number of Steiner Points
The existence of indecomposable polyhedra, that is, the interior of every such polyhedron cannot be decomposed into a set of tetrahedra whose vertices are all of the given polyhedron, is well-known. However, the geometry and combinatorial structure of such polyhedra are much less studied. In this article, we investigate the structure of some well-known examples, the so-called Schönhardt polyhedron [10] and the Bagemihl's generalization of it [1], which will be called Bagemihl's polyhedra. We provide a construction of an additional point, so-called Steiner point, which can be used to decompose the Schönhardt and the Bagemihl's polyhedra. We then provide a construction of a larger class of three-dimensional indecomposable polyhedra which often appear in grid generation problems. We show that such polyhedra have the same combinatorial structure as the Schönhardt's and Bagemihl's polyhedra, but they may need more than one Steiner point to be decomposed. Given such a polyhedron with n ≥ 6 vertices, we show that it can be decomposed by adding at most interior Steiner points. We also show that this number is optimal in theworst case.
Precise Laplace asymptotics for singular stochastic PDEs: The case of 2D gPAM
We implement a Laplace method for the renormalised solution to the generalised 2D Parabolic Anderson Model (gPAM) driven by a small spatial white noise. Our work rests upon Hairer's theory of regularity structures which allows to generalise classical ideas of Azencott and Ben Arous on path space as well as Aida and Inahama and Kawabi on rough path space to the space of models. The technical cornerstone of our argument is a Taylor expansion of the solution in the noise intensity parameter: We prove precise bounds for its terms and the remainder and use them to estimate asymptotically irrevelant terms to arbitrary order. While most of our arguments are not specific to gPAM, we also outline how to adapt those that are.
Anisotropic Finite Element Mesh Adaptation via Higher Dimensional Embedding
In this paper we provide a novel anisotropic mesh adaptation technique for adaptive finite element analysis. It is based on the concept of higher dimensional embedding, which was exploited in [1], [2], [3], [4] to obtain an anisotropic curvature adapted mesh that fits a complex surface in R3. In the context of adaptive finite element simulation, the solution (which is an unknown function f : Ω ⊂ d → ) is sought by iteratively modifying a finite element mesh according to a mesh sizing field described via a (discrete) metric tensor field that is typically obtained through an error estimator. We proposed to use a higher dimensional embedding, Φf (x):= (x1, …, xd, s f (x1, …, xd), s ▿ f (x1, …, xd))t, instead of the mesh sizing field for the mesh adaption. This embedding contains both informations of the function f itself and its gradient. An isotropic mesh in this embedded space will correspond to an anisotropic mesh in the actual space, where the mesh elements are stretched and aligned according to the features of the function f. To better capture the anisotropy and gradation of the mesh, it is necessary to balance the contribution of the components in this embedding. We have properly adjusted Φf (x) for adaptive finite element analysis. To better understand and validate the proposed mesh adaptation strategy, we first provide a series of experimental tests for piecewise linear interpolation of known functions. We then applied this approach in an adaptive finite element solution of partial differential equations. Both tests are performed on two-dimensional domains in which adaptive triangular meshes are generated. We compared these results with the ones obtained by the software BAMG – a metric-based adaptive mesh generator. The errors measured in the L2 norm are comparable. Moreover, our meshes captured the anisotropy more accurately than the meshes of BAMG.
Toward mixed-element meshing based on restricted Voronoi diagrams
In this paper we propose a method to generate mixed-element meshes (tetrahedra, triangular prisms, square pyramids) for B-Rep models. The vertices, edges, facets, and cells of the final volumetric mesh are determined from the combinatorial analysis of the intersections between the model components and the Voronoi diagram of sites distributed to sample the model. Inside the volumetric regions, Delaunay tetrahedra dual of the Voronoi diagram are built. Where the intersections of the Voronoi cells with the model surfaces have a unique connected component, tetrahedra are modified to fit the input triangulated surfaces. Where these intersections are more complicated, a correspondence between the elements of the Voronoi diagram and the elements of the mixedelement mesh is used to build the final volumetric mesh. The method which was motivated by meshing challenges encountered in geological modeling is demonstrated on several 3D synthetic models of subsurface rock volumes.