University of Oxford

Partial differential equations defined on surfaces appear in various applications, for example image processing and reconstruction of non-planar images. In this talk, I will present a penalty method for evolution equations, based on an implicit representation of the surface. I will derive a simple equation in the surrounding space, formulated with an extension operator, and then show some analysis and applications of the method.

Several problems lead to the question of how well can a fine grid function be approximated by a coarse grid function, such as preconditioning in finite element methods or data compression and image processing. Particular challenges in answering this question arise when the functions may be only piecewise-continuous, or when the coarse space is not nested in the fine space. In this talk, we solve the problem by using a stable approximation from a space of globally smooth functions as an intermediate step, thereby allowing the use of known approximation results to establish the approximability by a coarse space. We outline the proof, which relies on techniques from the theory of discontinuous Galerkin methods and on the theory of Helmholtz decompositions. Finally, we present an application of our to nonoverlapping domain decomposition preconditioners for hp-version DGFEM.

Cox processes arise as a natural extension of inhomogeneous Poisson Processes, when the intensity function itself is taken to be stochastic. In multiple applications one is often concerned with characterizing the posterior distribution over the intensity process (given some observed data). Markov Chain Monte Carlo methods have historically been successful at such tasks. However, direct methods are doubly intractable, especially when the intensity process takes values in a space of continuous functions.

In this talk I'll be presenting a method to overcome this intractability that is based on the idea of "thinning" and that does not resort to approximations.

We state a conjecture about the size of the intersection between a bounded-rank progression and a sphere, and we prove the first interesting case, a result of Chang. Hopefully the full conjecture will be obvious to somebody present.

The Balog-Szemeredi-Gowers theorem states that, given any finite subset of an abelian group with large additive energy, we can find its large subset with small doubling constant. We can ask how this constant depends on the initial additive energy. In the talk, I will give an upper bound, mention the best existing lower bound and, if time permits, present an approach that gives a hope to improve the lower bound and make it asymptotically equal to the upper bound from the beginning of the talk.

Let $F \in \mathbb{Z}[x_1,\ldots,x_n]$. Suppose $F(\mathbf{x})=0$ has infinitely many integer solutions $\mathbf{x} \in \mathbb{Z}^n$. Roughly how common should be expect the solutions to be? I will tell you what your naive first guess ought to be, give a one-line reason why, and discuss the reasons why this first guess might be wrong.

I then will apply these ideas to explain the intriguing parallels between the handling of the Brauer-Manin obstruction by Heath-Brown/Skorobogotov [doi:10.1007/BF02392841] on the one hand and Wei/Xu [arXiv:1211.2286] on the other, despite the very different methods involved in each case.

Given a model dynamical system, a model of any measuring apparatus relating states to observations, and a prior assessment of uncertainty, the probability density of subsequent system states, conditioned upon the history of the observations, is of some practical interest.

When observations are made at discrete times, it is known that the evolving probability density is a solution of the Bayesian filtering equations. This talk will describe the difficulties in approximating the evolving probability density using a Gaussian mixture (i.e. a sum of Gaussian densities). In general this leads to a sequence of optimisation problems and related high-dimensional integrals. There are other problems too, related to the necessity of using a small number of densities in the mixture, the requirement to maintain sparsity of any matrices and the need to compute first and, somewhat disturbingly, second derivatives of the misfit between predictions and observations. Adjoint methods, Taylor expansions, Gaussian random fields and Newton’s method can be combined to, possibly, provide a solution. The approach is essentially a combination of filtering methods and '4-D Var’ methods and some recent progress will be described.

Everybody has heard of the Faraday cage effect, in which a wire mesh does a good job of blocking electric fields and electromagnetic waves. For example, the screen on the front of your microwave oven keeps the microwaves from getting out, while light with its smaller wavelength escapes so you can see your burrito.  Surely the mathematics of such a famous and useful phenomenon has been long ago worked out and written up in the physics books, right?

Well, maybe.   Dave Hewett and I have communicated with dozens of mathematicians, physicists, and engineers on this subject so far, and we've turned up amazingly little.   Everybody has a view of why the Faraday cage mathematics is obvious, and most of their views are different.  Feynman discusses the matter in his Lectures on Physics, but so far as we can tell, he gets it wrong. 

For the static case at least (the Laplace equation), Hewett and I have made good progress with numerical explorations based on  Mikhlin's method backed up by a theorem.   The effect seems to much weaker than we had imagined -- are we missing something?  For time-harmonic waves (the Helmholtz equation), our simulations lead to further puzzles.  We need advice!  Where in the world is the literature on this problem?