LTNT - ETH Zurich

1
Exercises Problem: Cooling of a coil (Tutorial ANSYS)
Creating and using a solid domain as a
heater coil inANSYS CFX-Pre.
Modeling conjugate heat transfer in
ANSYS CFX-Pre.
Specifying a subdomain to specify a
heat source.
Creating a cylinder locator using CEL
inANSYS CFX-Post.
Examining the temperature distribution
which is affected by heat transfer from
the coil to the fluid.
LTNT - ETH Zurich
2
- finish tutorial conjugate heat transfer)
and compute average temperature on outlet
- specify a point on outlet boundary and
monitor temperature in the point during
solution as function of iteration number;
compute average temperature on outlet
after temperature in this point levels
- run previous test for laminar flow
conditions and compute average
temperature on outlet
Report: contour plots from the tutorial, average temperature on outlet
Homework (due 13th April)
Problem 1
LTNT - ETH Zurich
3
Run the transient simulation for 20 s. You can set the maximumcoefficient loops to 3
under solver controlto obtain a faster simulation. At the last time step:
1) Make a contour plot of temperature at the outlet with the range option set to local.
Print a jpeg of this contour plot.
2) Create a YX plane at x=0 min the solid domain only, and plot temperature with the
range option set to local.
Problem 2. Cooling steel blade in water stream (use domain from
previous Homework, in cm)
The solid domain should have an energy
source of 5.0E+8 Watts/m^3. The initial
temperature of the solid domain is 550 K
The flow in the fluid domain should have a
Reynolds number of 1000. The temperature
of water at the inlet is 300 K. (Use
expressions to define inlet velocity
dependent on Reynolds number. Let CFX
calculate it for you instead of you calculate it
by hand.)
Complete following for Laminar and k- turbulent simulations
LTNT - ETH Zurich
4
Problem 3
Re-run turbulent simulations for problem 2, implementing TURBULENT heat
conductivity of water:
a) Create new variable turbulent dynamic viscosity and define it as the function
of turbulent kinetic energy and dissipation rate (browse HELP and textbooks
for the correct function , do not ask TA)
b) Define turbulent heat conductivity based on Pr = Pr*, where Prandtl number Pr
= (turbulent kinematic viscosity)/(turbulent diffusivity) and Pr* is arbitrary value
of your choice 0.75<Pr*<0.89 (browse HELP and textbooks for definition of Pr
number, do not ask TA)
Comment : wherever you need density as a part of definition of the variables, you should enter it directly as the number
For all problems, submit .cfx and .res and .cst files
Grading : 1- C, 1+2 - B, 1+2+3 - A
LTNT - ETH Zurich
5
Example of quiz questions (not part of homework)
Answer following question browsing CFX Help:
Write down all equations which ANSYS uses to compute the value of k
and the value of on inlet in case if default boundary conditions are
chosen for standard k- turbulence model.
What does ANSYS use in these formulas as velocity if Pressure boundary
conditions are set on the inlet?
LTNT - ETH Zurich
6
Numerical methods for PDE
An analytical solution to a partial differential equation gives us the value
of as a functionof the independent variables (x,y,z,t).
The numerical solution aims to provide with values of at a discrete
number of points in the domain.
The process of converting our governing transport equation into a set of
equations for the discrete values of is called the discretization process
and the specific methods employed to bring about this conversion are
calleddiscretization methods.
The discrete values of f are typically described by algebraic equations
relatingthe values at grid points to each other.
The development of numerical methods focuses on both the derivation
of the discrete set of algebraic equations, as well as a method for their
solution.
LTNT - ETH Zurich
7
When the number of grid points is small, the departure of the
discrete solution fromthe exact solution is expectedto be large.
No matter what discretization method is employed, all well-behaved
discretization methods should tend to the exact solution when a
large enoughnumber of grid points is employed.
Numerical methods for PDE (cont.)
A numerical solution has to be followed by the analysis of sensitivity to the
number of grid points: i.e. the calculations have to be repeated using a fine
grid to insure that the values of parameters in question remain unchanged
within a chosen accuracy.
LTNT - ETH Zurich
8
Mesh terminology and mesh types
2D structured mesh: every
interior vertex in the domain is
connected to the same
number of neighbor vertices.
Note: a face in 3D mesh is 2D
entity
Numerical methods which store their primary unknowns at the node or
vertex locations are called node-based or vertex-based schemes.
Those which store themat the cell centroid, or associate themwith the
cell, are called cell-based schemes. Finite element methods are
typically node-based schemes, and many finite volume methods are
cell-based.
Hybrid: structured/unstructured
mesh
LTNT - ETH Zurich
9
Finite Difference Methods (FDM)
1D scalar steady-state
transport equation with
source term
Taylor expansions in grid
points:
Finite difference equation Subtraction gives
LTNT - ETH Zurich
10
Finite Element Methods (FEM)
Example: the Galerkin method for 1D transport equation
aims at finding an approximation of function
The approximation does not satisfy the original
equation but a new equation
Residual function R equals zero in average
The weight functions W
i
are typically local in that they are non-zero
over element i, but are zero everywhere else in the domain. Further,
is assumed to be a piece-wise linear profile (shape function) between
points 1 and 2 and between points 2and 3. The Galerkin finite element
method requires that the weight and shape functions be the same. The
integrationresults in a set of algebraic equations in the nodal values
LTNT - ETH Zurich
11
Finite Volume Methods (FVM)
Integrating over cell with cell centroid P results in heat balance equation
Assuming that varies linearly between the cell centroids, we can write:
where S is average over cell P
LTNT - ETH Zurich
12
Finite Volume Methods (FVM) cont.
Equation
can be re-written as
1. The conservationis guaranteedfor eachcell, regardless of meshsize.
2. Conservation does not guarantee accuracy: the solution may be
inaccurate, but conservative.
3. The quantity
e/w
are diffusion fluxes on the faces. The cell balance is
written in terms of face fluxes. The gradient of must therefore be
evaluatedat the faces of the cell.
LTNT - ETH Zurich
13
Solution of Discretization Equations
Direct Methods:
A is matrix of coefficients,
B is source term vector
Direct methods almost never employed in CFD tools: prohibitively high number of
operations, non-linearity of matrix A
Iterative Methods:
1. Guess the discrete values of at all grid points in the domain
2. Visit each grid point and update using
3. Check if an appropriate convergence criterion is met (e.g. the maximum
change in the grid-point values of f be less than 0.1%) otherwise repeat
step 2.
Iterative methods converge only if additional criteria met: