Professional Documents
Culture Documents
Finite Element Modelling With Transformation Techniques: Abstruct
Finite Element Modelling With Transformation Techniques: Abstruct
3, MAY 1999
Abstruct- Transformation methods are a very powerful tool mapping & e j at least is always present. Working with trans-
in finite element modelling. In many cases, an adequate map- formation methods means nothing more than combining it with
ping transforms the problem into an easier one or allows to take one or several other changes of coordinates.
advantage of the symmetries. This paper demonstrates that any For an automatic consideration of any transformation, the
mapping can be handled automatically provided the classical vec- expressions of the finite element densities must be formally
tor analysis approach is given up for the benefit of a differential identical whatever the coordinate system. Classical vector
geometry approach. As a first example, it is shown that axisym-
metrical problems need no more a particular treatment provided analysis fails to give such expressions because it assumes or-
the mapping of the cylindrical coordinates on the Cartesian ones thonormal coordinates only and ignores then the geometrical
is considered as it is. Furthermore, a novel axisymmetrical for- notions of metric and volume form which happen to be trivial
mulation is proposed which relies on one further transformation in that particular case. In order to get coordinate independent
and improves considerably the quality of the interpolated field. expressions, it is necessary to work with true coordinate sys-
Transformation methods are also of great help to model the in- tems (which are not always orthonormal) and to consider the
finite space by means of finite elements. Many authors have pre- geometrical notions of metric and volumeform. Those dif-
sented such transformationswhich are often instances of the same ferential geometry notions are intrinsic, i.e. peculiar to each
general shell transformationthat is presentedhere. coordinate system (while the Jacobian matrix is rather a kind
Index terms- Ikansforms, differential geometry, TEAM of bridge between two coordinates systems), and the densities
Workshop problem 11, object oriented programming, software expressed in terms of them are therefore automatically coordi-
desigddevelopment,Interpolation. nate independent.
'Research Associate with the Belgian National Fund for Scientific Re- where the map 4* : F ( N ) ++ F ( M ) is called the dual map of
search.
This text presents research results of the Belgian programme on Interuniver-
4. It is known if 4 is known as one will see further on.
sity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, If the coordinates {XI, I = 1 , 2 , 3 } are defined on N and
Science Policy Programming. the coordinates { d ,j = 1 , 2 , 3 } on M , the mapping 4 and its
jacobian matrix A$ are defined by where NA are the coordinates of the N nodes of the finite ele-
ment and sa the corresponding nodal shapes functions.
X' = X ' ( u j )
ax'
= -(U'). Fundamentally, the principle of a transformation technique
auj
(3)
" _ is to map the shape functions, which are simple polynomials in
Erej,onto interpolation functions in E that are not necessarily
The inv 9 of Ai is noted A;.
*=f- polynomials in order to fit better the interpolated field in that
space. One or several intermediary mappings (two in Fig. 1)
111. METRICMATRIX can be defined for that purpose giving rise to one or several
The metric matrix is a 3x3 symmetric matrix. It is noted with intermediary spaces : E', E'', . . .
two lower indices, gij. In an euclidean space E the metric is The following tables give the rules to map the fields and the
the unity matrix 91J = 61J . In any system of coordinates, the rules to compute finite element densities that are the product of
components of the metric matrix are computed thanks to the two fields, say q and E, and a physical characteristic function
jacobian matrix of the mapping from the euclidean s ace E p. This is enough for most of the EE. densities encountered in
P
onto that system of coordinates by the relation gij = Ai91JA; a wide variety of formulations.
where the implicit summation on repeated indices, one upper
and one lower, is assumed as it will be throughout the paper. TABLE I
MAPPING OF THE DIFFERENT KIND OF FIELDS
Its determinantis the square of the determinant of the Jacobian
matrix: d e t ( g i j ) E g = A2 3 (det(Ai))2.The inverse of the
metric matrix is noted with two upper indices and is given by F ( N ) c) F ( M ) F ( M ) t)F ( N )
gij = A ~ , ~ I J A $ . F' ($*w)= w ($-*w)= w
F1 (4*w)i = A ~ W I (+-*w)I = Aiwi
IV. MULTIPLEMAPPINGS
F2 ( 4 * ~=) f~i l l f w ' (4-*w)'= A f w i / f i
F3 (4*w) = &w (4-*w) = wldz
The mapping can be the combination of several succes-
sive mappings (Fig. 1). Thanks to the chain rule of partial
derivatives, it is clear that, if the jacobian matrices of the in-
dividual mappings are given, the resultant jacobian matrix is TABLE I1
simply their matrix product : COORDINATE INDEPENDENT EXPRESSIONS FOR THE MOST
COMMON FINITE ELEMENT DENSITIES
(4)
Aj'(yj) = ( cos0 0 - r s i n 8
0 1 0
sin8 0 r c o s 8
) (7) 1.4
1.2
(bx,b y , b z ) = @1E
&-
(br,b",be) = ( A - L?&! -
- &LZ &.L
&a5.a',cx&c ay
- @EX) ,
fl
0.02 0.04 0.06 0.08 0.1
a%1 r[ml
4
az ae 7 ae ar ar
9
(8) 2
The axial symmetry implies that nothing depends on 8, the
model can be restricted to the plane 0 = 0. In that case, the 1.6
vector potential reduces to its &-component ug(r, z ) ,the jaco-
bian matrix of 4' is d i a g ( l , l , r ) and its determinant equals r . - 1.2
If a linear interpolation = cr + d is used, the z-component 3
of the induction is bz = -c by (8) and its Y-component is k
m 0.8
b y = - c / & as seen in Table 11. Since g = r2 in the coordi-
nates {X'}, it involves a r-l term that causes a terrible jagged 0.4
pattern for the induction field (Fig. 2).
To avoid it, the solution is to make one more change of 0
0 0.02 0.04 0.06 0.08 0.1
coordinate in order to use p = r2 instead of r as the radial 3ml
coordinate. The mappings & f , 4' and qS', expressed with
{X' = X,Y, Z}, { y j = p , z , 0 } and {xi = r,z,t9} are then Fig. 2. By(t=l, 2, 5, 10, 20ms) along X-axis (above) and Y-axis
given by (9) with Ng = ( N k ) 2 .The jacobian matrix of @$"is (below) with the classical axisymmetric formulation.
diag(l/2JiZ, 1,fi)and g = 1/4 is a constant in E'. A linear
interpolation ag = cp + d gives now a constant induction field
by = -2c. This is exactly the gentle property one has in the
planar case.
(9)
Z = xsin8
B. Shell transformation
1.6
1.2 1
0.8
In electromagnetism, the boundary conditions must be im-
posed at the infinity and many transformation methods have 0.4
been proposed to model the infinite space by means of finite el-
ements. Very often, the transformations proposed are instances n
of the general shell transformation given by
(X' - C') = ( y j - Cj)dj'F(A,B,r(yj)), (10) Fig. 3. By(t=l, 2, 5, 10, 20ms) along X-axis (above) and Y-axis
(below) with the modified axisymmetric formulation.
1437
-=-e-
dF F e=- B - 2r (12)
for nontransformedelements, the accuracy of the transformed
dr r P@ - r ) elements is related to the quality of the discretisation. The in-
ductances computed withthis technique have shown a good
with {X‘ = X, Y ,2 ) and { y j = z, y, z } , C’ the fixed point agreement with measurements.
of the transformation (C’= CjSj’), A and B the inner and The metric matrix components tends towards infinity on the
outer “radius” of the shell. outer boundary of the shell. This requires some nunmica1 pre-
This transformation a plies to cylindrical shells, paralelipi-
R
pedic shells along the kt direction and to spherical shells with cautions to avoid floating point operation errors, especially for
the visualization of the computed fields. An other solution is
respectively to impose that the image of the outer boundary of the shell is
at a finite distance : F ( A ,B , r = B ) *+L< 00. The relations
r(yj) = J(z - C”)2 + (y - cq2, (1 1) and (12) remain true with the simple substitution
T(YJ.1 = (Yk - c”,
r(yJ) = J(. - C”)2 + (y - cq2 + ( z - cq2.
REFERENCES
[l] D.A. Lowther, E.M. Freeman, B. Forghani, “A sparse matrix open bound-
ary method for finite element analysis,” IEEE Transactions on Magnetics,
vol. 25, NO.4, pp. p 2810-2812, 1989.
[2] J.F. Imhoff, G. Meunier, X. Brunotte, J.C. Sabonnadibre, “An original so-
lution for unbounded electromagnetic 2D- and 3D- problems throughout
the finite element method” IEEE Transactions on Magnetics, vol. 26, No.
5, pp. p 1629-1661, 1990.
[3] F. Henrotte, B. Meys, A. Genon, W. Legros, “An Object Oriented Decom-
position of the F.E. procedure,” IEEE Trunsucrions on Magnetics, vol. 32,
NO. 3, pp. 1441-1444, 1996.
[4] F. Henrotte, H. Hedia, et al., “A new method for axisymmetrical linear
Fig. 4. Field lines with a cylindrical and a rectangular shell. and non linear problems,” IEEE Trunsactions on Magnetics. vol. 29, No.
2, pp. 1352-1355, 1993.
[5] J.B.M. Melissen, J. Simkin, “A new coordinate transform for the finite
Fig. 4 shows the field lines obtained with a cylindrical and element solution of axisymmetricd problems in Magnetostatics” 1EE.E
Transactions on Magnetics, vol. 26, No.2. PP. p 391-394, 1990.
a rectangular shell for an axisymmetric coil. ~~~~~l~as it is