I will present a survey of the main results about first and second order models of swarming where repulsion and attraction are modeled through pairwise potentials. We will mainly focus on the stability of the fascinating patterns that you get by random data particle simulations, flocks and mills, and their qualitative behavior.
 

This talk covers two topics: (1) Phenotype change, where we consider the steady-fitness states, in a model developed by Korobeinikov and Dempsey (2014), in which the phenotype is modelled on a continuous scale providing a structured variable to quantify the phenotype state. This enables thresholds for survival/extinction to be established in terms of fitness.

Topic (2) looks at the steady-size distribution of an evolving cohort of cells, such as tumour cells in vitro, and therein establishes thresholds for growth or decay of the cohort. This is established using a new class of non-local (but linear) singular eigenvalue problems which have point spectra, like the traditional Sturm-Liouville problems.  The first eigenvalue gives the threshold required. But these problems are first order unless dispersion is added to incorporate random perturbations. But the same idea will apply here also.  Current work involves binary asymmetrical division of cells, simultaneous with growth. It has implications to cancer biology, helping biologists to conceptualise non-local effects and the part they may play in cancer. This is developed in Zaidi et al (2015).

Acknowledgement. The support of Gravida (NCGD) is gratefully acknowledged.

References

Korobeinikov A & Dempsey C. A continuous phenotype space model of RNA virus evolution within a host. Mathematical Biosciences and Engineering 11, (2014), 919-927.

Zaidi AA, van-Brunt B, & Wake GC. A model for asymmetrical cell division Mathematical Biosciences and Engineering (June 2015).

It is well known that low-Reynolds-number flows ($R_e\ll1$) have unique solutions, but this statement may not be true if complex solutions are permitted.

We begin by considering Stokes series, where a general steady velocity field is expanded as a power series in the Reynolds number. At each order, a linear problem determines the coefficient functions, providing an exact closed form representation of the solution for all Reynolds numbers. However, typically the convergence of this series is limited by singularities in the complex $R_e$ plane. 

We employ a generalised Pade approximant technique to continue analytically the solution outside the circle of convergence of the series. This identifies other solutions branches, some of them complex. These new solution branches can be followed as they boldly go where no flow has gone before. Sometimes these complex solution branches coalesce giving rise to real solution branches. It is shown that often, an unforced, nonlinear complex "eigensolution" exists, which implies a formal nonuniqueness, even for small and positive $R_e$.

Extensive reference will be made to Dean flow in a slowly curved pipe, but also to flows between concentric, differentially rotating spheres, and to convection in a slot. In addition, certain fundamental exact solutions are shown to possess extra complex solutions.

by Jonathan Mestel and Florencia Boshier

Despite many years of intensive research, the modeling of contact lines moving by spreading and/or evaporation still remains a subject of debate nowadays, even for the simplest case of a pure liquid on a smooth and homogeneous horizontal substrate. In addition to the inherent complexity of the topic (singularities, micro-macro matching, intricate coupling of many physical effects, …), this also stems from the relatively limited number of studies directly comparing theoretical and experimental results, with as few fitting parameters as possible. In this presentation, I will address various related questions, focusing on the physics invoked to regularize singularities at the microscale, and discussing the impact this has at the macroscale. Two opposite “minimalist” theories will be detailed: i) a classical paradigm, based on the disjoining pressure in combination with the spreading coefficient; ii) a new approach, invoking evaporation/condensation in combination with the Kelvin effect (dependence of saturation conditions upon interfacial curvature). Most notably, the latter effect enables resolving both viscous and thermal singularities altogether, without needing any other regularizing effects such as disjoining pressure, precursor films or slip length. Experimental results are also presented about evaporation-induced contact angles, to partly validate the first approach, although it is argued that reality might often lie in between these two extreme cases.

Full details are available at: http://www.stcatz.ox.ac.uk/alantayler

Rational Krylov subspaces have been proven to be useful for many applications, like the approximation of matrix functions or the solution of matrix equations. It will be shown that extended and rational Krylov subspaces —under some assumptions— can be retrieved without any explicit inversion or system solves involved. Instead we do the necessary computations of $A^{-1} v$ in an implicit way using the information from an enlarged standard Krylov subspace.

It is well-known that both for classical and extended Krylov spaces, direct unitary similarity transformations exist providing us the matrix of recurrences. In practice, however, for large dimensions computing time is saved by making use of iterative procedures to gradually gather the recurrences in a matrix. Unfortunately, for extended Krylov spaces one is required to frequently solve, in some way or another a system of equations. In this talk both techniques will be integrated. We start with an orthogonal basis of a standard Krylov subspace of dimension $m+m+p$. Then we will apply a unitary similarity built by rotations compressing thereby significantly the initial subspace and resulting in an orthogonal basis approximately spanning an extended or rational Krylov subspace.

Numerical experiments support our claims that this approximation is very good if the large Krylov subspace contains $A^{-(m+1)} v$, …, $A^{-1} v$ and thus can culminate in nonneglectable dimensionality reduction and as such also can lead to time savings when approximating, e.g., matrix functions.

A stable algorithm to compute the roots of polynomials is presented. The roots are found by computing the eigenvalues of the associated companion matrix by Francis's implicitly-shifted $QR$ algorithm.  A companion matrix is an upper Hessenberg matrix that is unitary-plus-rank-one, that is, it is the sum of a unitary matrix and a rank-one matrix.  These properties are preserved by iterations of Francis's algorithm, and it is these properties that are exploited here. The matrix is represented as a product of $3n-1$ Givens rotators plus the rank-one part, so only $O(n)$ storage space is required.  In fact, the information about the rank-one part is also encoded in the rotators, so it is not necessary to store the rank-one part explicitly.  Francis's algorithm implemented on this representation requires only $O(n)$ flops per iteration and thus $O(n^{2})$ flops overall.  The algorithm is described, backward stability is proved under certain conditions on the polynomial coefficients, and an extensive set of numerical experiments is presented.  The algorithm is shown to be about as accurate as the (slow) Francis $QR$ algorithm applied to the companion matrix without exploiting the structure.  It is faster than other fast methods that have been proposed, and its accuracy is comparable or better.

We present advances in several fundamental fields of computer vision: image segmentation, object tracking, stereo reconstruction for depth map estimation and full 3D multi-view reconstruction. The basic method applied to these fields is convex relaxation. Convex relaxation methods allow for global optimization of numerous energy functionals and provide a step towards less user input and more automation. We will show how the respective computer vision problems can be formulated in this convex optimization framework. Efficient parallel implementations of the arising numerical schemes using graphics processing units allow for interactive applications.