TBA

TBA 

Normal heart function relies of the fine-tuned synchronization of cellular components. In healthy hearts, calcium oscillations and physical contractions are coupled across a synchronised network of 3 billion heart cells. When the process of functional isolation of rogue cells isn’t successful, the network becomes maladapted, resulting in cardiovascular diseases, including heart failure and arrythmia. To advance knowledge on this normal-to-disease transition we must first address the lack of a mechanistic understanding of the plastic readaptation of these networks. In this talk I will explore coupling and loss of synchronisation using a mathematical model of calcium oscillations informed by experimental data. I will show some preliminary results pointing at the heterogeneity hidden behind seemingly uniform cell populations, as a causative mechanism behind disrupted dynamics in maladapted networks.

TBA

University of Cambridge

TBA

TBA

TBA

to follow

Speaker Katharina Schratz will talk about 'Resonances as a computational tool'

A large toolbox of numerical schemes for dispersive equations has been established, based on different discretization techniques such as discretizing the variation-of-constants formula (e.g., exponential integrators) or splitting the full equation into a series of simpler subproblems (e.g., splitting methods). In many situations these classical schemes allow a precise and efficient approximation. This, however, drastically changes whenever non-smooth phenomena enter the scene such as for problems at low regularity and high oscillations. Classical schemes fail to capture the oscillatory nature of the solution, and this may lead to severe instabilities and loss of convergence. In this talk I present a new class of resonance based schemes. The key idea in the construction of the new schemes is to tackle and deeply embed the underlying nonlinear  structure of resonances into the numerical discretization. As in the continuous case, these terms are central to structure preservation and offer the new schemes strong geometric properties at low regularity.

Gaussian fields arise in a variety of contexts in both pure and applied mathematics. While their geometric properties are well understood, their topological features pose deeper mathematical challenges. In this talk, I will begin by highlighting some motivating examples from different domains. I will then outline the classical theory that describes the geometric behaviour of Gaussian fields, before turning to more recent developments aimed at understanding their topology using the Wiener chaos expansion.

TBA

to follow

to follow

to follow

TBA

Everything you have been taught about Turing patterns is wrong! (Well, not everything, but qualifying statements tend to weaken a punchy first sentence). Turing patterns are universally used to generate and understand patterns across a wide range of biological phenomena. They are wonderful to work with from a theoretical, simulation and application point of view. However, they have a paradoxical problem of being too easy to produce generally, whilst simultaneously being heavily dependent on the details. In this talk I demonstrate how to fix known problems such as small parameter regions and sensitivity, but then highlight a new set of issues that arise from usually overlooked issues, such as boundary conditions, initial conditions, and domain shape. Although we’ve been exploring Turing’s theory for longer than I’ve been alive, there’s still life in the old (spotty) dog yet.

TBA

TBA

Speaker Prof Dr Maria Lukacova will talk about 'Numerical analysis of oscillatory solutions of compressible flows'

Oscillatory solutions of compressible flows arise in many practical situations.  An iconic example is the Kelvin-Helmholtz problem, where standard numerical methods yield oscillatory solutions. In such a situation,  standard tools of numerical analysis for partial differential equations are not applicable. 

We will show that structure-preserving numerical methods converge in general to generalised solutions, the so-called dissipative solutions. 
The latter describes the limits of oscillatory sequences. We will concentrate on the inviscid flows, the Euler equations of gas dynamics, and mention also the relevant results obtained for the viscous compressible flows, governed by the Navier-Stokes equations.

We discuss a concept of K-convergence that turns a weak convergence of numerical solutions into the strong convergence of
their empirical means to a dissipative solution. The latter satisfies a weak formulation of the Euler equations modulo the Reynolds turbulent stress.  We will also discuss suitable selection criteria to recover well-posedness of the Euler equations of gas dynamics. Theoretical results will be illustrated by a series of numerical simulations.  

TBA

Speaker Professor Luis Nunes Vicente will talk about 'Reducing Sample Complexity in Stochastic Derivative-Free Optimization via Tail Bounds and Hypothesis Testing';

We introduce and analyze new probabilistic strategies for enforcing sufficient decrease conditions in stochastic derivative-free optimization, with the goal of reducing sample complexity and simplifying convergence analysis. First, we develop a new tail bound condition imposed on the estimated reduction in function value, which permits flexible selection of the power used in the sufficient decrease test, q in (1,2]. This approach allows us to reduce the number of samples per iteration from the standard O(delta^{−4}) to O(delta^{-2q}), assuming that the noise moment of order q/(q-1) is bounded. Second, we formulate the sufficient decrease condition as a sequential hypothesis testing problem, in which the algorithm adaptively collects samples until the evidence suffices to accept or reject a candidate step. This test provides statistical guarantees on decision errors and can further reduce the required sample size, particularly in the Gaussian noise setting, where it can approach O(delta^{−2-r}) when the decrease is of the order of delta^r. We incorporate both techniques into stochastic direct-search and trust-region methods for potentially non-smooth, noisy objective functions, and establish their global convergence rates and properties. 

This is joint work with Anjie Ding, Francesco Rinaldi, and Damiano Zeffiro.

TBA