Abstract
In this work we present an error estimator for a class of second order quasilinear elliptic problems in 2D. The computational domain consists of two parts—called rotor and stator in the framework of electrical motors—separated by a curvilinear interface. For the coupling of the rotor and the stator on the interface we use a Nitsche technique as described in Hollaus et al. (Nitsche-type mortaring for Maxwell’s equations, In: Progress in electromagnetics research symposium proceedings, Cambridge, pp 397–402, 5–8 July 2010). The residual error estimator is constructed similarly to the approach used in Houston et al. (IMA J Numer Anal 28:245–273, 2008) with adaptations due to the coupling strategy. The error estimator takes into account the polygonal approximation of the stator and the rotor using ideas from hierarchical error estimates.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
1 Motivation and Introduction
During an optimization process of a rotating electrical machine with respect to specific requirements on the performance many different designs have to be simulated. In each simulation a complete rotation cycle of the motor has to be performed. The vast amount of simulations calls for efficient concepts to reduce the computational costs.
Our focus is on the introduction of a domain decomposition approach that allows an independent meshing of the two motor parts. This decomposition gives us the flexibility to simulate the whole rotation cycle without remeshing. Furthermore, to reduce the complexity of the simulation while attaining the same accuracy of the calculation we are interested in a mesh that is as coarse as possible and as fine as necessary. To achieve an optimal distribution of the degrees of freedom in our finite element mesh we use an adaptive mesh refinement procedure.
2 Model Problem
To model the behaviour of the electrical machine we use the magnetostatic case of Maxwell’s equations in 2D. Since we are interested in modelling a rotating electrical machine our computational domain Ωdecomposes—as already mentioned—into two different parts. One part is fixed—we will call it stator Ω S—and one part is moving—the rotor Ω R. Both parts consist of various material domains Ω i, i ∈ I. In our considerations we added to the physical stator and rotor an outer and inner air domain as well as parts of the motor-air-gap to each of them respectively. Additionally we introduce the interface
where ∂Ω k represents the boundary of the respective domain.
Remark 1
In our application we consider only interfaces Γ that are circular (Fig. 1).
The variational formulation for the continuous problem then has the following form: Find \(u \in H_{0}^{1} \left ( \varOmega _{} \right )\) such that
with the semi-linear form
and the linear form
Here u i is the restriction of the solution u to the domain Ω i. The right-hand side includes contributions from the current J 3,i in the coils of the electrical machine and from the magnetization of domains representing permanent magnets, denoted by M i = (M 1,i, M 2,i). The material properties in Ω i is described by the function ν i, which is non-linear in iron. In air we use a constant value ν 0. H s(Ω) and \(H^{s}_{0}(\varOmega )\) denote the usual Sobolev spaces.
2.1 Nitsche Coupling
The Nitsche coupling is a domain decomposition technique see, e.g., [2, 3]. The idea is to penalize the jump of the solution on the two adjacent domains Ω S and Ω R across the interface Γ. For this the trace of u on Γ is introduced as a new variable λ (Fig. 2).
2.1.1 Discrete Problem
We approximate the domains Ω S and Ω R by admissible triangular meshes \(\mathcal {T}_{S,h}\) and \(\mathcal {T}_{R,h}\). We require that all nodes of an element T lie inside one material domain Ω i. With this assumption we write ν T instead of ν i for this triangle. We assume that the meshes are shape-regular. The interface Γis subdivided by elements \(\mathcal {E}_{\varGamma _{}} = \left \{ e \right \}\) with \(\varGamma _{} = \bigcup _{e \in \mathcal {E}_{\varGamma _{}}} \overline {e}\). Note that the elements of \(\mathcal {E}_{\varGamma _{}}\) are curvilinear and represent Γaccurately. So the overall mesh is described by the triple \(\mathcal {M}_{h} = (\mathcal {T}_{S,h}\), \(\mathcal {T}_{R,h}, \mathcal {E}_{\varGamma _{}})\) (Fig. 3).
For the discretization we use continuous piece-wise linear elements, in details: Find \({\mathbf {u}}_{h} = (u_{S,h}, u_{R,h}, \lambda _{h}) \in X_{h}(\mathcal {M}_{h}) = V_{h}\left ( \mathcal {T}_{S,h} \right ) \times V_{h} \left ( \mathcal {T}_{R,h} \right ) \times W_{h} \left ( \mathcal {E}_{\varGamma _{}} \right ),\) such that
with
where \(\mathcal {P}^{1}(T)\) is the space of polynomials of degree less than 1 restricted to the element T and
where \(\widehat {e} = [0,1]\) denotes the reference element and F e maps \(\widehat {e}\) onto e. The semi-linear form and the linear form are given by
and
Here n k stands for the normal vector on ∂Ω k that points in outward direction. \(\overline {u}_{k,h}\) and \(\overline {w}_{k,h}\) denotes the extension of the function u k,h and w k,h respectively as defined by
Definition 1 (Extensions of u h)
The extension of u k,h from Ω k,h to Ω k ∪ Ω k,h is given in the following way:
where u ext denotes the linear extension of the function on the triangle to the curved domain.
The second term on the right-hand side in (3) is called consistency term, the third term is the symmetry term, since in the linear case we get a symmetric bilinear form by choosing β = −1. The last term in (3) is referred to as penalization term.
We use β = −1 and we choose the parameter α = 20. This choice results in a symmetric, positive definite stiffness matrix. In the notation of discontinuous Galerkin methods this corresponds to a symmetric interior penalty Galerkin (SIPG) method.
3 A Posteriori Error Estimator
The error is estimated in the following energy norm (see [2, p.6])
where ν ref,i is a reference value for each material domain, and
Additionally we introduce the jump notation for vector-valued functions q:
For the error estimator we introduce another mesh \(\widehat {\mathcal {M}}_{h}\) which is finer near the curvilinear boundaries than \(\mathcal {M}_{h}\) (see Fig. 4). In particular we start in each part Ω k from the mesh \(\mathcal {T}_{k,h}\) and refine all elements with at least two nodes on a curvilinear boundary uniformly. Additionally the neighbouring elements are refined in such a way that we end up with admissible meshes. The interface elements are refined uniformly. This refinement strategy is repeated until the boundary is approximated sufficiently well. By \(\widehat {\mathbf {u}}_{h}\) we will denote an approximate solution of the discrete problem on this finer mesh (calculated by using a few steps of a symmetric Gauss-Seidel-Iteration), extended to \(\varOmega \cup \widehat {\varOmega }_{h}\) as described in Definition 1.
Theorem 1 (A Posteriori Error Estimation)
Let \(u \in H_{0}^{1}(\varOmega )\)be the solution of problem (1), and let \({\mathbf {u}}_{h} \in X_{h}(\mathcal {M}_{h})\)denote the solution of (2) and \(\widehat {\mathbf {u}}_{h} \in X_{h}(\widehat {\mathcal {M}}_{h})\)denotes the solution on the finer mesh. Then there exists a constant C such that for \(\overline {\mathbf {e}}_{h} = \mathbf {u} - \overline {\mathbf {u}}_{h}\)the following a posteriori error bound holds:
with
where
The set \(\mathcal {C}(T)\) consists of all child-triangles of T in \(\widehat {\mathcal {T}}_{h,k}\) . For the oscillation terms \(\mathcal {O}_{\eta }(f_{k}, \widehat {u}_{h})\) see [ 4 , p.6].
Remark 2
In [1] an adaptive strategy including a posteriori controlled boundary approximation was presented for the Poisson problem with pure Dirichlet conditions. This technique cannot be adopted to the case of mixed boundary and interface conditions.
3.1 Marking and Refinement Strategy
The constant C in Theorem 1 plays the role of a weighting factor. For the numerical experiments C was replaced by a computable heuristic approximation based on information on the coarsest mesh leading to corresponding computable approximations which—for simplicity—are denoted by the same symbols η T and η e,k. With these quantities we assign local error indicators \(\widetilde {\eta }_{T}, \widetilde {\eta }_{e}\) for each triangle T and each edge e from \(\mathcal {M}_{h}\) in the following way:
-
1.
for all triangles T with at most one vertex on Γ we set \(\widetilde {\eta }_{T} = \eta _{T}\),
-
2.
for every \(e \in \mathcal {E}_{\varGamma }\) we set \(\widetilde {\eta }_{e} = \eta _{e,S} + \eta _{e,R}\),
-
3.
for the remaining triangles we set \(\widetilde {\eta }_{T}\) equal to η T enlarged by contributions \(\widetilde {\eta }_{e}\) from edges \(e \in \mathcal {E}_{\varGamma }\) weighted proportional to the length of the edge e between the two point of T on Γ.
As marking strategy we use Dörfler marking. For refinement we used classical red- and green-refinement.
4 Numerical Experiments
The error estimator was tested for the motor geometry shown in Fig. 1 for different rotor-to-stator positions. The initial mesh was generated with Netgen [5] and consists of 562 degrees of freedom. The mesh generator takes material interfaces into account leading to a non-uniform distribution of elements mainly concentrated around the air gap as depicted in Fig. 5.
For the first rotor-to-stator position the final mesh after 7 refinement steps is depicted in Fig. 6 and the reduction of the error in the energy-norm compared to the solution on a uniform refined mesh shown in Fig. 7.
Starting from the same initial mesh, with the rotor part rotated by φ = 60∘ we arrive after 7 refinement steps at a mesh depicted in Fig. 8 with an error reduction rate given in Fig. 9.
5 Conclusions
The adaptive refinement strategy show promising results. As expected due to the varying current in the coils for different φ as well as the natural change in the overall geometry the refined mesh looks quite different for different φ. Since it would be preferable to have one refined mesh for all rotation angles we are working on strategies to refine the mesh in an optimal way for the whole rotation cycle.
References
Dörfler, W., Rumpf, M.: An adaptive strategy for elliptic problems including a posteriori controlled boundary approximation. Math. Comput. 67, 1361–1382 (1998)
Egger, H.: A class of hybrid mortar finite element methods for interface problems with non-matching meshes. Preprint AICES-2009-2, Jan 2009
Hollaus, K., Feldengut, D., Schöberl, J., Wabro, M., Omeragic, D.: Nitsche-type mortaring for Maxwell’s equations. In: Progress in Electromagnetics Research Symposium Proceedings, Cambridge, pp. 397–402, 5–8 July 2010
Houston, P., Süli, E., Wihler, T. P.: A posteriori error analysis of hp-version discontinuous Galerkin finite-element methods for second-order quasi-linear elliptic PDEs. IMA J. Numer. Anal. 28, 245–273 (2008)
Netgen: Online document (2018). https://ngsolve.org/. Visited 30 Jan 2019
Acknowledgements
This work has been supported by the “LCM - K2 Center for Symbiotic Mechatronics” within the framework of the Austrian COMET-K2 program.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Fohler, A., Zulehner, W. (2020). Adaptive Mesh Refinement for Rotating Electrical Machines Taking into Account Boundary Approximation Errors. In: Nicosia, G., Romano, V. (eds) Scientific Computing in Electrical Engineering. SCEE 2018. Mathematics in Industry(), vol 32. Springer, Cham. https://doi.org/10.1007/978-3-030-44101-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-44101-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44100-5
Online ISBN: 978-3-030-44101-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)