University of Oxford

TBA

We will present three different recent applications of cell motion in biology: (i) Movement of epithelial sheets and rosette formation, (ii) neural crest cell migrations, (iii) acid-mediated cancer cell invasion. While the talk will focus primarily on the biological application, it will be shown that all of these processes can be represented by reaction-diffusion equations with nonlinear diffusion term.

A new benchmark, High Performance Conjugate Gradient (HPCG), finally was introduced recently for the Top500 list and the Green500 list. This will draw more attention to performance of sparse iterative solvers on distributed supercomputers and energy efficiency of hardware and software. At the same time, this will more widely promote the concept that communications are the bottleneck of performance of iterative solvers on distributed supercomputers, here we will go a little deeper, discussing components of communications and discuss which part takes a dominate share. Also discussed are mathematics tricks to detect some metrics of an underlying supercomputer.

We discuss the development of finite element techniques and solvers for magma dynamics computations. These are implemented within the FEniCS framework. This approach allows for user-friendly, expressive, high-level code development, but also provides access to powerful, scalable numerical solvers and a large family of finite element discretizations. The ability to easily scale codes to three dimensions with large meshes means that efficiency of the numerical algorithms is vital. We therefore describe our development and analysis of preconditioners designed specifically for finite element discretizations of equations governing magma dynamics. The preconditioners are based on Elman-Silvester-Wathen methods for the Stokes equation, and we extend these to flows with compaction.  This work is joint with Andrew Wathen and Richard Katz from the University of Oxford and Laura Alisic, John Rudge and Garth Wells from the University of Cambridge.

The antitriangular factorisation of real symmetric indefinite matrices recently proposed by Mastronardi and van Dooren has several pleasing properties. It is backward stable, preserves eigenvalues and reveals the inertia, that is, the number of positive, zero and negative eigenvalues. 

In this talk we show that the antitriangular factorization simplifies for saddle point matrices, and that solving a saddle point system in antitriangular form is equivalent to applying the well-known nullspace method. We obtain eigenvalue bounds for the saddle point matrix and discuss the role of the factorisation in preconditioning. 

From cryptography to the proof of Fermat's Last Theorem, elliptic curves (those curves of the form y^2 = x^3 + ax+b) are ubiquitous in modern number theory.  In particular, much activity is focused on developing techniques to discover rational points on these curves. It turns out that finding a rational point on an elliptic curve is very much like finding the proverbial needle in the haystack -- in fact, there is currently no algorithm known to completely determine the group of rational points on an arbitrary elliptic curve.

 I'll introduce the ''real'' picture of elliptic curves and discuss why the ambient real points of these curves seem to tell us little about finding rational points. I'll summarize some of the story of elliptic curves over finite and p-adic fields and tell you about how I study integral points on (hyper)elliptic curves via p-adic integration, which relies on doing a bit of p-adic linear algebra.  Time permitting, I'll also give a short demo of some code we have to carry out these algorithms in the Sage Math Cloud.