Finite Difference

Method
NHET RA
23214701
GAMA TITIS ANURAGA 23214061
JATI PHARMADITA 23214053

Introduction
The finite difference method(FDM) is an
approximate method for solving partial
differential equations Including linear
and non-linear, time independent and
dependent problems.
Ref:
(Numerical
Electromagnetic Fields)

Analysis

of

Discretization mode for twodimensional problems

The Basic Idea of FDM is to replace
the derivatives of an unknown
function by the difference quotients
of unknown functions.

(1)

(2)

Cont
In other to simplify the matter some form of grids
are adopted

a. Square
grid

c. Polar grids

b. Rectangular
grids

d. Triangular grids

Difference equation in 2-D

Cartesian coordinates

Square
grid

Cont
Difference quotiens from taylor
1 u
1 2u
1
2
u x x u ( x) (x) 2 (x)
1! x
2! x
3!

1 u
1
u x x u ( x ) (x )
1! x
2!

3u
3
(

x
)
....(3
3
x

)
u
1 u
2
3
(

x
)

x
)
....(4

3
2
x
3!
x
)
2

Where is a small increment of the

variable x

Cont
Let

1 u
1 2u
1
2
uE uo hE 2 (hE )
1! x o
2! x o
3!

3u
3
(
h
)
....
3
E
x o

1 u
1 2u
1
2
uW uo hW 2 (hW )
1! x o
2! x o
3!

3u
3
(
h
)
....
3
W
x o

Where is a forward step and

backward

(5
)
(6
)

Cont
Similarly, if u is a function of variable
y, the two following expression are
3
obtain: 1 u

1 2u
1

u
2
3

u N uo hE 2 (hN )
3 (hN ) ....
1! x o
2! y o
3!
y o
1 u
1
uS uo hS
1! x o
2!

(7
)
3

2u
1

u
2
3
(8
(
h
)

(
h
)

....

S
S
3
y 2 o
3!

o
)

Where is a forward step and

backward

Cont

Sum time Eq(5) and

Eq(6)

times

h 2 E u
h2 E
h 2 E
uE 2 uW 1 2 uo hE 2 hE
hW
h W

h W x o
3

u
2
hE h E hW hE
....
(9
3
3!
x o

Neglecting the terms containing the partial derivatives of order

higher than three

Cont
hW
hE hW
hE
u
uE
uo
uW

hE hE
hW hE hW
x o hE hE hW
u
hS
hN hS
hN
uN
uo
uS

hN hS
hS hN hS
y o hN hN hS

(10
)
(11
)

If=

and == than Eq(10), (11) can

be expressed as

u
u N uS

2 hy
y o

uE uW
u

2hx
x o

(12
)

Cont

Sum
time Eq(5) and times Eq(6) and doing the
same procedure we can obtain

2u uE 2uo uW

2
x
h2 x

2u u N 2uo uS

2
y
h2 y

(13
)

Equation (13) express the second order derivatives of the yare

simplified by the difference quotients

Cont
Replace the second differential
equation into Eq(1) the discretization
equation at node O is:

=h
For the Laplace's Equation(14) reduces to

(14
)

Difference equation in 3-D

Cartesian coordinates

(15
)

Discretization equation in Polar

Coordinates

r,

x,
y

Cont

If and than

(ui 1, j 2ui , j ui 1, j )
h2

1 (ui 1, j ui 1, j )
1 (ui , j 1 2ui , j ui , j 1 )

0
2
2
ih
2h
(ih)
( )

(16
)

Discretization equation in
Cylindrical coordinates
Cylindrical coordinates(2D)

Cont

since
2u 2u
2 2 2 0
r
z
4ui 1, j ui , j 1 ui , j 1 6ui , j
h

(17
)
0

(18
)

Discretization Formula of The

Non-Linear Magnetic Field (1/2)
If the reluctivity v=1/ of given material is a function of the
magnetic flux density, Poissons Eq. for the magnetic vector
potential in a 2-D case is:

Assuming J and v constant in the area of each mesh, the

discretization eq. can be derived by the same method
resulting:

(19
)

Discretization Formula of The

Non-Linear Magnetic Field (2/2)
In the solution of a non linier problem an under-relaxation
factor of v may be introduced in some cases to accelerate
the iteration as in:

(20
)

Difference Equations for

Time-Dependent
Problems (1/6)
(21
)
Discretization of 1-D Time-Dependent
Problem

The expressions of the Taylors series for t and x are:

(22
)
(23
)

Difference Equations for

Time-Dependent
Problems
(2/6)

Explicit Iteration Formulation

u nj 1 u nj
t

n
n
n
1 u j 1 2u j u j 1

a
x 2

u nj 1 Cu nj1 (1 2C )2u nj Cu nj1

(24
)
C

t
a ( x ) 2

(25
)

Difference Equations for

Time-Dependent
Problems
(3/6)Formulation
Implicit Iterative
u nj 1 u nj
t
Cu

n 1
j 1

n 1

n 1

n 1

1 u j 1 2u j u j 1

a
x 2

(1 2C )u

n 1
j

Cu

n 1
j 1

n
j

t
a ( x ) 2

(26
)
(27
)

Difference Equations for

Time-Dependent
Problems
(4/6)

Crank-Nicholson Eq.

Provides an alternative implicit scheme which has the accuracy

of the second order in both space and time.

(28
)
(29
)

Difference Equations for

Time-Dependent Problems
(6/6)
Crank-Nicholson Eq.
When =1,

(30
)
Where,

(31
)

THANK YOU