336 research outputs found
Directional differentiability for elliptic quasi-variational inequalities of obstacle type
The directional differentiability of the solution map of obstacle type
quasi-variational inequalities (QVIs) with respect to perturbations on the
forcing term is studied. The classical result of Mignot is then extended to
the quasi-variational case under assumptions that allow multiple solutions of
the QVI. The proof involves selection procedures for the solution set and
represents the directional derivative as the limit of a monotonic sequence of
directional derivatives associated to specific variational inequalities.
Additionally, estimates on the coincidence set and several simplifications
under higher regularity are studied. The theory is illustrated by a detailed
study of an application to thermoforming comprising of modelling, analysis
and some numerical experiments
Computational Engineering
The focus of this Computational Engineering Workshop was on the mathematical foundation of state-of-the-art and emerging finite element methods in engineering analysis. The 52 participants included mathematicians and engineers with shared interest on discontinuous Galerkin or Petrov-Galerkin methods and other generalized nonconforming or mixed finite element methods
Polyharmonic homogenization, rough polyharmonic splines and sparse super-localization
We introduce a new variational method for the numerical homogenization of
divergence form elliptic, parabolic and hyperbolic equations with arbitrary
rough () coefficients. Our method does not rely on concepts of
ergodicity or scale-separation but on compactness properties of the solution
space and a new variational approach to homogenization. The approximation space
is generated by an interpolation basis (over scattered points forming a mesh of
resolution ) minimizing the norm of the source terms; its
(pre-)computation involves minimizing quadratic (cell)
problems on (super-)localized sub-domains of size .
The resulting localized linear systems remain sparse and banded. The resulting
interpolation basis functions are biharmonic for , and polyharmonic
for , for the operator -\diiv(a\nabla \cdot) and can be seen as a
generalization of polyharmonic splines to differential operators with arbitrary
rough coefficients. The accuracy of the method ( in energy norm
and independent from aspect ratios of the mesh formed by the scattered points)
is established via the introduction of a new class of higher-order Poincar\'{e}
inequalities. The method bypasses (pre-)computations on the full domain and
naturally generalizes to time dependent problems, it also provides a natural
solution to the inverse problem of recovering the solution of a divergence form
elliptic equation from a finite number of point measurements.Comment: ESAIM: Mathematical Modelling and Numerical Analysis. Special issue
(2013
Density of convex intersections and applications
In this paper, we address density properties of intersections of convex sets in several function spaces. Using the concept of Γ-convergence, it is shown in a general framework, how these density issues naturally arise from the regularization, discretization or dualization of constrained optimization problems and from perturbed variational inequalities. A variety of density results (and counterexamples) for pointwise constraints in Sobolev spaces are presented and the corresponding regularity requirements on the upper bound are identified. The results are further discussed in the context of finite-element discretizations of sets associated with convex constraints. Finally, two applications are provided, which include elasto-plasticity and image restoration problems
- …