Stability Properties of Explicit and Implicit Methods.: PDE To ODE After Semi Discretization
Stability Properties of Explicit and Implicit Methods.: PDE To ODE After Semi Discretization
Stability Properties of Explicit and Implicit Methods.: PDE To ODE After Semi Discretization
(1)
or
(2)
with
and
We get,
or
(3)
(4)
The above examples are weakly stable cases because as per the
stability definition we considered, the solution is bounded and stable
when and not for actual computations with finite values of
Δt.
Next we consider the concept of region of absolute stability;
The region of absolute stability of a numerical algorithm for
integrating an ODE is the set of values of z = qΔt , such that the
sequence un of the numerical values remains bounded as 𝑛 → ∞ .
As previous definition of stability required that the sequence un
remain bounded for 𝑛 → ∞, ∆𝑡 → 0, this is equivalent to stating that
the origin lies in the region of absolute stability
(5)
(6)
Which corresponds to
From the above, we can deduce that the region of stability is the
segment of the imaginary axis between −𝑖 𝑎𝑛𝑑 + 𝑖 as shown in the
Figure.
Region of stability of the mid-point method.
Absolute Stability
Absolute stability is defined as a property by which the numerical
solution of a physically stable problem would be bounded irrespective
of the time step.
In mathematical terms, this means test problems of the type
Considering the backward Euler method, which is an implicit method,
and applying it to the test equation we get,
Since qΔt has higher order terms, even if Re(q) is less than zero, the
sum of the four terms of qΔt upto the fourth order need not be less
than zero, and therefore it does not lie entirely in the left half plane.
The region of stability of the 4th order R-K method is given in the
Figure and it is clear that it is not an A stable method.