An official website of the United States government
This work aims to prove a Hardy-type inequality and a trace theorem for a class of function spaces on smooth domains with a nonlocal character. Functions in these spaces are allowed to be as rough as an [Formula: see text]-function inside the domain of definition but as smooth as a [Formula: see text]-function near the boundary. This feature is captured by a norm that is characterized by a nonlocal interaction kernel defined heterogeneously with a special localization feature on the boundary. Thus, the trace theorem we obtain here can be viewed as an improvement and refinement of the classical trace theorem for fractional Sobolev spaces [Formula: see text]. Similarly, the Hardy-type inequalities we establish for functions that vanish on the boundary show that functions in this generalized space have the same decay rate to the boundary as functions in the smaller space [Formula: see text]. The results we prove extend existing results shown in the Hilbert space setting with p = 2. A Poincaré-type inequality we establish for the function space under consideration together with the new trace theorem allows formulating and proving well-posedness of a nonlinear nonlocal variational problem with conventional local boundary condition.
more »
« less
Compactness results for a Dirichlet energy of nonlocal gradient with applications
Abstract We prove two compactness results for function spaces with finite Dirichlet energy of half‐space nonlocal gradients. In each of these results, we provide sufficient conditions on a sequence of kernel functions that guarantee the asymptotic compact embedding of the associated nonlocal function spaces into the class of square‐integrable functions. Moreover, we will demonstrate that the sequence of nonlocal function spaces converges in an appropriate sense to a limiting function space. As an application, we prove uniform Poincaré‐type inequalities for sequence of half‐space gradient operators. We also apply the compactness result to demonstrate the convergence of appropriately parameterized nonlocal heterogeneous anisotropic diffusion problems. We will construct asymptotically compatible schemes for these type of problems. Another application concerns the convergence and robust discretization of a nonlocal optimal control problem.
more »
« less
- PAR ID:
- 10600045
- Publisher / Repository:
- Wiley
- Date Published:
- Journal Name:
- Numerical Methods for Partial Differential Equations
- Volume:
- 40
- Issue:
- 6
- ISSN:
- 0749-159X
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This work contributes to nonlocal vector calculus as an indispensable mathematical tool for the study of nonlocal models that arises in a variety of applications. We define the nonlocal half-ball gradient, divergence and curl operators with general kernel functions (integrable or fractional type with finite or infinite supports) and study the associated nonlocal vector identities. We study the nonlocal function space on bounded domains associated with zero Dirichlet boundary conditions and the half-ball gradient operator and show it is a separable Hilbert space with smooth functions dense in it. A major result is the nonlocal Poincaré inequality, based on which a few applications are discussed, and these include applications to nonlocal convection–diffusion, nonlocal correspondence model of linear elasticity and nonlocal Helmholtz decomposition on bounded domains.more » « less
-
Motivated by some variational problems from a nonlocal model of mechanics, this work presents a set of sufficient conditions that guarantee a compact inclusion in the function space of $$ L^{p} $$ vector fields defined on a domain $$ \Omega $$ that is either a bounded domain in $$ \mathbb{R}^{d} $$ or $$ \mathbb{R}^{d} $$ itself. The criteria are nonlocal and are given with respect to nonlocal interaction kernels that may not be necessarily radially symmetric. Moreover, these criteria for vector fields are also different from those given for scalar fields in that the conditions are based on nonlocal interactions involving only parts of the components of the vector fields. The $$ L^{p} $$ compactness criteria are utilized in demonstrating the convergence of minimizers of parameterized nonlocal energy functionals.more » « less
-
Abstract Finite element methods developed for unfitted meshes have been widely applied to various interface problems. However, many of them resort to non-conforming spaces for approximation, which is a critical obstacle for the extension to $$\textbf{H}(\text{curl})$$ equations. This essential issue stems from the underlying Sobolev space $$\textbf{H}^s(\text{curl};\,\Omega)$$ , and even the widely used penalty methodology may not yield the optimal convergence rate. One promising approach to circumvent this issue is to use a conforming test function space, which motivates us to develop a Petrov–Galerkin immersed finite element (PG-IFE) method for $$\textbf{H}(\text{curl})$$ -elliptic interface problems. We establish the Nédélec-type IFE spaces and develop some important properties including their edge degrees of freedom, an exact sequence relating to the $H^1$ IFE space and optimal approximation capabilities. We analyse the inf-sup condition under certain assumptions and show the optimal convergence rate, which is also validated by numerical experiments.more » « less
-
Abstract We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by summation of a smooth, possibly nonconvex function and a convex simple function. The algorithm converts the original problem into a sequence of convex subproblems. Formulating those subproblems requires the evaluation of at most one gradient-value of the original objective and constraint functions. Either exact or approximate subproblems solutions can be computed efficiently in many cases. An important feature of the algorithm is the constraint level parameter. By carefully increasing this level for each subproblem, we provide a simple solution to overcome the challenge of bounding the Lagrangian multipliers and show that the algorithm follows a strictly feasible solution path till convergence to the stationary point. We develop a simple, proximal gradient descent type analysis, showing that the complexity bound of this new algorithm is comparable to gradient descent for the unconstrained setting which is new in the literature. Exploiting this new design and analysis technique, we extend our algorithms to some more challenging constrained optimization problems where (1) the objective is a stochastic or finite-sum function, and (2) structured nonsmooth functions replace smooth components of both objective and constraint functions. Complexity results for these problems also seem to be new in the literature. Finally, our method can also be applied to convex function constrained problems where we show complexities similar to the proximal gradient method.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- https://doi.org/10.1002/num.23149
