L4

We analyze a fully discrete numerical scheme for solving a parabolic PDE on a moving surface. The method is based on a diffuse interface approach that involves a level set description of the moving surface. Under suitable conditions on the spatial grid size, the time step and the interface width we obtain stability and error bounds with respect to natural norms. Test calculations are presented that confirm our analysis.

Maintenance activities help prevent costly power generator breakdowns but because generators under maintenance are typically unavailable, the impact of maintenance schedules is significant and their cost must be accounted for when planning maintenance. In this paper we address the generator maintenance scheduling problem in hydropower systems. While this problem has been widely studied, specific operating conditions of hydroelectric systems have received less attention. We present a mixed-integer linear programming model that considers the time windows of the maintenance activities, as well as the nonlinearities and disjunctions of the hydroelectric production functions. Because the resulting model is hard to solve, we also propose an extended formulation, a set reduction approach that uses logical conditions for excluding unnecessary set elements from the model, and valid inequalities. Computational experiments using a variety of instances adapted from a real hydropower system in Canada support the conclusion that the extended formulation with set reduction achieves the best results in terms of computational time and optimality gap. This is joint work with Jesus Rodriguez, Pascal Cote and Guy Desaulniers.

In this talk, I will present a novel solution strategy to efficiently and accurately compute approximate solutions to semilinear optimal control problems, focusing on the optimal control of phase field formulations of geometric evolution laws.
The optimal control of geometric evolution laws arises in a number of applications in fields including material science, image processing, tumour growth and cell motility.
Despite this, many open problems remain in the analysis and approximation of such problems.
In the current work we focus on a phase field formulation of the optimal control problem, hence exploiting the well developed mathematical theory for the optimal control of semilinear parabolic partial differential equations.
Approximation of the resulting optimal control problem is computationally challenging, requiring massive amounts of computational time and memory storage.
The main focus of this work is to propose, derive, implement and test an efficient solution method for such problems. The solver for the discretised partial differential equations is based upon a geometric multigrid method incorporating advanced techniques to deal with the nonlinearities in the problem and utilising adaptive mesh refinement.
An in-house two-grid solution strategy for the forward and adjoint problems, that significantly reduces memory requirements and CPU time, is proposed and investigated computationally.
Furthermore, parallelisation as well as an adaptive-step gradient update for the control are employed to further improve efficiency.
Along with a detailed description of our proposed solution method together with its implementation we present a number of computational results that demonstrate and evaluate our algorithms with respect to accuracy and efficiency.
A highlight of the present work is simulation results on the optimal control of phase field formulations of geometric evolution laws in 3-D which would be computationally infeasible without the solution strategies proposed in the present work.

The mathematical analysis and numerical simulation of acoustic and electromagnetic wave scattering by planar screens is a classical topic. The standard technique involves reformulating the problem as a boundary integral equation on the screen, which can be solved numerically using a boundary element method. Theory and computation are both well-developed for the case where the screen is an open subset of the plane with smooth (e.g. Lipschitz or smoother) boundary. In this talk I will explore the case where the screen is an arbitrary subset of the plane; in particular, the screen could have fractal boundary, or itself be a fractal. Such problems are of interest in the study of fractal antennas in electrical engineering, light scattering by snowflakes/ice crystals in atmospheric physics, and in certain diffraction problems in laser optics. The roughness of the screen presents challenging questions concerning how boundary conditions should be enforced, and the appropriate function space setting. But progress is possible and there is interesting behaviour to be discovered: for example, a sound-soft screen with zero area (planar measure zero) can scatter waves provided the fractal dimension of the set is large enough. Accurate computations are also challenging because of the need to adapt the mesh to the fine structure of the fractal. As well as presenting numerical results, I will outline some of the outstanding open questions from the point of view of numerical analysis. This is joint work with Simon Chandler-Wilde (Reading) and Andrea Moiola (Pavia).
 

Integer programming, the problem of finding an optimal integer solution satisfying linear constraints, is one of the most fundamental problems in discrete optimization. In the first part of this talk, I will discuss the important open problem of whether there exists a single exponential time algorithm for solving a general n variable integer program, where the best current algorithm requires n^{O(n)} time. I will use this to motivate a beautiful conjecture of Kannan & Lovasz (KL) regarding how "flat" convex bodies not containing integer points must be.

The l_2 case of KL was recently resolved in breakthrough work by Regev & Davidowitz `17, who proved a more general "Reverse Minkowski" theorem which gives an effective way of bounding lattice point counts inside any ball around the origin as a function of sublattice determinants. In both cases, they prove the existence of certain "witness" lattice subspaces in a non-constructive way that explains geometric parameters of the lattice. In this work, as my first result, I show how to make these results constructive in 2^{O(n)} time, i.e. which can actually find these witness subspaces, using discrete Gaussian sampling techniques. As a second main result, I show an improved complexity characterization for approximating the covering radius of a lattice, i.e. the farthest distance of any point in space to the lattice. In particular, assuming the slicing conjecture, I show that this problem is in coNP for constant approximation factor, which improves on the corresponding O(log^{3/2} n) approximation factor given by Regev & Davidowitz's proof of the l_2 KL conjecture.

In this joint work with Amandine Aftalion we study the minimisers of an energy functional in two-dimensions describing a rotating two-component condensate. This involves in particular separating a line-energy term and a vortex term which have different orders of magnitude, and requires new estimates for functionals of the Cahn-Hilliard (or Modica-Mortola) type.

For liquid films with a thickness in the order of 10¹−10³ molecule layers, classical models of continuum mechanics do not always give a precise description of thin-film evolution: While morphologies of film dewetting are captured by thin-film models, discrepancies arise with respect to time-scales of dewetting.

In this talk, we study stochastic thin-film equations. By multiplicative noise inside an additional convective term, these stochastic partial differential equations differ from their deterministic counterparts, which are fourth-order degenerate parabolic. First, we present some numerical simulations which indicate that the aforementioned discrepancies may be overcome under the influence of noise.

In the main part of the talk, we prove existence of almost surely nonnegative martingale solutions. Combining spatial semi-discretization with appropriate stopping time arguments, arbitrary moments of coupled energy/entropy functionals can be controlled.

Having established Hölder regularity of approximate solutions, the convergence proof is then based on compactness arguments - in particular on Jakubowski’s generalization of Skorokhod’s theorem - weak convergence methods, and recent tools for martingale convergence.

The results have been obtained in collaboration with K. Mecke and M. Rauscher and with J. Fischer, respectively

It is well-known that only a limited number of the fluid flow problems can be solved (or approximated) by the solutions in the explicit form. To derive such solutions, we usually need to start with (over)simplified mathematical models and consider ideal geometries on the flow domains with no distortions introduced. However, in practice, the boundary of the fluid domain can contain various small irregularities (rugosities, dents, etc.) being far from the ideal one. Such problems are challenging from the mathematical point of view and, in most cases, can be treated only numerically. The analytical treatments are rare because introducing the small parameter as the perturbation quantity in the domain boundary forces us to perform tedious change of variables. Having this in mind, our goal is to present recent analytical results on the effects of a slightly perturbed boundary on the fluid flow through a channel filled with a porous medium. We start from a rectangular domain and then perturb the upper part of its boundary by the product of the small parameter $\varepsilon$ and arbitrary smooth function. The porous medium flow is described by the Darcy-Brinkman model which can handle the presence of a boundary on which the no-slip condition for the velocity is imposed. Using asymptotic analysis with respect to $\varepsilon$, we formally derive the effective model in the form of the explicit formulae for the velocity and pressure. The obtained asymptotic approximation clearly shows the nonlocal effects of the small boundary perturbation. The error analysis is also conducted providing the order of accuracy of the asymptotic solution. We will also address the problem of the solute transport through a semi-infinite channel filled with a fluid saturated sparsely packed porous medium. A small perturbation of magnitude $\varepsilon$ is applied on the channel's walls on which the solute particles undergo a first-order chemical reaction. The effective model for solute concentration in the small-Péclet-number-regime is derived using asymptotic analysis with respect to $\varepsilon$. The obtained mathematical model clearly indicates the influence of the porous medium, chemical reaction and boundary distortion on the effective flow.

This is a joint work with Eduard Marušić-Paloka (University of Zagreb).

Identity-based cryptography can be useful in situations where a full-scale public-key infrastructure is impractical.  Original identity-based proposals relied on elliptic curve pairings and so are vulnerable to quantum computers.  I will describe some on-going work to design a post-quantum identity-based encryption scheme using ideas from Ring Learning with Errors. Our scheme has the advantage that it can be extended to the hierarchical setting for more flexible key management.

Several optimization problems combine nonlinear constraints with the integrality of a subset of variables. For an important class of problems  called Mixed Integer Second-Order Cone Optimization (MISOCO), with applications in facility location, robust optimization, and finance, among others, these nonlinear constraints are second-order (or Lorentz) cones.

For such problems, as for many discrete optimization problems, it is crucial to understand the properties of the union of two disjoint sets of feasible solutions. To this end, we apply the disjunctive programming paradigm to MISOCO and present conditions under which the convex hull of two disjoint sets can be obtained by intersecting the feasible set with a specially constructed second-order cone. Computational results show that such cone has a positive impact on the solution of MISOCO problems.