 # Modelling of a Permanent Magnet Synchronous Machine Using Isogeometric Analysis

Isogeometric analysis (IGA) is used to simulate a permanent magnet synchronous machine. IGA uses non-uniform rational B-splines to parametrise the domain and to approximate the solution space, thus allowing for the exact description of the geometries even on the coarsest level of mesh refinement. Given the properties of the isogeometric basis functions, this choice guarantees a higher accuracy than the classical finite element method. For dealing with the different stator and rotor topologies, the domain is split into two non-overlapping parts on which Maxwell's equations are solved independently in the context of a classical Dirichlet-to-Neumann domain decomposition scheme. The results show good agreement with the ones obtained by the classical finite element approach.

## Authors

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## I Introduction

Electric machines are usually modelled through the magnetoquasistatic approximation of Maxwell’s equations discretised on the machine cross section, which requires the solution of a 2D Poisson problem. Its numerical solution commonly amounts to triangulating the domain and applying the *fem. The acting electromotive forces and the torque can be determined by a post-processing procedure, e.g. invoking the Maxwell stress tensor method. A drawback of the standard approach is that a very fine mesh is needed to achieve an acceptable accuracy. Moreover, the air gap needs to be resolved properly and the solution is known to be extremely sensitive to the used discretisation

. Furthermore, remeshing or reconnecting mesh parts in order to account for the machine rotation can introduce a spurious ripple on the solution for the torque .

An exact parametrisation of the air gap is not possible within a classical *fem framework since elements of any order rely on polynomial mappings which are unable to represent conic sections such as circles and ellipses. Furthermore, the regularity of *fem solutions is typically limited by the continuity across the elements .

*iga  is able to overcome these issues. It chooses *cad basis functions such as e.g. B-splines and *nurbs for the approximation spaces and is thus able to represent *cad geometries exactly even on the coarsest level of mesh refinement. A higher regularity at the mesh interfaces can also be obtained by applying -refinement, which results in smoother basis functions compared to *fem and increases the accuracy of the solution accordingly . Another benefit of IGA is that it provides an elegant way to do geometric optimisation  and to handle uncertainties .

This work aims at using *iga to model and simulate a *pmsm. The stator and rotor models parts are inevitably resolved by multiple patches, which in turn necessitates the use of a domain decomposition approach across the air gap. We employ a classical iterative procedure based on a Dirichlet-to-Neumann map .

In the following section, we introduce the 2D model electric machine model and the *iga method used for its spatial discretisation. In section III, the iterative domain decomposition scheme is explained and, finally, in section IV, we show the results for the simulation of a *pmsm.

## Ii Solving Maxwell’s Equations for a *pmsm

### Ii-a Magnetostatics

In early design steps, it is sufficient to model electric machines by the 2D magnetostatic approximation of the Maxwell’s equations. Let (see Fig. 1) depict the computational domain. One has to solve the following Poisson equation

 (1)

where is the reluctivity, is the

-component of the magnetic vector potential,

is the source current density in the coils and is the current density according to the magnetisation of the permanent magnets. On , a Dirichlet boundary condition is applied and on and , an anti-periodic boundary condition holds. Fig. 1: One pole of the *pmsm. In red, the interface Γag between the rotor and the stator is highlighted.

Applying the loading method  on the solution of (1) gives us the spectrum of the *emf. The first harmonic is the *emf of the machines. The higher harmonics are used to calculate the *thd, which is defined as

 THD=√∑∞p=2|Ep|2|E1|, (2)

with the harmonic order and the *emf of order .

### Ii-B Discretisation in the Isogeometric Framework

For the discretisation of , a linear combination of basis functions is used, i.e.,

 Az=NDoF∑j=1ujwj, (3)

where are the unknowns and depicts the number of unknowns. Using the Ritz-Galerkin approach, a system of equations is obtained, i.e.,

 Kνu=jsrc+jpm, (4)

where has the entries

 kν,ij=∫Ω(ν∂wi∂x∂wj∂x+ν∂wi∂y∂wj∂y)dΩ, (5a) and the entries for the discretised current density are jsrc,i=∫ΩJzwidΩ, (5b) jpm,i=∫Ω→Hpm⋅(−∂wi∂y,∂wi∂x)dΩ. (5c)

The choice of the basis functions depends on the method one favours. The simplest case in the well established *fem is the use of linear hat functions . This paper proposes the use of the IGA framework to model the electrical machine. In this method, the basis functions are defined by *nurbs .

Let depict the degree of the basis functions and let

 Ξ=[ξ1…ξn+p+1] (6)

be a vector that partitions into elements, where . Then, the Cox-de Boor’s formula  defines B-spline basis functions with . B-splines of degree are shown in Fig. 2. *nurbs of degree are then constructed as

 Npi=ωiBpi∑jωjBpj, (7)

with a weighting parameter associated with the -th basis function. A *nurbs curve is obtained by the mapping

 F=n∑i=1PiNpi, (8)

with control points in and . From the curves, surfaces can be constructed by using tensor products , i.e.,

 Np1,p2ij=Np1iNp2j,i=1,…,n1,j=1,…,n2. (9)

The number of one-dimensional basis functions along direction and their degrees are depicted by and respectively. The mapping is now re-defined, namely , where is the reference square and is the physical domain. Due to the *nurbs mapping, the subdivisions constructed by the vectors are transformed to a physical mesh on .

Due to the complexity of the geometry, the cross section of the machine cannot be represented by a single map  . Multiple patches are constructed (Fig. 1), each one of them defined as the image of the unit square through a parametrization of the type (8) in such a way that and . Fig. 2: B-spline basis functions of degree 1 and 2 on an open, uniform knot vector Ξ=[0,0,0,\nicefrac13,\nicefrac23,1,1,1].

Using (7) and (8) enables an exact parametrization of e.g. circles and arcs. This implies that the geometry of the machine can be modelled exactly, which is particular beneficial in the air gap region. In *iga, the same set of basis functions (9) is also used to approximate the solution of (1). Hence, we can rewrite (3) as

 Az=NDoF∑j=1ujNj, (10)

where we have removed the indices , for simplicity. We will always assume the same polynomial degree in both directions.

This choice of basis functions guarantees a higher regularity of the solution across the elements. The continuity at the patch boundaries reverts to the *fem case since only continuity is imposed (see ).

## Iii Iterative Stator-Rotor Coupling

Since the rotor and the stator have a different topology, we parametrise them independently as multipatch *nurbs entities with non-conforming patches at the air gap interface . The idea is to follow a classical non-overlapping domain decomposition approach based on a Dirichlet-to-Neumann map (see e.g. ).

Let us consider the circular arc in the air gap and split the domain such that and (see Fig. 1). Given and an initialisation , we solve:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩−∇⋅(ν∇Ak+1z,rt)=Jz,Ak+1z,rt|Γd=0,Ak+1z,rt|Γl=−Ak+1z,rt|ΓrAk+1z,rt|Γag=λk (11)
 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩−∇⋅(ν∇Ak+1z,st)=Jz,Ak+1z,st|Γd=0,Ak+1z,st|Γl=−Ak+1z,st|Γrν∇Ak+1z,st|Γag⋅→nag=ν∇Ak+1z,rt|Γag⋅→n% ag, (12)

where is a unit vector perpendicular to the air gap interface. The two problems are solved iteratively with the update

 λk+1=αAk+1z,st+(1−α)λk, (13)

where is a relaxation parameter (in general, the method is not ensured to converge if  ).

As a stopping criterion for the method, the error between two successive iterations is required to be below a specified tolerance both in the rotor and the stator, i.e.,

 εrt=∥∥Ak+1z,rt−Akz,rt∥∥L2(Ωrt)/∥∥Ak+1z,rt∥∥L2(Ωrt)

The discretisation of problems (11)-(12) is straightforward in the *iga framework presented above.

## Iv Results

For testing the suitability of *iga for machine simulation, we first consider the domain and we solve a test problem with homogeneous Dirichlet boundary conditions on and anti-periodic boundary conditions connecting and . The only source present in the model is the magnetisation of the permanent magnets. The *iga solution for the magnetic vector potential is compared to the one obtained using a fine *fem discretisation with first order elements. We solve *iga basis functions of degree and and for an increasing mesh refinement, and we depict the difference to the *fem solution in in Fig. 3. For both discretisation degrees, the curves approach a fixed value, which is expected since the *iga method is solving the problem for the exact geometry in contrast to *fem which introduces an additional geometrical error related to the triangulation of the geometry.

Secondly, the full problem is considered, incorporating the Dirichlet-to-Neumann coupling between stator and rotor introduced in the previous section. In Fig. 4, the convergence of the algorithm is shown for a simulation with degree

, with approximately 3200 total degrees of freedom. After 29 iterations, both solutions show an incremental error below the prescribed tolerance

. Fig. 3: Poisson problem for the magnetic vector potential on Ωrt: L2 error between the *iga solution and a fine *fem solution for increasing mesh refinement. Fig. 4: Convergence of the Dirichlet-to-Neumann coupling for the *pmsm. Relative difference in L2 norm for the magnetic vector potential between successive iterations on Ωrt (in blue) and Ωst (in orange).

The simulation results are shown in Fig. 5, where the flux lines in the machine are shown. In the post-processing the spectrum of the *emf has been calculated. In Fig. 6, the first modes of the spectrum of the *emf of the machine are shown. Both methods result in similar spectra. This is also depicted in Tab. I, where it is shown that the relative difference of the *thd is below . Fig. 5: The distribution of the flux lines obtained by modelling with *fem. Fig. 6: Spectrum with the first 32 modes of the *emf of the machine.

## V Conclusions

Isogeometric Analysis (IGA) recently emerged as a promising alternative to the Finite Element Method (FEM) for highly accurate electromagnetic field simulation. IGA is capable of exactly resolving circles and, hence, avoids any geometric approximations errors in contrast to FEM, which is of particular importance in the air gap region. Our IGA model for a permanent magnet synchronous machine consists of two separate multipatch IGA discretisations for stator and rotor, glued together with a Dirichlet-to-Neumann map in the air gap. IGA (degree 2) attains the prescribed accuracy with a number of degrees of freedom which is substantially smaller ( 20 times) than for lowest order FEM. Therefore, IGA is a valuable extension to an engineer’s simulation toolbox, especially when fast and accurate machine simulation tasks are due.

## Acknowledgment

This work is supported by the German BMBF in the context of the SIMUROM project (grant nr. 05M2013), by the DFG (grant nr. SCHO1562/3-1) and by the ’Excellence Initiative’ of the German Federal and State Governments and the Graduate School of CE at TU Darmstadt.

## References

•  D. Howe and Z.Q. Zhu, “The influence of finite element discretisation on the prediction of cogging torque in permanent magnet excited motors”, IEEE Trans. Magn., vol. 28, no.2, pp. 1080–1083, 1992.
•  I. Tsukerman, “Accurate computation of ‘ripple solutions’ on moving finite element meshes”, IEEE Trans. Magn., vol. 31, no. 3, pp. 1472–1475, 1995.
•  T. Tärnhuvud and K. Reichert, “Accuracy problems of force and torque calculation in FE-systems”, IEEE Trans. Magn., vol. 24, no. 1, pp. 443–446, 1988.
•  T. J. R. Hughes, J.A. Cottrell and Y. Bazilevs, “Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement”, Comput. Meth. Appl. Mech. Eng., vol. 194, pp. 4135–4195, 2005.
•  J. A. Evans, Y. Bazilevs, I. Babuška and T. J. R. Hughes,“n-Widths, sup-infs, and optimality ratios for the k-version of the isogeometric finite element method”, Comput. Meth. Appl. Mech. Eng., vol. 198, no. 21–26, pp. 1726–1741, 2009.
•  A. Pels, Z. Bontinck, J. Corno, H. De Gersem and S. Schöps, “Optimization of a Stern-Gerlach Magnet by magnetic field-circuit coupling and isogeometric analysis,” IEEE Trans. Magn., vol. 51, no. 12, pp. 1–7, 2015.
•  J. Corno, C. de Falco, H. De Gersem and S. Schöps,“Isogeometric Analysis simulation of TESLA cavities under uncertainty,” Electromagnetics in Advanced Applications (ICEAA), 2015 International Conference on. IEEE, 2015.
• 

A. Quarteroni and A. Valli, “Domain decomposition methods for partial differential equations”, Oxford University Press, 1999.

•  M.A. Rahman and P. Zhou, “Determination of saturated parameters of PM motors using loading magnetic fields,” IEEE Trans. Magn., vol. 27, no. 5, pp. 3947–3950, 1991.
•  S.J. Salon, Finite element analysis of electrical machines, Boston USA: Kluwer academic publishers, 1995.
•  L. Piegl and W. Tiller. “The NURBS book”, Monographs in Visual Communication, 1997.
•  J.A. Cottrell, T.J.R. Hughes and Y. Bazilevs, “Isogeometric Analysis: Toward integration of CAD and FEA”, John Wiley & Sons, Ltd, 2009.