A sharp relative-error bound for the Helmholtz h-FEM at high frequency

For the h-finite-element method (h-FEM) applied to the Helmholtz equation, the question of how quickly the meshwidth h must decrease with the frequency k to maintain accuracy as k increases has been studied since the mid 80’s. Nevertheless, there still do not exist in the literature any k-explicit bounds on the relative error of the FEM solution (the measure of the FEM error most often used in practical applications), apart from in one dimension. The main result of this paper is the sharp result that, for the lowest fixed-order conforming FEM (with polynomial degree, p, equal to one), the condition “$$h^2 k^3$$ h 2 k 3 sufficiently small" is sufficient for the relative error of the FEM solution in 2 or 3 dimensions to be controllably small (independent of k) for scattering of a plane wave by a nontrapping obstacle and/or a nontrapping inhomogeneous medium. We also prove relative-error bounds on the FEM solution for arbitrary fixed-order methods applied to scattering by a nontrapping obstacle, but these bounds are not sharp for $$p\ge 2$$ p ≥ 2 . A key ingredient in our proofs is a result describing the oscillatory behaviour of the solution of the plane-wave scattering problem, which we prove using semiclassical defect measures.

The critical window in random digraphs

We consider the component structure of the random digraph D(n,p) inside the critical window $p = n^{-1} + \lambda n^{-4/3}$ . We show that the largest component $\mathcal{C}_1$ has size of order $n^{1/3}$ in this range. In particular we give explicit bounds on the tail probabilities of $|\mathcal{C}_1|n^{-1/3}$ .

Bounding the log-derivative of the zeta-function

Assuming the Riemann hypothesis we establish explicit bounds for the modulus of the log-derivative of Riemann’s zeta-function in the critical strip.

Multivariate Normal Approximation on the Wiener Space: New Bounds in the Convex Distance

We establish explicit bounds on the convex distance between the distribution of a vector of smooth functionals of a Gaussian field and that of a normal vector with a positive-definite covariance matrix. Our bounds are commensurate to the ones obtained by Nourdin et al. (Ann Inst Henri Poincaré Probab Stat 46(1):45–58, 2010) for the (smoother) 1-Wasserstein distance, and do not involve any additional logarithmic factor. One of the main tools exploited in our work is a recursive estimate on the convex distance recently obtained by Schulte and Yukich (Electron J Probab 24(130):1–42, 2019). We illustrate our abstract results in two different situations: (i) we prove a quantitative multivariate fourth moment theorem for vectors of multiple Wiener–Itô integrals, and (ii) we characterize the rate of convergence for the finite-dimensional distributions in the functional Breuer–Major theorem.

Normal approximation for mixtures of normal distributions and the evolution of phenotypic traits

Explicit bounds are given for the Kolmogorov and Wasserstein distances between a mixture of normal distributions, by which we mean that the conditional distribution given some $\sigma$ -algebra is normal, and a normal distribution with properly chosen parameter values. The bounds depend only on the first two moments of the first two conditional moments given the $\sigma$ -algebra. The proof is based on Stein’s method. As an application, we consider the Yule–Ornstein–Uhlenbeck model, used in the field of phylogenetic comparative methods. We obtain bounds for both distances between the distribution of the average value of a phenotypic trait over n related species, and a normal distribution. The bounds imply and extend earlier limit theorems by Bartoszek and Sagitov.

An Explicit Large Deviation Analysis of the Spatial Cycle Huang–Yang–Luttinger Model

We introduce a family of ‘spatial’ random cycle Huang–Yang–Luttinger (HYL)-type models in which the counter-term only affects cycles longer than some cut-off that diverges in the thermodynamic limit. Here, spatial refers to the Poisson reference process of random cycle weights. We derive large deviation principles and explicit pressure expressions for these models, and use the zeroes of the rate functions to study Bose–Einstein condensation. The main focus is a large deviation analysis for the diverging counter term where we identify three different regimes depending on the scale of divergence with respect to the main large deviation scale. Our analysis derives explicit bounds in critical regimes using the Poisson nature of the random cycle distributions.

Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method

We quantise Whitney’s construction to prove the existence of a triangulation for any $$C^2$$ C 2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric.

New Explicit Bounds on Gronwall-Bellman-Bihari-Gamidov Integral Inequalities and Their Weakly Singular Analogues with Applications

In this paper we derive some generalizations of certain Gronwall- Bellman-Bihari-Gamidov type integral inequalities and their weakly singular analogues, which provide explicit bounds on unknown functions. To show the feasibility of the obtained inequalities, two illustrative examples are also introduced.

Solenoidal extensions in domains with obstacles: explicit bounds and applications to Navier–Stokes equations

We introduce a new method for constructing solenoidal extensions of fairly general boundary data in (2d or 3d) cubes that contain an obstacle. This method allows us to provide explicit bounds for the Dirichlet norm of the extensions. It runs as follows: by inverting the trace operator, we first determine suitable extensions, not necessarily solenoidal, of the data; then we analyze the Bogovskii problem with the resulting divergence to obtain a solenoidal extension; finally, by solving a variational problem involving the infinity-Laplacian and using ad hoc cutoff functions, we find explicit bounds in terms of the geometric parameters of the obstacle. The natural applications of our results lie in the analysis of inflow–outflow problems, in which an explicit bound on the inflow velocity is needed to estimate the threshold for uniqueness in the stationary Navier–Stokes equations and, in case of symmetry, the stability of the obstacle immersed in the fluid flow.