"Stability of Finite Difference schemes. I was reading a book ''Numerical partial differential equation: Finite difference methods'' by J. W. Thomas. Here at page no. 74, definition of stability is given as ∥u^(n+1)∥<=Ke^(beta t)∥u^0∥; for 0<=t=(n+1) delta t, 0<=delta x<=delta x_0 and 0<=delta t <=delta t_0. i.e. this definition allows for exponential growth. however in a few literature i found the definition that ''A finite distinction approximation is solid if the errors (truncation, spherical-off and so forth) decay as the computation proceeds from one marching step to the next .'' The ebook which i've noted, at the equal page in remark 3, creator has written that the above definition with exponential increase is trendy definition and later one may be derived from this.but i am not gett

Aliyah Thompson

Aliyah Thompson

Answered question

2022-11-04

Stability of Finite Difference schemes.
I was reading a book ''Numerical partial differential equation: Finite difference methods'' by J. W. Thomas. Here at page no. 74, definition of stability is given as
u n + 1 K e β t u 0 for 0 Δ x Δ x 0 and 0 Δ t Δ t 0 . i.e. this definition allows for exponential growth. however in a few literature i found the definition that ''A finite distinction approximation is solid if the errors (truncation, spherical-off and so forth) decay as the computation proceeds from one marching step to the next .'' The ebook which i've noted, at the equal page in remark 3, creator has written that the above definition with exponential increase is trendy definition and later one may be derived from this.but i am not getting the way to locate this definition. So my question is which definition is true ? And if different one is not proper, then what is motive at the back of ? and the way can we examine those two definition?

Answer & Explanation

lavarcar2d2

lavarcar2d2

Beginner2022-11-05Added 18 answers

To address the concern of your stability question, one often has to enforce some sort of constrain on the time step. Here is an example.
Consider the advection diffusion equation:
t u + a x u b x 2 u = 0 ,  with  u ( x , t = 0 ) = f ( x ), with t u + a x u b x 2 u = 0 ,  with  u ( x , t = 0 ) = f ( x )
for x [ 1 , 1 ] with u ( x + 2 , t ) = u ( x , t ) for all x and t.
Applying the explicit difference method then,
U ( x , t + Δ t ) = U ( x , t ) a Δ t 2 Δ x ( T T 1 ) U ( x , t ) + b Δ t Δ x 2 ( T 2 + T 1 ) U ( x , t )
Recall the following Discrete Fourier Transform rules:
U ( x + 2 L ) = U ( x ) ,  and  L = N Δ x = 1
U ^ ( ξ + 2 L ) = U ^ ( ξ ) ,  and  L ^ = N Δ ξ  with  N Δ x Δ ξ = π
T U ^ ( ξ ) = U ^ ( ξ ) e i ξ Δ x
Applying the previous rules, then our difference method equation becomes:
U ^ ( ξ , t + Δ t ) = U ^ ( ξ , t ) a Δ t 2 Δ x ( e i ξ Δ x e i ξ Δ x ) 2 i s i n ( ξ Δ x / 2 ) U ^ + b Δ t Δ x 2 ( e i ξ Δ x 2 + e i ξ Δ x ) ( e i ξ Δ x e i ξ Δ x ) 2 = ( 2 i s i n ( ξ Δ x / 2 ) ) 2 U ^
With
ξ [ π Δ x , π Δ x ] ,  or  Δ x ξ 2 [ π 2 , π 2 ]
And after some algebra,
U ^ ( ξ , t + Δ t ) = [ 1 a Δ t Δ x i sin ( ξ Δ / 2 ) b Δ t Δ x 2 4 sin 2 ( ξ Δ / 2 ) ] U ^ ( ξ , t )
Here is the Stability part
Require U ^ ( t + Δ t ) 2 U ^ ( t ) 2 to avoid blowing up (Stability) and recall that the Fourier Transform process is norm-preserving,
then
1 a Δ t Δ x i sin ( ξ Δ / 2 ) b Δ t Δ x 2 4 sin 2 ( ξ Δ / 2 ) 2 1
Which is equivalent to
( 1 b Δ t Δ x 2 4 sin 2 ( ξ Δ / 2 ) ) 2 + ( a Δ t Δ x sin ( ξ Δ / 2 ) ) 2 1
To obtain the constrain on Δ t and Δ x, which are the time step and the space step for the numerical method, set
sin ( ξ Δ / 2 ) = 1 Δ t Δ x 2 ( b 2 + a 2 ) 2 b Δ t 2 b Δ x 2 a 2 + b 2
Note there is another condition for stability for this system, but this condition encompass the other one so I don't mention it.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?