Differencing For PDEs PDF
Differencing For PDEs PDF
Revisiting Stability
Discretising PDEs
Summary
Dr. Johnson
School of Mathematics
Semester 1 2008
university-logo
O UTLINE
1 R EVIEW
2 R EVISITING S TABILITY
Consistency, Stability and Convergence
3 D ISCRETISING PDE S
Difference Formula
Centering of Approximations
4 S UMMARY
university-logo
C LASSIFICATION
university-logo
C ONSISTENCY
D EFINITION
A discrete approximation to a partial differential equation is said to
be consistent if in the limit of the stepsize(s) going to zero, the
original pde system is recovered, i.e. the truncation error
approaches zero.
university-logo
S TABILITY
D EFINITION
If we define the error to be the difference between the computed
solutions and the exact solution of the discrete approximation,
then the scheme is stable if the error remains uniformly bounded
for successive iterations.
university-logo
C ONVERGENCE
D EFINITION
A scheme is stable if the solution of the discrete equations
approaches the solution of the pde in the limit that the step-sizes
approach zero.
L AX ’ S E QUIVALENCE T HEOREM
For a well posed initial-value problem and a consistent
discretization, stability is the necessary and sufficient condition for
convergence.
university-logo
T HE G RID
Consider a PDE with the state variables x and y .
Form a grid of points:
with equal mesh spacing ∆x in the x-direction
and equal spacing ∆y in the y -direction.
y (i + 1, j + 1)
∆y
(i, j )
(i − 1, j − 1)
∆x
university-logo
x
Dr. Johnson MATH65241
Review
Revisiting Stability Difference Formula
Discretising PDEs Centering of Approximations
Summary
(i − 1, j ) (i, j ) (i + 1, j )
university-logo
(i, j + 1)
(i, j )
(i, j − 1)
university-logo
∂φ wi +1,j − wi −1,j
= + O (∆x 2 )
∂x 2∆x
∂φ wi,j +1 − wi,j −1
= + O (∆y 2 )
∂y 2∆y
university-logo
M IXED D ERIVATIVES
or in stencil form
−1 0 1
1 0 0 0
4∆x ∆y
1 0 −1 university-logo
M IXED D ERIVATIVES
university-logo
F IRST D ERIVATIVES
university-logo
F IRST D ERIVATIVES
university-logo
university-logo
D IFFERENCING
university-logo