The mortar nite element method allows the coupling of di erent discretization schemes and triangulations across subregion boundaries. In the original mortar approach the matching at the interface is realized by enforcing an orthogonality relation between the jump and a modi ed trace space which serves as a space of Lagrange multipliers. In this paper, this Lagrange multiplier space is replaced by a dual space without losing the optimality of the method. The advantage of this new approach is that the matching condition is much easier to realize. In particular, all the basis functions of the new method are supported in a few elements. The mortar map can be represented by a diagonal matrix; in the standard mortar method a linear system of equations must be solved. The problem is considered in a positive de nite nonconforming variational as well as an equivalent saddle-point formulation.

Singapore; Tokyo: Springer, 2001 (Lecture notes in computational science and engineering ; 17)

No abstract

In this paper, efficient algorithms for contact problems with Tresca and Coulomb friction in three dimensions are presented and analyzed. The numerical approximation is based on mortar methods for nonconforming meshes with dual Lagrange multipliers. Using a nonsmooth complementarity function for the three-dimensional friction conditions, a primal-dual active set algorithm is derived. The method determines active contact and friction nodes and, at the same time, resolves the additional nonlinearity originating from sliding nodes. No regularization and no penalization are applied, and superlinear convergence can be observed locally. In combination with a multigrid method, it defines a robust and fast strategy for contact problems with Tresca or Coulomb friction. The efficiency and flexibility of the method is illustrated by several numerical examples.

Abstract.We consider À(curl;Ω)-elliptic problems that have been discretized by means of Nédélec's edge elements on tetrahedral meshes. Such problems occur in the numerical computation of eddy currents. From the defect equation we derive localized expressions that can be used as a posteriori error estimators to control adaptive refinement. Under certain assumptions on material parameters and computational domains, we derive local lower bounds and a global upper bound for the total error measured in the energy norm. The fundamental tool in the numerical analysis is a Helmholtz-type decomposition of the error into an irrotational part and a weakly solenoidal part. Mathematics Subject Classification. 65N15, 65N30, 65N50. Résumé. Nous considérons des estimateurs d'erreur

The application of mortar methods in the framework of isogeometric analysis is investigated theoretically as well as numerically. For the Lagrange multiplier two choices of uniformly stable spaces are presented, both of them are spline spaces but of a different degree. In one case, we consider an equal order pairing for which a cross point modification based on a local degree reduction is required.In the other case, the degree of the dual space is reduced by two compared to the primal. This pairing is proven to be inf-sup stable without any necessary cross point modification. Several numerical examples confirm the theoretical results and illustrate additional aspects.

We consider variationally consistent discretization schemes for mechanical contact problems. Most of the results can also be applied to other variational inequalities, such as those for phase transition problems in porous media, for plasticity or for option pricing applications from finance. The starting point is to weakly incorporate the constraint into the setting and to reformulate the inequality in the displacement in terms of a saddle-point problem. Here, the Lagrange multiplier represents the surface forces, and the constraints are restricted to the boundary of the simulation domain. Having a uniform inf-sup bound, one can then establish optimal low-ordera prioriconvergence rates for the discretization error in the primal and dual variables. In addition to the abstract framework of linear saddle-point theory, complementarity terms have to be taken into account. The resulting inequality system is solved by rewriting it equivalently by means of the non-linear complementarity function as a system of equations. Although it is not differentiable in the classical sense, semi-smooth Newton methods, yielding super-linear convergence rates, can be applied and easily implemented in terms of a primal–dual active set strategy. Quite often the solution of contact problems has a low regularity, and the efficiency of the approach can be improved by using adaptive refinement techniques. Different standard types, such as residual- and equilibrated-baseda posteriorierror estimators, can be designed based on the interpretation of the dual variable as Neumann boundary condition. For the fully dynamic setting it is of interest to apply energy-preserving time-integration schemes. However, the differential algebraic character of the system can result in high oscillations if standard methods are applied. A possible remedy is to modify the fully discretized system by a local redistribution of the mass. Numerical results in two and three dimensions illustrate the wide range of possible applications and show the performance of the space discretization scheme, non-linear solver, adaptive refinement process and time integration.

International audienceThis paper introduces a new algorithm to define a stable Lagrange multiplier space to impose stiff interface conditions within the context of the extended finite element method. In contrast to earlier approaches. we do not work with an interior penalty formulation as, e.g. for Nitsche techniques, but impose the constraints weakly in terms of Lagrange multipliers. Roughly speaking a stable and optimal discrete Lagrange multiplier space has to satisfy two criteria: a best approximation property and a uniform inf-sup condition. Owing to the fact that the interface does not match the edges of the mesh, the choice of a good discrete Lagrange Multiplier space is not trivial. Here we propose a new algorithm for the local construction of the Lagrange Multiplier space and show that a uniform inf-sup condition is satisfied. A counterexample is also presented, i.e. the inf-sup constant depends on the mesh-size and degenerates as it tends to zero. Numerical results in two-dimensional confirm the theoretical ones. Copyrigh