Chapter 6

Ti
Time-Dependent
D
d t Flows
Fl

Introduction to
ANSYS Polyflow
ANSYS, Inc. Proprietary
2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-1
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Contents

Introduction to time-dependent flows

Time-marching scheme
Difference
Diff
between
b t
time-marching
ti
hi scheme
h
and
d evolution
l ti
scheme

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-2
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Introduction to Time-Dependent
p
Flows

What are time-dependent flows?

This refers to simulations where time derivatives are present in
the basic equations describing the flow problem.
Time-dependent flows may or may not reach a steady-state
solution.
Any boundary condition parameter may be a function of time.
Material parameters may also depend on time, although the
physical relevance can be questioned.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-3
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme

Introduction
I t d ti
In time-dependent simulations, the solution of the problem has
to be satisfied at a discrete set of times starting from an initial
time. The solution at each time step is obtained by specific
integration schemes known as predictor-corrector methods. The
predictor method calculates a first guess at a specific time step.
This guess is used by the corrector method to compute the real
solution at the time step considered.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-4
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme
How the time-marching scheme works
Consider a flow problem in which a boundary condition
parameter is time dependent.
Examples of such parameters are:
Flow rate
Temperature imposed along a wall
Velocity imposed along a boundary

The time dependence of the parameter is described by means of

a function f(t) such that:
(t) = o f(t)
where o is the nominal value of the parameter that you select.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-5
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme
The
Th following
f ll i
algebraic
l b i functions
f
ti
f(t) are available
il bl in
i
POLYDATA.

User Defined Function ( external, written in CLIPS)

f(t) = t
f(t) = 1/t (if t 0)
f(t) = a + bt + ct2 + dt3
f(t) = Ramp function
f(t) = b for t a
f(t) = b + (d b) (t a) / (c a) for a t c
f(t) = d for c t

f(S)
f(t)
d
b

tS

f(t) = a.cos(bt + c) + d + et
f(t) = attb + cttd
f(t) = aebt + c + dt
f(t) = Multi-ramp function
Multi-linear function defined by a serie of n pairs (ti, f(ti))

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-6
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme
f(t) = Double ramp function

f(t
)

f(t
)

f(t)
( ) = Trapezoidal
p
wave

t
f(t
)

f(t) = H step function

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-7
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme

Numerical parameters for the transient iterative scheme

The following are numerical parameters that you have to specify as
input parameters for the iterative scheme.
scheme You may also accept the
default values for these parameters.

Initial value of t
Final value of t
Initial time step
Minimum time step
Maximum time step
Maximum number of successful steps
Precision (tolerance)
Integration technique

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-8
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching Scheme

Strategy
The time step
p is limited by
y the precision
p
(predicted
(p
value and the
corrected value).
The next time step is selected according to the current time step and
the tolerance value.

The time-marching scheme stops when:

The upper time limit is reached.
The time step is divided down to its minimum value
value.
The maximum number of successful time steps is reached.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-9
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time-Marching
Time
Marching Scheme

A time-dependent problem can be started from an existing

results file or it can be defined as a new task problem in
POLYDATA.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-10
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Time Dependence in Polydata

Time-Dependence

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-11
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Li t off existing
List
i ti time-dependent
ti
d
d t functions
f
ti

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-12
info@CFDiran.ir

Release 12.1
June 2010

Introduction to POLYFLOW training

Training Manual

Difference Between Time-Marching Scheme and

Evolution Scheme

In POLYFLOW, the time

time-marching
marching scheme is very similar to the
evolution scheme, but the fundamental difference is that the
evolution scheme is controlled by the convergence of the
iterative scheme,, while the time-marching
g scheme is
controlled by the convergence and accuracy of the timeintegration technique.

ANSYS, Inc. Proprietary

2010 ANSYS, Inc. All rights reserved.

www.CFDiran.ir
6-13
info@CFDiran.ir

Release 12.1
June 2010