arXiv subjects

Ingo Muench

Publications and source records attributed to Ingo Muench.

6 recordsLinked to original sources

arXiv2026

A structure-preserving discretisation of SO(3)-rotation fields for finite Cosserat micropolar elasticity

We introduce a new method, dubbed Geometric Structure-Preserving Interpolation ($\Gamma$-SPIN) to preserve physics-constraints inherent in the material parameter limits of the finite-strain Cosserat micropolar model. The method advocates to interpolate the Cosserat rotation tensor using geodesic elements, which maintain objectivity and correctly represent curvature measures. At the same time, it proposes relaxing the interaction between the rotation tensor and the deformation tensor to alleviate locking effects. This relaxation is achieved in two steps. First, the regularity of the Cosserat rotation tensor is reduced by interpolating it into the N\'ed\'elec space. Second, the resulting field is projected back onto the Lie-group of rotations. Together, these steps define a lower-regularity projection-based interpolation. The construction allows the discrete Cosserat rotation tensor to match the polar part of the discrete deformation tensor. This ensures stable behaviour in the asymptotic regime as the Cosserat couple modulus tends to infinity, which constrains the model towards its couple-stress limit. We establish the consistency, stability, and optimality of the proposed method through several benchmark problems. The study culminates in a demonstration of its efficacy on a more intricate curved domain, contrasted with outcomes obtained from conventional interpolation techniques.

math.NA↗

arXiv2023

Higher order Bernstein-B\'ezier and N\'ed\'elec finite elements for the relaxed micromorphic model

The relaxed micromorphic model is a generalized continuum model that is well-posed in the space $X = [H^1]^3 \times [H(\textrm{curl})]^3$. Consequently, finite element formulations of the model rely on $H^1$-conforming subspaces and N\'ed\'elec elements for discrete solutions of the corresponding variational problem. This work applies the recently introduced polytopal template methodology for the construction of N\'ed\'elec elements. This is done in conjunction with Bernstein-B\'ezier polynomials and dual numbers in order to compute hp-FEM solutions of the model. Bernstein-B\'ezier polynomials allow for optimal complexity in the assembly procedure due to their natural factorization into univariate Bernstein base functions. In this work, this characteristic is further augmented by the use of dual numbers in order to compute their values and their derivatives simultaneously. The application of the polytopal template methodology for the construction of the N\'ed\'elec base functions allows them to directly inherit the optimal complexity of the underlying Bernstein-B\'ezier basis. We introduce the Bernstein-B\'ezier basis along with its factorization to univariate Bernstein base functions, the principle of automatic differentiation via dual numbers and a detailed construction of N\'ed\'elec elements based on Bernstein-B\'ezier polynomials with the polytopal template methodology. This is complemented with a corresponding technique to embed Dirichlet boundary conditions, with emphasis on the consistent coupling condition. The performance of the elements is shown in examples of the relaxed micromorphic model.

math.NA↗

arXiv2022

Polytopal templates for the formulation of semi-continuous vectorial finite elements of arbitrary order

The Hilbert spaces $H(\mathrm{curl})$ and $H(\mathrm{div})$ are needed for variational problems formulated in the context of the de Rham complex in order to guarantee well-posedness. Consequently, the construction of conforming subspaces is a crucial step in the formulation of viable numerical solutions. Alternatively to the standard definition of a finite element as per Ciarlet, given by the triplet of a domain, a polynomial space and degrees of freedom, this work aims to introduce a novel, simple method of directly constructing semi-continuous vectorial base functions on the reference element via polytopal templates and an underlying $H^1$-conforming polynomial subspace. The base functions are then mapped from the reference element to the element in the physical domain via consistent Piola transformations. The method is defined in such a way, that the underlying $H^1$-conforming subspace can be chosen independently, thus allowing for constructions of arbitrary polynomial order. The base functions arise by multiplication of the basis with template vectors defined for each polytope of the reference element. We prove a unisolvent construction of N\'ed\'elec elements of the first and second type, Brezzi-Douglas-Marini elements, and Raviart-Thomas elements. An application for the method is demonstrated with two examples in the relaxed micromorphic model

math.NA↗

arXiv2022

On H1, H(curl) and H(sym Curl) finite elements for matrix-valued Curl problems

In this work we test the numerical behaviour of matrix-valued fields approximated by finite element subspaces of $[\mathit{H}^1]^{3\times 3}$, $[\mathit{H}(\mathrm{curl})]^3$ and $\mathit{H}(\mathrm{sym}\mathrm{Curl})$ for a linear abstract variational problem connected to the relaxed micromorphic model. The formulation of the corresponding finite elements is introduced, followed by numerical benchmarks and our conclusions. The relaxed micromorphic continuum model reduces the continuity assumptions of the classical micromorphic model by replacing the full gradient of the microdistortion in the free energy functional with the Curl. This results in a larger solution space for the microdistortion, namely $[\mathit{H}(\mathrm{curl})]^3$ in place of the classical $[\mathit{H}^1]^{3\times 3}$. The continuity conditions on the microdistortion can be further weakened by taking only the symmetric part of the Curl. As shown in recent works, the new appropriate space for the microdistortion is then $\mathit{H}(\mathrm{sym}\mathrm{Curl})$. The newly introduced space gives rise to a new differential complex for the relaxed micromorphic continuum theory.

math.NA↗

arXiv2022

Primal and mixed finite element formulations for the relaxed micromorphic model

The classical Cauchy continuum theory is suitable to model highly homogeneous materials. However, many materials, such as porous media or metamaterials, exhibit a pronounced microstructure. As a result, the classical continuum theory cannot capture their mechanical behaviour without fully resolving the underlying microstructure. In terms of finite element computations, this can be done by modelling the entire body, including every interior cell. The relaxed micromorphic continuum offers an alternative method by instead enriching the kinematics of the mathematical model. The theory introduces a microdistortion field, encompassing nine extra degrees of freedom for each material point. The corresponding elastic energy functional contains the gradient of the displacement field, the microdistortion field and its Curl (the micro-dislocation). Therefore, the natural spaces of the fields are $[\mathit{H}^1]^3$ for the displacement and $[\mathit{H}(\mathrm{curl})]^3$ for the microdistortion, leading to unusual finite element formulations. In this work we describe the construction of appropriate finite elements using N\'ed\'elec and Raviart-Thomas subspaces, encompassing solutions to the orientation problem and the discrete consistent coupling condition. Further, we explore the numerical behaviour of the relaxed micromorphic model for both a primal and a mixed formulation. The focus of our benchmarks lies in the influence of the characteristic length $L_\mathrm{c}$ and the correlation to the classical Cauchy continuum theory.

math.NA↗

arXiv2020

A flexible sparse matrix data format and parallel algorithms for the assembly of sparse matrices in general finite element applications using atomic synchronisation primitives

Finite element methods require the composition of the global stiffness matrix from local finite element contributions. The composition process combines the computation of element stiffness matrices and their assembly into the global stiffness matrix, which is commonly sparse. In this paper we focus on the assembly process of the global stiffness matrix and explore different algorithms and their efficiency on shared memory systems using C++. A key aspect of our investigation is the use of atomic synchronization primitives for the derivation of data-race free algorithms and data structures. Furthermore, we propose a new flexible storage format for sparse matrices and compare its performance with the compressed row storage format using abstract benchmarks based on common characteristics of finite element problems.

math.NA↗