Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs

We investigate the discretization of optimal boundary control problems for elliptic equations on two-dimensional polygonal domains by the boundary concentrated finite element method. We prove that the discretization error ||u^*-u_h^*||_L²(G)\|u^{*}-u_{h}^{*}\|_{L^{2}(\Gamma)} decreases like N ⁻¹, where N is the total number of unknowns. This makes the proposed method favorable in comparison to the h-version of the finite element method, where the discretization error behaves like N ^−3/4 for uniform meshes. Moreover, we present an algorithm that solves the discretized problem in almost optimal complexity. The paper is complemented with numerical results.     

The tiling C*-algebra viewed as a tight inverse semigroup algebra

We realize Kellendonk’s C*-algebra of an aperiodic tiling as the tight C*-algebra of the inverse semigroup associated to the tiling, thus providing further evidence that the tight C*-algebra is a good candidate to be the natural associative algebra to go along with an inverse semigroup.     

A-posteriori error estimates for optimal control problems with state and control constraints

We discuss the full discretization of an elliptic optimal control problem with pointwise control and state constraints. We provide the first reliable a-posteriori error estimator that contains only computable quantities for this class of problems. Moreover, we show, that the error estimator converges to zero if one has convergence of the discrete solutions to the solution of the original problem. The theory is illustrated by numerical tests.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

On summability of nonlinear mappings: a new approach

The main goal of this paper is to characterize arbitrary nonlinear (non-multilinear) mappings ${f:X_{1}\times\cdots\times X_{n}\rightarrow Y}$ between Banach spaces that satisfy a quite natural Pietsch Domination-type theorem around a given point ${(a_{1},\ldots,a_{n})\in X_{1}\times\cdots\times X_{n}}$ . As a consequence of our approach a notion of weighted summability arises naturally, which may be an interesting topic for further investigation.     

Level 17 Ramanujan–Sato series

The Ramanujan Journal - Two level 17 modular functions $$\begin{aligned} r = q^2 \prod _{n=1}^{\infty } (1-q^{n})^{\left( \frac{n}{17} \right) },\qquad s = q^{2} \prod _{n=1}^{\infty } \frac{(1 -...     

COMPUTATIONAL MULTISCALE METHODS FOR LINEAR HETEROGENEOUS POROELASTICITY

We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling.This poroelasticity problem suffers from rapidly oscillating material parameters,which calls for a thorough numerical treatment.In this paper,we propose a method based on the local orthogonal decomposition technique and motivated by a similar approach used for linear thermoelasticity.Therein,local corrector problems are constructed in line with the static equations,whereas we propose to consider the full system.This allows to benefit from the given saddle point structure and results in two decoupled corrector problems for the displacement and the pressure.We prove the optimal first-order convergence of this method and verify the result by numerical experiments.     

A Geometric Heat-Flow Theory of Lagrangian Coherent Structures

We consider Lagrangian coherent structures (LCSs) as the boundaries of material subsets whose advective evolution is metastable under weak diffusion. For their detection, we first transform the Eulerian advection–diffusion equation to Lagrangian coordinates, in which it takes the form of a time-dependent diffusion or heat equation. By this coordinate transformation, the reversible effects of advection are separated from the irreversible joint effects of advection and diffusion. In this framework, LCSs express themselves as (boundaries of) metastable sets under the Lagrangian diffusion process. In the case of spatially homogeneous isotropic diffusion, averaging the time-dependent family of Lagrangian diffusion operators yields Froyland’s dynamic Laplacian. In the associated geometric heat equation, the distribution of heat is governed by the dynamically induced intrinsic geometry on the material manifold, to which we refer as the geometry of mixing. We study and visualize this geometry in detail, and discuss connections between geometric features and LCSs viewed as diffusion barriers in two numerical examples. Our approach facilitates the discovery of connections between some prominent methods for coherent structure detection: the dynamic isoperimetry methodology, the variational geometric approaches to elliptic LCSs, a class of graph Laplacian-based methods and the effective diffusivity framework used in physical oceanography.