Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
7Activity
0 of .
Results for:
No results containing your search query
P. 1
Lecture # 03 CFD Techniques and Properties of Numerial Solut

Lecture # 03 CFD Techniques and Properties of Numerial Solut

Ratings: (0)|Views: 172|Likes:
Published by maheshj90

More info:

Published by: maheshj90 on Aug 08, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/12/2014

pdf

text

original

 
Time-stepping techniques
Unsteady flows are parabolic in time
use ‘time-stepping’ methods toadvance transient solutions step-by-step or to compute stationary solutions
timespacezone of influencedependencedomain of 
 futureresent  past 
Initial-boundary value problem
u
=
u
(
x
,t
)
∂ut
+
L
u
=
in
×
(0
,
) time-dependent PDE
B
u
= 0 on Γ
×
(0
,
) boundary conditions
u
=
u
0
in at
t
= 0 initial conditionTime discretization 0 =
t
0
< t
1
< t
2
< ... < t
=
T u
0
u
0
in
Consider a short time interval (
t
n
,t
n
+1
) , where
t
n
+1
=
t
n
+ ∆
t
Given
u
n
u
(
t
n
) use it as initial condition to compute
u
n
+1
u
(
t
n
+1
)
Lecture # 03CFD Techniques and Properties of Numerical SolutionJetWings1
 
Space-time discretization
Space discretization: finite differences/finite volumes/finite elementsUnknowns:
u
i
(
t
) time-dependent nodal values / cell mean valuesTime discretization: (i) before or (ii) after the discretization in space
The space and time variables are essentially decoupled and can be discretized independently to obtain a sequence of (nonlinear) algebraic systems
A
(
u
n
+1
,u
n
)
u
n
+1
=
b
(
u
n
)
n
= 0
,
1
,...,M 
1Method of lines (MOL)
LL
h
yields an ODE system for
u
i
(
t
)
du
h
dt
+
L
h
u
h
=
h
on (
t
n
,t
n
+1
) semi-discretized equationsFEM approximation
u
h
(
x
,t
) =
j
=1
u
j
(
t
)
ϕ
j
(
x
)
, u
ni
u
(
x
i
,t
n
)
Lecture # 03CFD Techniques and Properties of Numerical SolutionJetWings2
 
Properties of time-stepping schemes
Time discretization
t
n
=
n
t,
t
=
=
t
Accumulation of truncation errors
n
= 0
,...,M 
1
ǫ
loc
τ 
=
O
(∆
t
)
 p
ǫ
glob
τ 
=
Mǫ
loc
τ 
=
O
(∆
t
)
 p
1
Remark.
The order of a time-stepping method (i.e., the asymptotic rate atwhich the error is reduced as ∆
t
0) is not the sole indicator of accuracyThe optimal choice of the time-stepping scheme depends on its purpose:
to obtain a time-accurate discretization of a highly dynamic flow problem(evolution details are essential and must be captured) or
to march the numerical solution to a steady state starting with somereasonable initial guess (intermediate results are immaterial)The computational cost of explicit and implicit schemes differs considerably
Lecture # 03CFD Techniques and Properties of Numerical SolutionJetWings3

Activity (7)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
sorry0761 liked this
Sharad Pachpute liked this
121ads.com liked this
ida5412 liked this
navala_pra liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->