Related papers: Finite element approximation of the Hardy constant
We propose an adaptive finite element algorithm to approximate solutions of elliptic problems whose forcing data is locally defined and is approximated by regularization (or mollification). We show that the energy error decay is…
For the fractional Laplacian we give Hardy inequality which is optimal in $L^p$ for $1<p<\infty$. As an application, we explicitly characterize the contractivity of the corresponding Feynman-Kac semigroups on $L^p$.
We consider Hardy inequalities in $I R^n$, $n \geq 3$, with best constant that involve either distance to the boundary or distance to a surface of co-dimension $k<n$, and we show that they can still be improved by adding a multiple of a…
The solution to the elastodynamic equation in the exterior of a polyhedral domain or a screen exhibits singular behavior from the corners and edges. The detailed expansion of the singularities implies quasi-optimal estimates for piecewise…
Solutions to the wave equation in the exterior of a polyhedral domain or a screen in $\mathbb{R}^3$ exhibit singular behavior from the edges and corners. We present quasi-optimal $hp$-explicit estimates for the approximation of the…
We present a cut finite element method for shape optimization in the case of linear elasticity. The elastic domain is defined by a level-set function, and the evolution of the domain is obtained by moving the level-set along a velocity…
We study convergence of the evolving finite element semi-discretization of a parabolic partial differential equation on an evolving bulk domain. The boundary of the domain evolves with a given velocity, which is then extended to the bulk by…
We consider linear reaction-diffusion equations posed on unbounded domains, and discretized by adaptive Lagrange finite elements. To obtain finite-dimensional spaces, it is necessary to introduce a truncation boundary, whereby only a…
We derive explicit a priori consistency error estimates for a standard finite element discretization of the Poisson equation on convex domains, where the domain is approximated by an internal convex polyhedron. The obtained explicit…
This paper is concerned with the discretization error analysis of semilinear Neumann boundary control problems in polygonal domains with pointwise inequality constraints on the control. The approximations of the control are piecewise…
We study the behavior of the smallest possible constants $d(a,b)$ and $d_n$ in Hardy's inequalities $$ \int_a^b\left(\frac{1}{x}\int_a^xf(t)dt\right)^2\,dx\leq d(a,b)\,\int_a^b [f(x)]^2 dx $$ and $$…
This paper addresses the properties of Continuous Interior Penalty (CIP) finite element solutions for the Helmholtz equation. The $h$-version of the CIP finite element method with piecewise linear approximation is applied to a…
We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we…
In this paper we study the asymptotic behavior of solutions to an elliptic equation near the singularity of an inverse square potential with a coefficient related to the best constant for the Hardy inequality. Due to the presence of a…
In this paper we provide optimal bounds for fully discrete approximations to finite horizon problems via dynamic programming. We adapt the error analysis in \cite{nos} for the infinite horizon case to the finite horizon case. We prove an a…
In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…
For absolutely convergent series we state explicitly a one-sided summation estimate that can be viewed as the discrete analogue of the change of variable formula on the half line. This estimate is implicit in Pascal Lef\`evre's recent…
This work proposes a nonlinear finite element method whose nodal values preserve bounds known for the exact solution. The discrete problem involves a nonlinear projection operator mapping arbitrary nodal values into bound-preserving ones…
We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on $\mathbb{R}^d$ with stationary law (i.e. spatially…
Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…