Basic structured grid generation with an introduction to unstructured grid generation 1st Edition M Farrashkhalvat download
Basic structured grid generation with an introduction to unstructured grid generation 1st Edition M Farrashkhalvat download
https://ebookname.com/product/basic-structured-grid-generation-
with-an-introduction-to-unstructured-grid-generation-1st-edition-
m-farrashkhalvat/
https://ebookname.com/product/introduction-to-power-generation-
technologies-1st-edition-andreas-poullikkas/
https://ebookname.com/product/smart-grid-security-innovative-
solutions-for-a-modernized-grid-1st-edition-florian-skopik/
https://ebookname.com/product/grid-resource-management-toward-
virtual-and-services-compliant-grid-computing-1st-edition-
frederic-magoules/
https://ebookname.com/product/passing-it-on-a-memoir-2007-3rd-
printing-edition-yuri-nakahara-kochiyama/
Designing Online Learning with Flash 1st Edition David
Richard Moore
https://ebookname.com/product/designing-online-learning-with-
flash-1st-edition-david-richard-moore/
https://ebookname.com/product/three-cities-after-hitler-
redemptive-reconstruction-across-cold-war-borders-1st-edition-
demshuk/
https://ebookname.com/product/eu-shipping-law-3rd-edition-
vincent-power/
https://ebookname.com/product/relational-database-index-design-
and-the-optimizers-db2-oracle-sql-server-et-al-1st-edition-tapio-
lahdenmaki/
Electrical Conduction in Graphene and Nanotubes 1st
Edition Fujita
https://ebookname.com/product/electrical-conduction-in-graphene-
and-nanotubes-1st-edition-fujita/
Basic Structured Grid Generation
with an introduction to unstructured grid generation
Basic Structured Grid
Generation
with an introduction to unstructured
grid generation
Copyright
c 2003, M. Farrashkhalvat and J.P. Miles. All rights reserved
Preface ix
Bibliography 227
Index 229
Preface
Over the past two decades, efficient methods of grid generation, together with the
power of modern digital computers, have been the key to the development of numer-
ical finite-difference (as well as finite-volume and finite-element) solutions of linear
and non-linear partial differential equations in regions with boundaries of complex
shape. Although much of this development has been directed toward fluid mechanics
problems, the techniques are equally applicable to other fields of physics and engi-
neering where field solutions are important. Structured grid generation is, broadly
speaking, concerned with the construction of co-ordinate systems which provide co-
ordinate curves (in two dimensions) and co-ordinate surfaces (in three dimensions)
that remain coincident with the boundaries of the solution domain in a given problem.
Grid points then arise in the interior of the solution domain at the intersection of these
curves or surfaces, the grid cells, lying between pairs of intersecting adjacent curves
or surfaces, being generally four-sided figures in two dimensions and small volumes
with six curved faces in three dimensions.
It is very helpful to have a good grasp of the underlying mathematics, which is
principally to be found in the areas of differential geometry (of what is now a fairly
old-fashioned variety) and tensor analysis. We have tried to present a reasonably self-
contained account of what is required from these subjects in Chapters 1 to 3. It is
hoped that these chapters may also serve as a helpful source of background reference
equations.
The following two chapters contain an introduction to the basic techniques (mainly
in two dimensions) of structured grid generation, involving algebraic methods and dif-
ferential models. Again, in an attempt to be reasonably inclusive, we have given a
brief account of the most commonly-used numerical analysis techniques for interpo-
lation and for solving algebraic equations. The differential models considered cover
elliptic and hyperbolic partial differential equations, with particular reference to the
use of forcing functions for the control of grid-density in the solution domain. For
solution domains with complex geometries, various techniques are used in practice,
including the multi-block method, in which a complex solution domain is split up
into simpler sub-domains. Grids may then be generated in each sub-domain (using the
sort of methods we have presented), and a matching routine, which reassembles the
sub-domains and matches the individual grids at the boundaries of the sub-domains, is
used. We show a simple matching routine at the end of Chapter 5.
A number of variational approaches (preceded by a short introduction to variational
methods in general) are presented in Chapter 6, showing how grid properties such
x Preface
J.P. Miles
1
Mathematical
preliminaries – vector and tensor
analysis
1.1 Introduction
In this chapter we review the fundamental results of vector and tensor calculus which
form the basis of the mathematics of structured grid generation. We do not feel it
necessary to give derivations of these results from the perspective of modern dif-
ferential geometry; the derivations provided here are intended to be appropriate to
the background of most engineers working in the area of grid generation. Helpful
introductions to tensor calculus may be found in Kay (1988), Kreyzig (1968), and
Spain (1953), as well as many books on continuum mechanics, such as Aris (1962).
Nevertheless, we have tried to make this chapter reasonably self-contained. Some of
the essential results were presented by the authors in Farrashkhalvat and Miles (1990);
this book started at an elementary level, and had the restricted aim, compared with
many of the more wide-ranging books on tensor calculus, of showing how to use
tensor methods to transform partial differential equations of physics and engineer-
ing from one co-ordinate system to another (an aim which remains relevant in the
present context). There are some minor differences in notation between the present
book and Farrashkhalvat and Miles (1990).
The position vector r of a point P in space with respect to some origin O may be
expressed as
r = y1 i1 + y2 i2 + y3 i3 , (1.1)
where {i1 , i2 , i3 }, alternatively written as {i, j, k}, are unit vectors in the direction of the
rectangular cartesian axes. We assume that there is an invertible relationship between
this background set of cartesian co-ordinates and the set of curvilinear co-ordinates, i.e.
yi = yi (x 1 , x 2 , x 3 ), i = 1, 2, 3, (1.2)
x i = x i (y1 , y2 , y3 ), i = 1, 2, 3. (1.3)
We also assume that these relationships are differentiable. Differentiating eqn (1.1)
with respect to x i gives the set of covariant base vectors
∂r
gi = , i = 1, 2, 3, (1.4)
∂x i
with background cartesian components
∂yj
(gi )j = , j = 1, 2, 3. (1.5)
∂x i
At any point P each of these vectors is tangential to a co-ordinate curve passing
through P, i.e. a curve on which one of the x i s varies while the other two remain
constant (Fig. 1.1). In general the gi s are neither unit vectors nor orthogonal to each
other. But so that they may constitute a set of basis vectors for vectors in E 3 we demand
that they are not co-planar, which is equivalent to requiring that the scalar triple product
{g1 · (g2 × g3 )} = 0. Furthermore, this condition is equivalent to the requirement that
the Jacobian of the transformation (1.2), i.e. the determinant of the matrix of partial
derivatives (∂yi /∂x j ), is non-zero; this condition guarantees the existence of the inverse
relationship (1.3).
x 3 varies
g2
y3 g3 x 2 varies
P
g1
x1 varies
i3
i2 y2
O
i1
y1
Given the set {g1 , g2 , g3 } we can form the set of contravariant base vectors at P,
{g1 , g2 , g3 }, defined by the set of scalar product identities
gi · gj = δji (1.6)
Exercise 1. Deduce from the definitions (1.6) that the gi s may be expressed in terms
of vector products as
g2 × g3 g3 × g1 g1 × g2
g1 = , g2 = , g3 = (1.8)
V V V
where V = {g1 · (g2 × g3 )}. (Note that V represents the volume of a parallelepiped
(Fig. 1.2) with sides g1 , g2 , g3 .)
The fact that g1 is perpendicular to g2 and g3 , which are tangential to the co-ordinate
curves on which x 2 and x 3 , respectively, vary, implies that g1 must be perpendicular
to the plane which contains these tangential directions; this is just the tangent plane to
the co-ordinate surface at P on which x 1 is constant. Thus gi must be normal to the
co-ordinate surface x i = constant.
Comparison between eqn (1.6), with the scalar product expressed in terms of carte-
sian components, and the chain rule
∂x i ∂y1 ∂x i ∂y2 ∂x i ∂y3 ∂x i ∂yk ∂x i
+ + = = = δji (1.9)
∂y1 ∂x j ∂y2 ∂x j ∂y3 ∂x j ∂yk ∂x j ∂x j
for partial derivatives shows that the background cartesian components of gi are
given by
∂x i
(gi )j = , j = 1, 2, 3. (1.10)
∂yj
In eqn (1.9) we have made use of the summation convention, by which repeated
indices in an expression are automatically assumed to be summed over their range
g2
g3
V
g1
g23 = g32 = xη xς + yη yς + zη zς
g31 = g13 = xς xξ + yς yξ + zς zξ
∂x
where a typical partial derivative ∂ξ has been written as xξ , and the superscript 2 now
represents squaring.
and Lij =
∂yj ∂x i
i , Mij = ∂yj ; it may be seen directly from eqn (1.6) that
∂x
LM T = I, (1.23)
where I is the 3 × 3 identity matrix. Thus L and M T are mutual inverses. Moreover
It is easy to see that the symmetric matrix arrays (gij ) and (g ij ) for the associated
metric tensors are now given by
and
√
V = {g1 · (g2 × g3 )} = g, (1.31)
The cofactors of the matrix L in eqn (1.22) are the various background carte-
sian components of (gj × gk ), which may be expressed, with the notation used in
eqn (1.18), as
α1 = yη zς − yς zη , α2 = xς zη − xη zς , α3 = xη yς − xς yη
β1 = yς zξ − yξ zς , β2 = xξ zς − xς zξ , β3 = xς yξ − xξ yς (1.35)
γ1 = yξ zη − yη zξ , γ2 = xη zξ − xξ zη , γ3 = xξ yη − xη yξ
so that
g2 × g3 = α1 i + α2 j + α3 k, g3 × g1 = β1 i + β2 j + β3 k, g1 × g2 = γ1 i + γ2 j + γ3 k
(1.36)
and
1 1 1
g1 = √ (α 1 i+α2 j+α3 k), g2 = √ (β1 i+β2 j+β3 k), g3 = √ (γ1 i+γ2 j+γ3 k).
g g g
(1.37)
Since M = L−1 , we also have, in the same notation, the matrix elements of M:
√ √ √
ξx = α1 / g, ξy = α2 / g, ξz = α3 / g
√ √ √
ηx = β1 / g, ηy = β2 / g, ηz = β3 / g (1.38)
√ √ √
ςx = γ1 / g, ςy = γ2 / g, ςz = γ3 / g.
Exercise 3. Using eqn (1.29) and standard determinant expansions, derive the follow-
ing formulas for the determinant g:
g = g11 G1 + g12 G4 + g13 G5 = (α1 xξ + β1 xη + γ1 xς )2
= g22 G2 + g12 G4 + g23 G6 = (α2 yξ + β2 yη + γ2 yς )2 (1.39)
= g33 G3 + g13 G5 + g23 G6 = (α3 zξ + β3 zη + γ3 zς )2 .
using eqn (1.34), where i, j, k must be taken in cyclic order 1, 2, 3, and again there is
no summation over j and k.
The parallelepiped generated by line-elements g1 dx 1 , g2 dx 2 , g3 dx 3 , along the co-
ordinate curves has infinitesimal volume
dV = g1 dx 1 · (g2 dx 2 × g3 dx 3 ) = {g1 · (g2 × g3 )}dx 1 dx 2 dx 3 .
By eqn (1.31) we have
√
dV = g dx 1 dx 2 dx 3 . (1.45)
Hence
ui = u · gi , (1.48)
and, similarly,
ui = u · gi . (1.49)
A similar procedure shows, incidentally, that
gi = gij gj , (1.50)
and
gi = g ij gj . (1.51)
We then easily deduce that
ui = g ij uj (1.52)
and
ui = gij uj . (1.53)
Exercise 4. Show that if we define the matrix B as that whose i-j element is equal to
∂x j /∂x i , then
AB T = I (1.60)
and
det B = J −1 . (1.61)
We obtain new covariant base vectors, which transform according to the rule
∂r ∂r ∂x j ∂x j
gi = = = gj , (1.62)
∂x i ∂x j ∂x i ∂x i
with the inverse relationship
∂x j
gi = g . (1.63)
∂x i j
In background cartesian components, eqn (1.62) may be written in matrix form as
L = BL, (1.64)
where L is the matrix with i-j component given by ∂yj /∂x i , and from eqn (1.23) and
eqn (1.60) we deduce that
M = AM, (1.65)
g = (det L)2 .
√ √
Hence det L = g, det L = g, and det L = det B det L = J −1 det L from
eqn (1.64). Thus we have
g
J = . (1.67)
g
Equation (1.65) yields the relation between corresponding contravariant base vectors:
∂x i j
gi = g . (1.68)
∂x j
Expressing u as a linear combination of the base vectors in the new system gives
u = ui gi = ui gi . (1.69)
We now easily obtain, using eqn (1.62), the transformation rule for the covariant
components of a vector:
j
∂x ∂x j ∂x j
ui = u·gi = u· gj = u · gj = uj , (1.70)
∂x i ∂x i ∂x i
Mathematical preliminaries – vector and tensor analysis 11
Note the important consequence that the scalar product (1.54) is an invariant quantity
(a true scalar), since it is unaffected by co-ordinate transformations. In fact
k i k
∂x i j ∂x ∂x ∂x
u vi =
i
u v =
i k
uj vk = δjk uj vk = uj vj .
∂x j ∂x ∂x j
∂x i
From eqns (1.64), (1.65), and (1.66), we obtain the transformation rules:
T
(g ij ) = L L = BLLT B T = B(gij )B T , (1.74)
T
(g ij ) = M M = AMM T AT = A(g ij )AT . (1.75)
In fact gij is a particular case of a covariant tensor of order two, which may be
defined here as a set of quantities which take the values Tij , say, when the curvilinear
co-ordinates x i are chosen and the values T ij when a different set x i are chosen, with a
transformation rule between the two sets of values being given in co-ordinate form by
∂x k ∂x l
T ij = Tkl (1.76)
∂x i ∂x j
with summation over k and l, or in matrix form
T = BT B T . (1.77)
ij ∂x i ∂x j kl
T = T (1.78)
∂x k ∂x l
12 Basic Structured Grid Generation
or, equivalently,
T = ATAT . (1.79)
.j j
We can also define mixed second-order tensors Ti and T.i , for which the transfor-
mation rules are
.j ∂x k ∂x j .l
Ti = Tk (1.80)
∂x i ∂x l
T = BTAT , (1.81)
and
i ∂x i ∂x l k
T ..j = T (1.82)
∂x k ∂x j .l
T = ATBT . (1.83)
Exercise 6. Show from the transformation rules (1.80) and (1.82) that the quantities
T.kk and Tk.k are invariants.
Given two vectors u and v, second-order tensors can be generated by taking products
of covariant or contravariant vector components, giving the covariant tensor ui vj , the
contravariant tensors ui v j , and the mixed tensors ui vj and ui v j . In this case these
tensors are said to be associated, since they are all derived from an entity which
can be written in absolute, co-ordinate-free, terms, as u ⊗ v; this is called the dyadic
product of u and v. The dyadic product may also be regarded as a linear operator
which acts on vectors w according to the rule
(u ⊗ v)w = u(v · w), (1.84)
an equation which has various co-ordinate representations, such as
u ⊗ v = ui vj gi ⊗ gj = ui v j gi ⊗ gj = ui vj gi ⊗ gj = ui v j gi ⊗ gj (1.85)
with summation over i and j in each case.
.j
In general, covariant, contravariant, and mixed components Tij , T ij , Ti , T.ji , are
associated if there exists an entity T, a linear operator which can operate on vectors,
such that
..j
T = Tij gi ⊗ gj = T ij gi ⊗ gj = Ti gi ⊗ gj = T..j
i
gi ⊗ gj . (1.86)
Thus the action of T on a vector u could be represented typically by
vi = Tij uj .
Mathematical preliminaries – vector and tensor analysis 13
The Kronecker symbol δji has corresponding matrix elements given by the 3 × 3
identity matrix I . It may be interpreted as a second-order mixed tensor, where which-
ever of the covariant or contravariant components occurs first is immaterial, since if we
substitute T = I in either of the transformation rules (1.81) or (1.83) we obtain T = I
in view of eqn (1.60). Thus δji is a mixed tensor which has the same components on any
co-ordinate system. The corresponding linear operator is just the identity operator I,
which for any vector u satisfies
Iu = (δji gi ⊗ gj )u = δji gi uj = gi ui = u.
The following representations of I may then be deduced:
I = gij gi ⊗ gj = g ij gi ⊗ gj = gj ⊗ gj = gj ⊗ gj . (1.87)
are required, for example, when forming correct vector expressions in curvilinear co-
ordinate systems.
In particular, the vector product of two vectors u and v is given by
u × v = εijk uj vk gi = εijk uj v k gi , (1.94)
with summation over i, j, k. The component forms of the scalar triple product of
vectors u, v, w are
u · (v × w) = εijk ui vj wk = εijk ui v j wk . (1.95)
The alternating symbols themselves may be called relative (rather than absolute) ten-
sors, which means that when the tensor transformation law is applied as in eqns (1.90)
and (1.91) a power of J (the weight of the relative tensor) appears on the right-hand
side. Thus according to (1.90) eijk is a relative tensor of weight −1, while according
to eqn (1.91) eijk (although it takes exactly the same values as eijk ) is a relative tensor
of weight 1.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookname.com