Method of Moments: Prof. Rakhesh Singh Kshetrimayum Prof. Rakhesh Singh Kshetrimayum

Method of Moments
Prof. Rakhesh Singh Kshetrimayum
1 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

10.1 Introduction
learn how to use method of moments (MoM) to solve

electrostatic problems
advanced & challenging problems in time-varying fields
brief discussion on the basic steps of MoM
solve a simple differential equation using MoM
in order to elucidate the steps involved
MoM for 1-D and 2-D electrostatic problems

10.2 Basic Steps in Method of Moments
Method of Moments (MoM) transforms
integro-differential equations into matrix systems of linear equations
which can be solved using computers
Consider the following inhomogeneous equation
L(u ) = k
⇒ L(u ) − k = 0
where L is a linear integro-differential operator,
u is an unknown function (to be solved) and
k is a known function (excitation)

For example,
(a) consider the integral equation for a line charge density
λ ( x ')dx '
V0 = ∫
4πε 0 r ( x, x ')
Then u = λ x' ( )
k = V0
dx '
L=∫
4πε 0 r ( x, x ')

(b) consider the differential equation of the form
d 2 f ( x) 2
− = 3 + 2 x
dx 2
Then
u = f ( x)
k = 3 + 2x2
d2
L=− 2
dx

To solve u, approximate it by sum of weighted known
basis functions or 1 ∞ ∞
f (x ) = a0 + ∑ an cos(nx ) + ∑ bn sin (nx )
expansion functions 2 n =1 n =1
as given below
N N
u ≅ ∑ un =∑ I n bn , n = 1, 2,..., N
n =1 n =1
where bn is the expansion function,

I n is its unknown complex coefficients to be determined,
N is the total number of expansion functions

Since L is linear, substitution of the above equation in the
integro-differential equation,
we get,
 N 
L  ∑ I nbn  ≈ k
 n=
n =1 
where the error or residual is given by
 N 
R = k − L  ∑ I n bn 
 n =1 

Mathematicians name this method as Method of Weighted
Residuals
Why?
Next step in MoM
Enforcing the boundary condition
Make inner product of the above equation with each of the
testing or
weighting functions
should make residual or error zero

By replacing u by u n
where n=1,2,…,N
taking inner product with a set of wm
weighting or
testing functions
in the range of L, we have,
wm , ( L ( un ) − k ) = 0, m = 1, 2,..., M

Since In is a constant
we can take it outside the inner product and
write
N
∑I
n =1
n wm , L ( bn ) = wm , k , m = 1, 2,..., M
M and N should be infinite theoretically

but practically it should be a finite number

Note that a scalar product w, g is defined to be a scalar
satisfying
w, g = g , w = ∫ g ( x) w( x) dx
bf + cg , w = b f , w + c g , w
g*, g > 0 if g ≠0 g*, g = 0 if g =0
b and c are scalars and * indicates complex conjugation

In matrix form
[Z ][I ] = [V ]
with each matrix and vector defined by
T
[I ] = [I 1 I 2 ... I N ]T [V ] =  k , w1 k , w2 ... k , wM 
 w1 , L ( b1 ) w1 , L ( b2 ) K w1 , L ( bN ) 
 
 w2 , L ( b1 ) w2 , L ( b2 ) ... w2 , L ( bN ) 
 
[ Z ] =  w3 , L ( b1 ) w3 , L ( b2 ) ... w3 , L ( bN ) 
 
M M O M 
 
 wM , L ( b1 ) wM , L ( b2 ) ... wM , L ( bN ) 
Example 10.1
Consider a 1-D differential equation
d 2 f ( x) 2
− = 3 + 2 x
dx 2
subject to the boundary condition f(0)=f(1)=0
Solve this differential equation using Galerkin’s MoM
Solution:
Note that for this case,
u = f ( x)

k = 3 + 2 x2
d2
L=− 2
dx
According to the nature of the known function k = 3 + 2 x 2 ,

it is natural to choose the basis function as bn ( x ) = x
n
However,
the boundary condition f(1)=0
can’t be satisfied with such a basis function

A suitable basis function for this differential equation
taking into account of this boundary condition is
bn ( x ) = x − x n +1 ; n = 1, 2,..., N
Assume N=2 (the total number of subsections on the

interval [0,1])
Approximation of the unknown function
f ( x ) ≅ I1b1 ( x) + I 2b2 ( x) = I1 ( x − x 2 ) + I 2 ( x − x 3 )

For Galerkin’s MoM, the weighting functions are
wm ( x ) = x − x m+1; m = 1, 2,..., M
Choosing a square [Z] matrix where M=N=2

1 1
1
Z11 = w1 , L ( b1 ) = ∫ w1 ( x) L ( b1 ( x) ) dx = ∫ ( x − x 2 ) ( 2 ) dx =
0 0
3
d2
L=− 2
dx
1 1
1
Z12 = w1 , L ( b2 ) = ∫ w1 ( x) L ( b2 ( x) ) dx = ∫ ( x − x ) ( 6 x ) dx =
2
0 0
2

1 1
1
Z 21 = w2 , L ( b1 ) = ∫ w2 ( x) L ( b1 ( x) ) dx = ∫ ( x − x 3 ) ( 2 ) dx =
0 0
2
1 1
4
Z 22 = w2 , L ( b2 ) = ∫ w2 ( x) L ( b2 ( x) ) dx = ∫ ( x − x 3 ) ( 6 x ) dx =
0 0
5
1 1
3
V1 = k , w1 = ∫ k ( x) w1 ( x) dx = ∫ ( 3 + 2 x 2 ) ( x − x 2 )dx =
0 0
5
k = 3 + 2 x2 1 1
11
V2 = k , w2 = ∫ k ( x) w2 ( x) dx = ∫ ( 3 + 2 x 2 ) ( x − x 3 ) dx =
0 0
12

Therefore, 1 1 3
3 2   I1   5 
[ Z ][ I ] = [V ] ⇒  1  = 
4   I 2   11 

 2 5  12 
 13 
 I1  10 
⇒ [I ] =   =  
I2   1 
 3 
The unknown function f(x)
13 1
f ( x) ≅ I1 ( x − x 2 ) + I 2 ( x − x 3 ) = ( x − x 2
) + ( x − x3 )
10 3

The above function satisfies the given boundary conditions
f(0)=f(1)=0
The analytical solution for this differential equation is
5 3 1
f ( x) = x − x2 − x4
3 2 6
Check whether the above solution using MoM is

different from the analytical solution obtained by direct
integration (see Fig. 10.1)

Analytical
and MoM
solution:
almost
same
coinciding
even with
two basis
functions
Fig. 10.1 Comparison of exact solution (analytical) and approximate

solution (MoM) of Example 10.1

Programming Exercise 1
Write a MATLAB program to solve Exercise 10.1
Convergence analysis:
Perform convergence analysis by taking N=2,3,4
Accuracy testing:
Check the accuracy of the MoM program by plotting the
approximate solution obtained (convergent one) and comparing
with the actual solution
Assignments schedule:
All assignments will be given on or before Friday
Submit it on or before next Wednesday
Note:
Any other high level programming language like JAVA, C++,
Python is also most welcome

10.3 Introductory examples from electrostatics
In electrostatics, the problem of finding the potential
due to a given charge distribution is often considered
In practical scenario, it is very difficult to
specify a charge distribution
We usually connect a conductor to a voltage source
and thus the voltage on the conductor is specified
We will consider MoM
to solve for the electric charge distribution
when an electric potential is specified

1-D Electrostatic case: Charge density of a straight wire
Consider a straight wire of length l and radius a (assume
a<<l),
placed along the y-axis as shown in Fig. 10.2 (a)
The wire is applied to a constant electric potential of 1V
Choosing observation along the wire axis (x=z=0) i.e.,
along the y-axis
and λ representing the charge density on the surface of the wire
l
1 λ ( y ' )dy '
1=
4πε 0 ∫ R( y, y ' )
0

∆

Fig. 10.2
(a) Straight wire of length l and radius a applied with a
constant potential of 1V
(b) Its segmentation: y1, y2, …, yN are observation points and
r′ shows a source point
(c) Division of the charged strip into N sections

where
r r
R( y, y ' ) = R(r , r ' ) = ( y − y ' )2 + ( x ' )2 + ( z ' ) 2 = ( y − y ' )2 + (a)2
x= z =0
It is necessary to solve the integral equation

to find the unknown function λ(y′)
The solution may be obtained numerically by
reducing the integral equation into a series of linear algebraic
equations
that may be solved by conventional matrix techniques

(a) Approximate the unknown charge density λ(y′)
by an expansion of N known basis functions with unknown
coefficients
N
λ( y' ) = ∑ I n bn ( y ' ) 1
l
λ ( y ' ) dy '
n =1 1=
4πε 0 ∫ R( y, y ' )
0
Integral equation after substituting this is
N
l ∑ I n bn ( y ' )dy ' N l
bn ( y ' )dy '
4πε 0 = ∫
n =1
R( y, y ' )
= ∑ In ∫ R ( y , y ')
0 n =1 0

Now we have divided the wire into N uniform segments each
of length ∆ as shown in Fig. 10.2 (b)
We will choose our basis functions as pulse functions
1
()
bn y ' = 
0
for ( n − 1) ∆ ≤ y ' ≤ n∆
otherwise
b) Applying the testing or weighting functions

Let us apply the testing functions as delta functions  ∂ ( y − ym ) 
for point matching

Integration of any function with this delta function
will give us the function value at y = ym
Replacing observation variable y by a fixed point such as ym,
results in an integrand that is solely a function of y′
so the integral may be evaluated. N
It leads to an equation l ∑ I n bn ( y ' )dy ' N l
bn ( y ' )dy '
with N unknowns
4πε 0 = ∫
n =1
R( y, y ' )
= ∑ In ∫ R ( y , y ')
0 n =1 0
∆ 2∆ n∆ l
b1 ( y ' )dy ' b2 ( y ' ) dy ' bn ( y ' )dy ' b N ( y ' )dy '
4πε 0 = I1 ∫ R( y , y')
+ I2 ∫ R ( y , y ')
+ ... + I n ∫ R ( y , y ')
+ ... + I N ∫ R ( y , y ')
0 m ∆ m ( n −1) ∆ m ( N −1) ∆ m

Solution for these N unknown constants,

N linearly independent equations are required
N equations may be produced
by choosing an observation point ym on the wire
where m=1,2,3…, N and
at the center of each ∆ length element
as shown in Fig. 10.2 (c)
Result in an equation of the form of the previous equation
corresponding to each observation point

For N such observation points we have
∆ 2∆ n∆ l
b1 ( y ' )dy ' b2 ( y ' ) dy ' bn ( y ' )dy ' b N ( y ' ) dy '
4πε 0 = I1 ∫ R( y , y ' ) + I 2 ∫ '
+ ... + I n ∫ '
+ ... + I N ∫ '
0 1 ∆ R ( y1 , y ) ( n −1) ∆ R ( y1 , y ) ( N −1) ∆ R ( y1 , y )
∆ 2∆ n∆ l
b1 ( y ' )dy ' b2 ( y ' ) dy ' bn ( y ' )dy ' b N ( y ' ) dy '
4πε 0 = I1 ∫ R( y , y')
+ I2 ∫ R ( y , y ')
+ ... + I n ∫ R ( y , y ')
+ ... + I N ∫ R ( y , y ')
0 2 ∆ 2 ( n −1) ∆ 2 ( N −1) ∆ 2
∆ 2∆ n∆ l
b1 ( y ' )dy ' b2 ( y ' )dy ' bn ( y ' ) dy ' b N ( y ' ) dy '
4πε 0 = I1 ∫ R( y , y')
+ I2 ∫ , y')
+ ... + I n ∫ , y')
+ ... + I N ∫ '
0 N ∆ R( y N ( n −1) ∆ R ( y N ( N −1) ∆ R ( y N , y )

(c) We may write the above equations in matrix form as
 Z11 Z12 ...Z1N   I1  V0 
Z Z 22 ...Z 2 N   I 2  V0 
 21
 Z 31 Z 32 K Z 3 N   I 3  = V0  ⇒ [ Z mn ][ I n ] = [Vm ]
    
M M O M   M  M 
 Z N 1 ZN 2 ... Z NN   I N  V0 
where [Vm ] = [4πε 0 ]

l yn
bn ( y ' )dy ' dy '
Z mn = ∫ = ∫
' 2 2
0 ( ym − y ) + a yn−1 ( ym − y ' ) 2 + a 2
yn yn
dy ' dy ' ∆
≅ ∫
yn−1 ( ym − y ) ' 2
= ∫
yn−1
ym − y '
≈
ym − yn
for m≠n

Special care for calculating the Zmn for m=n case
since the expression for Zmn is infinite for this case
Extraction of this singularity
Substitute ym − y ' = ξ ⇒ d ξ = − dy '
0 ∆ ∆
dξ dξ
Z mn = − ∫
∆
2
(ξ ) + a 2
=∫
0
2
(ξ ) + a 2 ( 2
= log ξ + (ξ ) + a 2
) 0
 ∆ + ∆2 + a2 
= ln  
 a 

Self or diagonal terms are the
most dominant elements in the [Z] matrix
Note that linear geometry of this problem
yields a matrix that is symmetric toeplitz, i.e.,
 Z11 Z12 ... Z1N 

Z Z11 ... Z1N −1 
[ Z mn ] =  .12 . . . 
 
 Z1N Z1N −1 ... Z11 

All other rows are a rearranged version of the first row
Required to calculate the first row of the matrix only
Remaining elements can be obtained by the rearrangement
formula:
Z mn = Z1, m − n +1 , m ≥ 2, n ≥ 1
Therefore the unknown [I] matrix could be solved as
[I n ] = [Z mn ]−1[Vm ]

Fig. 10.3 (a) Convergence plot of Z11 and Z21 (b) Plot of line charge density of
the wire (MATLAB program provided in the book)

Let us see the convergence of these two types of elements of
the Z matrix say,
Z11 and Z21
Fig. 10.3 (a) shows the convergence plot of two elements of
the Z matrix
for number of sub-sections varying from 5 to 100
The graph of Z21 (dashed line) versus number of sub-sections
is a straight line
so any number of sub-sections between 5 and 100 should give
the same result

But the graph of Z11 versus number of sub-sections is
decreasing quite fast at the initial values of number of sub-
sections and
it is decreasing more slowly for larger values of number of sub-
sections
This shows that at
higher values of number of sub-sections,
we will get a more convergent result
Choose the maximum number of sub-sections and
plot the line charge density as depicted in the Fig. 10.3 (b)

See the condition number of the [Z] matrix in order to see
whether the [Z] matrix is well-behaved or not
The condition number of [Z] matrix
(=7.1409) for maximum number of sub-sections is good
No problem in taking the inverse
Fig. 10.3 (b) line charge density is
maximum at the two end points of the wire and
minimum at the center of the wire

Method of Moments: Prof. Rakhesh Singh Kshetrimayum Prof. Rakhesh Singh Kshetrimayum

Enviado por

Dados do documento

Descrição original:

Título original

Direitos autorais

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Method of Moments: Prof. Rakhesh Singh Kshetrimayum Prof. Rakhesh Singh Kshetrimayum

Enviado por

Direitos autorais:

Method of Moments

Prof. Rakhesh Singh Kshetrimayum

1 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

learn how to use method of moments (MoM) to solve

2 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

3 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

4 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

5 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

where bn is the expansion function,

6 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

where the error or residual is given by

7 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

8 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

9 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

M and N should be infinite theoretically

10 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

g*, g > 0 if g ≠0 g*, g = 0 if g =0

b and c are scalars and * indicates complex conjugation

11 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

13 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

According to the nature of the known function k = 3 + 2 x 2 ,

14 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Assume N=2 (the total number of subsections on the

15 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Choosing a square [Z] matrix where M=N=2

16 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

17 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

18 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Check whether the above solution using MoM is

19 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Fig. 10.1 Comparison of exact solution (analytical) and approximate

20 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

21 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

22 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

23 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

24 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

25 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

It is necessary to solve the integral equation

26 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

27 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

b) Applying the testing or weighting functions

28 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

29 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Solution for these N unknown constants,

30 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

31 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

where [Vm ] = [4πε 0 ]

32 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

33 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

 Z11 Z12 ... Z1N 

34 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Therefore the unknown [I] matrix could be solved as

35 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

36 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

37 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

38 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

39 MoM by Prof. Rakhesh Singh Kshetrimayum 1/11/2019

Você também pode gostar

g, g > 0 if g ≠0 g, g = 0 if g =0