Mortar Finite Element Discretization Research Articles

On torque computation in electric machine simulation by harmonic mortar methods

The use of trigonometric polynomials as Lagrange multipliers in the harmonic mortar method enables an efficient and elegant treatment of relative motion in the stator-rotor coupling of electric machine simulation. Explicit formulas for the torque computation are derived by energetic considerations, and their realization by harmonic mortar finite element and isogeometric analysis discretizations is discussed. Numerical tests are presented to illustrate the theoretical results and demonstrate the potential of harmonic mortar methods for the evaluation of torque ripples.

A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems

This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation, that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. The resulting nonconforming formulation and a reduced via static condensation Schur complement form on the interfaces are used in the construction of auxiliary space preconditioners for a given conforming finite element discretization problem. The properties of these preconditioners are studied and their performance is illustrated on model second order scalar elliptic problems utilizing high order elements.

Computational Wear and Contact Modeling for Fretting Analysis with Isogeometric Dual Mortar Methods

A finite element framework based on dual mortar methods is presented for simulating fretting wear effects in the finite deformation regime. The mortar finite element discretization is realized with Lagrangean shape functions as well as isogeometric elements based on non-uniform rational B-splines (NURBS) in two and three dimensions. Fretting wear effects are modeled in an incremental scheme with the help of Archard’s law and the worn material is considered as additional contribution to the gap function. Numerical examples demonstrate the robustness and accuracy of the presented algorithm.

Mortar finite element discretization of the time dependent nonlinear Darcy’s equations

We consider the non stationary flow of a viscous incompressible fluid in a rigid nonhomogeneous porous medium provided with mixed boundary conditions. Since the medium is nonhomogeneous, its permeability is only piecewise continuous. We are thus led to use the mortar method to handle these discontinuities. We propose a space and time discretization of the full system. We prove optimal a priori error estimates, which confirms the interest of the discretization.

Domain decomposition methods for nonlinear transmission conditions

AbstractWe consider the transformation of quasilinear partial differential equations to a coupled system of linear equations, but with nonlinear transmission conditions on the interfaces. After deriving a variational formulation, we will discuss Mortar finite element discretization strategies and present a numerical example. (© 2014 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Some new residual-based a posteriori error estimators for the mortar finite element methods

In this paper, we propose some new residual-based a posteriori error estimators for the mortar finite element discretization of the second order elliptic equations with discontinuous coefficients. Reliability and efficiency of the estimators are given. Our analysis does not require any saturation assumptions and the mesh restrictions on the interface which are often needed in the literature. Numerical experiments are presented to confirm our theoretical analysis.

Schwarz preconditioned CG algorithm for the mortar finite element

We propose a simple and effective hybrid (multiplicative) Schwarz precondtioner for solving systems of algebraic equations resulting from the mortar finite element discretization of second order elliptic problems on nonmatching meshes. The preconditioner is embedded in a variant of the classical preconditioned conjugate gradient (PCG) for an effective implementation reducing the cost of computing the matrix-vector multiplication in each iteration of the PCG. In fact, it serves as a framework for effective implementation of a class of hybrid Schwarz preconditioners. The preconditioners of this class are based on solving a sequence of non-overlapping local subproblems exactly, and the coarse problems either exactly or inexactly (approximately). The classical PCG algorithm is reformulated in order to make reuse of the results of matrix-vector multiplications that are already available from the preconditioning step resulting in an algorithm which is cost effective. An analysis of the proposed preconditioner, with numerical results, showing scalability with respect to the number of subdomains, and a convergence which is independent of the jumps of the coefficients are given.

A balancing Neumann–Neumann method for a mortar finite element discretization of a fourth order elliptic problem

In the paper a balanced Neumann–Neumann algorithm for the reduced HCT finite element discretization on nonmatching meshes is discussed. The overall discretization is done using a mortar technique which is based on the application of an approximate matching condition for the discrete functions. The algorithms are analyzed using the abstract Schwarz framework, proving an almost optimal condition bound which is independent of the parameters of the problem, and depends only logarithmically on the ratio between the subdomain size and the mesh size.

A 3D Crouzeix-Raviart mortar finite element

A mortar finite element discretization of the second order elliptic problem in three dimensions, on non-matching grids, using the 3D Crouzeix-Raviart (CR) finite element in each subdomain, is proposed in this paper. The overall discretization is based on using only the nodal values on the mortar side of a subdomain interface for the calculation of the mortar projection, as opposed to applying the conventional approach where some nodal values in the interior of a subdomain are also required. Since the interior degrees of freedom disappear completely from the computation of the mortar projection, the proposed algorithm becomes less intricate and more flexible as compared to the conventional approach. An error estimate is given, and some numerical experiments are presented.

A Neumann–Neumann algorithm for a mortar finite element discretization of fourth‐order elliptic problems in 2D

AbstractHere we present and analyze a Neumann–Neumann algorithm for the mortar finite element discretization of elliptic fourth‐order problems with discontinuous coefficients. The fully parallel algorithm is analyzed using the abstract Schwarz framework, proving a convergence which is independent of the parameters of the problem, and depends only logarithmically on the ratio between the subdomain size and the mesh size.© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009

Mortar finite element discretization of a model coupling Darcy and Stokes equations

As a first draft of a model for a river flowing on a homogeneous porous ground, we consider a system where the Darcy and Stokes equations are coupled via appropriate matching conditions on the interface. We propose a discretization of this problem which combines the mortar method with standard finite elements, in order to handle separately the flow inside and outside the porous medium. We prove a priori and a posteriori error estimates for the resulting discrete problem. Some numerical experiments confirm the interest of the discretization.

Mortar finite element discretization for the flow in a nonhomogeneous porous medium

Darcy’s equations model the flow of a viscous incompressible fluid in a rigid porous medium. One of the parameters of the system depends on the permeability of the medium and, when this medium is not homogeneous, the variations of the parameter could be very high. To handle this phenomenon, we propose a discretization of the model that relies on the mortar finite element method. Indeed, the idea is to construct a decomposition of the domain such that the permeability is constant on each element of the partition and to use independent meshes on the different subdomains. We perform the a priori and a posteriori analysis of this discretization and present some numerical experiments which are in good coherency with the results of the analysis.

Additive Schwarz Method for Mortar Discretization of Elliptic Problems with P1 Nonconforming Finite Elements

An additive Schwarz preconditioner for nonconforming mortar finite element discretization of a second order elliptic problem in two dimensions with arbitrary large jumps of the discontinuous coefficients in subdomains is described.

A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients

Neumann-Neumann algorithm have been well developed for standard finite element discretization of elliptic problems with discontinuous coefficients. In this paper, an algorithm of this kind is designed and analyzed for a mortar finite element discretization of problems in three dimensions. It is established that its rate of convergence is independent of the discretization parameters and jumps of coefficients between subregions. The algorithm is well suited for parallel computations.

Error Indicators for the Mortar Finite Element Discretization of a Parabolic Problem

In this paper we study residual spatial error indicators for a parabolic equation already discretized with respect to the time variable and approximated with the mortar finite element method. A posteriori error estimates are given at each step of time and are based on a local residual, the jumps of the normal derivative through the interfaces between elements and the jumps of the discrete solution through the mortars.

Additive Schwarz Methods for Elliptic Mortar Finite Element Problems

Two variants of the additive Schwarz method for solving linear systems arising from the mortar finite element discretization on nonmatching meshes of second order elliptic problems with discontinuous coefficients are designed and analyzed. The methods are defined on subdomains without overlap, and they use special coarse spaces, resulting in algorithms that are well suited for parallel computation. The condition number estimate for the preconditioned system in each method is proportional to the ratio H/h, where H and h are the mesh sizes, and it is independent of discontinuous jumps of the coefficients. For one of the methods presented the choice of the mortar (nonmortar) side is independent of the coefficients.

Duality Estimates and Multigrid Analysis for Saddle Point Problems Arising from Mortar Discretizations

We present an abstract framework for the analysis of multigrid methods for a saddle point problem arising from mortar finite element discretizations. In contrast to other approaches, the iterates do not have to be in the positive definite subspace. Moreover, our approach also covers the case of nonnested Lagrange multiplier spaces. We apply the multigrid method to different mortar settings including dual Lagrange multipliers, linear elasticity, and a rotating geometry. Numerical results in two dimensions and three dimensions demonstrate the flexibility, efficiency, and reliability of our multigrid method.

Error indicators for the mortar finite element discretization of the Laplace equation

The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the elements of a nonconforming partition of the initial domain. The aim of this paper is to extend the numerical analysis of residual error indicators to this type of methods for a model problem and to check their efficiency thanks to some numerical experiments.

A Multigrid Method Based on the Unconstrained Product Space for Mortar Finite Element Discretizations

The mortar finite element method allows the coupling of different discretizations across subregion boundaries. In the original mortar approach, the Lagrange multiplier space enforcing a weak continuity condition at the interfaces is defined as a modified finite element trace space. Here we present a new approach, where the Lagrange multiplier space is replaced by a dual space without losing the optimality of the a priori bounds. We introduce new dual spaces in 2D and 3D. Using the biorthogonality between the nodal basis functions of this Lagrange multiplier space and a finite element trace space, we derive an equivalent symmetric positive definite variational problem defined on the unconstrained product space. The introduction of this formulation is based on a local elimination process for the Lagrange multiplier. This equivalent approach is the starting point for the efficient iterative solution by a multigrid method. To obtain level independent convergence rates for the $\Cw$-cycle, we have to define suitable level dependent bilinear forms and transfer operators. Numerical results illustrate the performance of our multigrid method in 2D and 3D.

Multigrid for the Mortar Finite Element Method

A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulations (which need not align across subdomain interfaces) are in general not nested. Suitable grid transfer operators and smoothers are developed which lead to a variable V-cycle preconditioner resulting in a uniformly preconditioned algebraic system. Computational results illustrating the theory are also presented.