16 research outputs found

    A non-invasive implementation of a mixed domain decomposition method for frictional contact problems

    No full text
    A non-invasive implementation of the Latin domain decomposition method for frictional contact problems is described. The formulation implies to deal with mixed (Robin) conditions on the faces of the sub-domains, which is not a classical feature of commercial software. Therefore we propose a new implementation of the linear stage of the Latin method with a non-local search direction built as the stiffness of a layer of elements on the interfaces. This choice enables us to implement the method within the opensource software Code Aster, and to derive 2D and 3D examples with similar performance as standard Latin method

    Computation of resonance frequencies for Maxwell equations in non-smooth domains

    No full text
    Summary. We address the computation by finite elements of the non-zero eigenvalues of the (curl, curl) bilinear form with perfect conductor boundary conditions in a polyhedral cavity. One encounters two main difficulties: (i) The infinite dimensional kernel of this bilinear form (the gradient fields), (ii) The unbounded singularities of the eigen-fields near corners and edges of the cavity. We first list possible variational spaces with their functional properties and provide a short description of the edge and corner singularities. Then we address different formulations using a Galerkin approximation by edge elements or nodal elements. After a presentation of edge elements, we concentrate on the functional issues connected with the use of nodal elements. In the framework of conforming methods, nodal elements are mandatory if one regularizes the bilinear form (curl, curl) in order to get rid of the gradient fields. A plain regularization with the (div,div) bilinear form converges to a wrong solution if the domain has reentrant edges or corners. But remedies do exist. We will present the method of addition of singular functions, and the method of regularization with weight, where the (div,div) bilinear form is modified by the introduction of a weight which can be taken as the distance to reentrant edges or corners
    corecore