Professional Documents
Culture Documents
LUDecomposition PDF
LUDecomposition PDF
1.0 Introduction
We have seen how to construct the Y-bus
used in the matrix equation
I YV
(1)
If we are given the bus voltages, we can
construct Y and then very easily find I.
Unfortunately, this is not generally what we
know. Rather, we typically know I (because
we know generation and load), and then we
must find V. This is easy enough, using
matrix inverses, i.e.,
1
V Y I
(2)
However, there is a very practical problem
with this. A model of the eastern US
interconnection can be 50000 buses. This
means that the Y-bus for this model is a
5000050000
matrix.
Direct
matrix
inversion for this dimensionality is
computational suicide.
1
A LU
(3)
LU x b
(5)
w Ux
(6)
Define:
Substitution of (6) into (5) results in
Lw b
(7)
The situation is the following. We want to
find x. It appears that (6) and (7) are not
very helpful, because solving them for x and
w, respectively, will require an inverse. But
lets take a closer look at eqs. (6) and (7), in
terms of the fully expressed matrix relations
and see if we can get x and w without matrix
inversion. If so, then our procedure will be
to use (7) to find w and then (6) to find x.
4
w1 1 u12 u13 x1
w w 2 0 1 u23 x2 U x
(8)
w 3 0 0
1 x3
l11 0 0 w1 b1
Lw l 21 l 22 0 w2 b2 b
(9)
l 31 l 32 l 33 w3 b3
Observe that
Equation (9) can be solved for w without
inverting L and
Equation (8) could then be solved for x
without inverting U.
Lets start with (9). We see that we can
begin with the row 1 equation and proceed
as follows:
l11w1 b1 w1 b1 / l11
(10)
b2 l 21w1
l 21w1 l 22w2 b2 w2
(11)
l 22
b3 l 31w1 l 32w2
l 31w1 l 32w2 l 33w3 b3 w3
l 33
(12)
5
This
procedure
is called
forward
substitution. Consideration of the pattern of
calculation introduced by eqs. (10)-(12)
suggests a generalized formula for forward
substitution,
useful
for
computer
programming, as follows:
k 1
wk
bk l kj w j
j 1
(13)
l kk
Now that we have w, we can use (8) to find
x. We see that we can begin with the row 3
equation and proceed as follows:
x3 w3
(14)
x2 u23 x3 w2 x2 w2 u23 x3 (15)
x1 u12 x2 u13 x3 w1 x1 w1 u12 x2 u13 x3
(16)
j k 1
kj
xj
(17)
a11 l11
a12 l11u12 u12 a12 / l11
a13 l11u13 u13 a13 / l11
a21 l 21
a22 l21u12 l22 l22 a22 l21u12
a23 l 21u13
a23 l 21u13 l 22u23 u23
l 22
a31 l 31
a32 l31u12 l32 l32 a32 l31u12
a33 l31u13 l32u23 l33 l33 a33 l31u13 l32u23
The above is convincing evidence that we
will be able to perform the desired
factorization. Although we have done so for
only a 33 case, it is easy to see that the
procedure would also work for a matrix of
any dimension.
If you study closely the pattern of
calculation, you can convince yourself that
the following generalized formula can be
used in computer programming [1].
j 1
l ij a ij l is usj
s 1
(18)
i 1
uij
aij l is usj
s 1
l ii
(19)
a11 u11
a12 u12
a13 u13
Row 2 of A and L, across columns of U.
a21
a21 l21u11 l21
u11
a32 l31u12
a32 l31u12 l32u22 l32
u22
a33 l31u13 l32u23 u33 u33 a33 l31u13 l32u23
5.0 Factorization
using
Gaussian
elimination
Trick: Augment A matrix before you begin
the below algorithm by adding the vector b
as the n+1 column. Then, when you finish
the algorithm, you will have the vector w in
the n+1 column.
The algorithm is as follows:
1. Perform Gaussian elimination on A. Let
i=1. In each repetition below, row i is the
pivot row and aii is the pivot.
a. Lji=aji for j=i,,n.
b.Divide row i by aii.
c. If [i=n, go to 2] else [go to d].
d.Eliminate all aji, j=i+1,,n. This
means to make all elements directly
11
3 x1 3 x 2 6 x 3 9 x 4 1
x1 3 x 2 4 x 3 x 4 3
x1 2 x 2 5 x 3 6 x 4 2
x3 3 x4 1
x1
3
1
9 x1 1
3 4 1 x 2 3
2 5 6 x 3 2
0 1 3 x 4 1
3
3
1
9 1
3 4 1 3
2 5 6 2
0 1 3 1
3
3
1
9 1
3
3 4 1 3
1
1
2 5 6 2
; L=
0 1 3 1
1
3
_
_
_
0
_
_
0
0
0 1
3
3
0 1 3 0
1 / 3
8 / 3
5 / 3
; L=
2 / 3
13
3 0
1 2
1 1
1 1
0
0
_
_
0
0
0
1 / 3
1 1 1 4 / 3
0 2
4 1 / 3 ;
0 2 1 6 / 3
1
L=
0
3 0
1 2
0
1 1
2
1 1 2
0
0
0
1 / 3
1 1 1 4 / 3
0 1 2 1 / 6 ;
0 0 3 7 / 3
1 2
L=
0
3 0
1 2
0
1 1
2
1 1 2
0
0
0
1 / 3
1 1 1 4 / 3
0 1 2 1 / 6
0 0 1 7 / 9
1 2
[1] Vlach and Singhal, Computer Methods for Circuit Analysis and
Design, 2nd edition, 1994.
14