One of the major steps in the adaptive finite element methods (AFEM) is the adaptive selection of the next partition. The process is usually governed by a strategy based on carefully chosen local error indicators and aims at convergence results with optimal rates. One can formally relate the refinement of the partitions with growing an oriented graph or a tree. Then each node of the tree/graph corresponds to a cell of a partition and the approximation of a function on adaptive partitions can be expressed trough the local errors related to the cell, i.e., the node. The total approximation error is then calculated as the sum of the errors on the leaves (the terminal nodes) of the tree/graph and the problem of finding an optimal error for a given budget of nodes is known as tree approximation. Establishing a near-best tree approximation result is a key ingredient in proving optimal convergence rates for AFEM.

The classical tree approximation problems are usually related to the so-called h-adaptive approximation in which the improvements a due to reducing the size of the cells in the partition. This talk will consider also an extension of this framework to hp-adaptive approximation allowing different polynomial spaces to be used for the local approximations at different cells while maintaining the near-optimality in terms of the combined number of degrees of freedom used in the approximation.

The problem of conformity of the resulting partition will be discussed as well. Typically in AFEM, certain elements of the current partition are marked and subdivided together with some additional ones to maintain desired properties of the partition like conformity. This strategy is often described as “mark → subdivide → complete”. The process is very well understood for triangulations received via newest vertex bisection procedure. In particular, it is proven that the number of elements in the final partition is limited by constant times the number of marked cells. This hints at the possibility to design a marking procedure that is limited only to cells of the partition whose subdivision will result in a conforming partition and therefore no completion step would be necessary. This talk will present such a strategy together with theoretical results about its near-optimal performance.

In this talk, I am going to give an introduction to operator preconditioning as a general and robust strategy to precondition linear systems arising from Galerkin discretization of PDEs or Boundary Integral Equations. Then, in order to illustrate the applicability of this preconditioning technique, I will discuss the simple case of weakly singular and hypersingular integral equations, arising from exterior Dirichlet and Neumann BVPs for the Laplacian in 3D. Finally, I will show how we can also tackle operators with a more difficult structure, like the electric field integral equation (EFIE) on screens, which models the scattering of time-harmonic electromagnetic waves at perfectly conducting bounded infinitely thin objects, like patch antennas in 3D.

We present a novel approach to the solution of time-dependent PDEs via the so-called monolithic or all-at-once formulation.

This approach will be explained for simple parabolic problems and its utility in the context of PDE constrained optimization problems will be elucidated.

The underlying linear algebra includes circulant matrix approximations of Toeplitz-structured matrices and allows for effective parallel implementation. Simple computational results will be shown for the heat equation and the wave equation which indicate the potential as a parallel-in-time method.

This is joint work with Elle McDonald (CSIRO, Australia), Jennifer Pestana (Strathclyde University, UK) and Anthony Goddard (Durham University, UK)

In joint work with Peter Topping we introduce pyramid Ricci flows, defined throughout uniform regions of spacetime that are not simply parabolic cylinders, and enjoying curvature estimates that are not required to remain spatially constant throughout the domain of definition. This weakened notion of Ricci flow may be run in situations ill-suited to the classical theory. As an application of pyramid Ricci flows, we obtain global regularity results for three-dimensional Ricci limit spaces (extending results of Miles Simon and Peter Topping) and for higher dimensional PIC1 limit spaces (extending not only the results of Richard Bamler, Esther Cabezas-Rivas and Burkhard Wilking, but also the subsequent refinements by Yi Lai).
 

Let $p$ be an odd prime and $n$ a natural number. We determine the irreducible constituents of the permutation module induced by the action of the symmetric group $S_n$ on the cosets of a Sylow $p$-subgroup $P_n$. In the course of this work, we also prove a symmetric group analogue of a well-known result of Navarro for $p$-solvable groups on a conjugacy action of $N_G(P)$. Before describing some consequences of these results, we will give an overview of the background and recent related results in the area.