• Source: Kron reduction

In power engineering, Kron reduction is a method used to reduce or eliminate the desired node without need of repeating the steps like in Gaussian elimination.
It is named after American electrical engineer Gabriel Kron.




Description


Kron reduction is a useful tool to eliminate unused nodes in a Y-parameter matrix. For example, three linear elements linked in series with a port at each end may be easily modeled as a 4X4 nodal admittance matrix of Y-parameters, but only the two port nodes normally need to be considered for modeling and simulation. Kron reduction may be used to eliminate the internal nodes, and thereby reducing the 4th order Y-parameter matrix to a 2nd order Y-parameter matrix. The 2nd order Y-parameter matrix is then more easily converted to a Z-parameter matrix or S-parameter matrix when needed.
Matrix operations
Consider a general Y-parameter matrix that may be created from a combination of linear elements constructed such that two internal nodes exist.




Y




4







X







4



=


[



Y




1







1





Y




1







2





Y




1







3





Y




1







4







Y




2







1





Y




2







2





Y




2







3





Y




2







4







Y




3







1





Y




3







2





Y




3







3





Y




3







4







Y




4







1





Y




4







2





Y




4







3





Y




4







4






]




{\displaystyle Y{_{4}}{_{X}}{_{4}}={\begin{bmatrix}Y{_{1}}{_{1}}&Y{_{1}}{_{2}}&Y{_{1}}{_{3}}&Y{_{1}}{_{4}}\\Y{_{2}}{_{1}}&Y{_{2}}{_{2}}&Y{_{2}}{_{3}}&Y{_{2}}{_{4}}\\Y{_{3}}{_{1}}&Y{_{3}}{_{2}}&Y{_{3}}{_{3}}&Y{_{3}}{_{4}}\\Y{_{4}}{_{1}}&Y{_{4}}{_{2}}&Y{_{4}}{_{3}}&Y{_{4}}{_{4}}\\\end{bmatrix}}}


While it is possible to use the 4X4 matrix in simulations or to construct a 4X4 S-parameter matrix, is may be simpler to reduce the Y-parameter matrix to a 2X2 by eliminating the two internal nodes through Kron Reduction, and then simulating with a 2X2 matrix and/or converting to a 2X2 S-parameter or Z-Parameter matrix.





Y
′





2







X







2



=


[




Y
′





1







1






Y
′





1







2








Y
′





2







1






Y
′





2







2






]




W
h
e
r
e


Y
′


i
s

t
h
e

K
r
o
n

R
e
d
u
c
e
d

M
a
t
r
i
x



{\displaystyle Y'{_{2}}{_{X}}{_{2}}={\begin{bmatrix}Y'{_{1}}{_{1}}&Y'{_{1}}{_{2}}\\Y'{_{2}}{_{1}}&Y'{_{2}}{_{2}}\end{bmatrix}}\qquad \mathrm {Where\ Y'\ is\ the\ Kron\ Reduced\ Matrix} }


The process for executing a Kron reduction is as follows:
Select the Kth row/column used to model the undesired internal nodes to be eliminated. Apply the below formula to all other matrix entries that do not reside on the Kth row and column. Then simply remove the Kth row and column of the matrix, which reduces the size of the matrix by one.
Kron Reduction for the Kth row/column of an NxN matrix:









∑

i
=
1


N



∑

j
=
1


N



Y
′





i







j



=
Y




i







j



−



Y




i







k



Y




j







k





Y




k







k






,



f
o
r

i
≠
k
,
,
j
≠
k







W
h
e
r
e


Y
′


i
s

T
h
e

R
e
p
l
a
c
e
m
e
n
t

M
a
t
r
i
x

E
n
t
r
y







{\displaystyle {\begin{aligned}\sum _{i=1}^{N}\sum _{j=1}^{N}Y'{_{i}}{_{j}}=Y{_{i}}{_{j}}-{\frac {Y{_{i}}{_{k}}Y{_{j}}{_{k}}}{Y{_{k}}{_{k}}}},&\qquad for\ i\neq k,,j\neq k\\&\qquad \mathrm {Where\ Y'\ is\ The\ Replacement\ Matrix\ Entry} \\\end{aligned}}}


Linear elements that are also passive always form a symmetric Y-parameter matrix, that is,



Y




i







j



=
Y




j







i





{\displaystyle Y{_{i}}{_{j}}=Y{_{j}}{_{i}}}

in all cases. The number of computations of a Kron reduction may be reduced by taking advantage of this symmetry, as shown ion the equation below.
Kron Reduction for symmetric NxN matrices:











∑

i
=
1


N



∑

j
=
i


N



Y
′





i







j



=
Y




i







j



−



Y




i







k



Y




j







k





Y




k







k






,

f
o
r

i
≠
k
,
j
≠
k





Y




j







i



=
Y




i







j



,

f
o
r

i
≠
j






{\displaystyle {\begin{aligned}&\sum _{i=1}^{N}\sum _{j=i}^{N}Y'{_{i}}{_{j}}=Y{_{i}}{_{j}}-{\frac {Y{_{i}}{_{k}}Y{_{j}}{_{k}}}{Y{_{k}}{_{k}}}},\qquad for\ i\neq k,j\neq k\\&Y{_{j}}{_{i}}=Y{_{i}}{_{j}},\qquad for\ i\neq j\\\end{aligned}}}


Once all the matrix entries have been modified by the Kron Reduction equation, the Kth row/column me be eliminated, and the matrix order is reduced by one. Repeat for all internal nodes desired to be eliminated




Simplified theory and derivation


The concept behind Kron reduction is quite simple. Y-parameters are measured using nodes shorted to ground, but unused nodes, that is nodes without ports, are not necessarily grounded, and their state is not directly known to the outside. Therefore, the Y-parameter matrix of the full network does not adequately describe the Y-parameter of the network being modeled, and contains extraneous entries if some nodes do not have ports.
Consider the case of two lumped elements of equal value in series, two resistors of equal resistance for example. If both resistors have an admittance of




Y

R




{\textstyle Y_{R}}

, and the series network has an admittance of




Y

R



/

2


{\textstyle Y_{R}/2}

. The full admittance matrix that accounts for all three nodes in the network would look like below, using standard Y-parameter matrix construction techniques:





Y

F
U
L
L


=


[



0


−

Y

R





Y

R






−

Y

R




2

Y

R




−

Y

R







Y

R




−

Y

R




0



]




{\displaystyle Y_{FULL}={\begin{bmatrix}0&-Y_{R}&Y_{R}\\-Y_{R}&2Y_{R}&-Y_{R}\\Y_{R}&-Y_{R}&0\end{bmatrix}}}


However, it is easily observed that the two resistors in series, each with an assigned admittance of Y, has a net admittance of




Y

R



/

2


{\textstyle Y_{R}/2}

, and since resistors do not leak current to ground, that the network Y12 is equal and opposite to YR11, that is YR12 = -YR11. The 2 port network without the middle node can be created by inspection and is shown below:





Y

P
O
R
T
S


=


[



−

Y

R



/

2



Y

R



/

2





Y

R



/

2


−

Y

R



/

2



]




{\displaystyle Y_{PORTS}={\begin{bmatrix}-Y_{R}/2&Y_{R}/2\\Y_{R}/2&-Y_{R}/2\end{bmatrix}}}


Since row and column 2 of the




Y

F
U
L
L




{\textstyle Y_{FULL}}

matrix is to be eliminated, we can rewrite




Y

F
U
L
L




{\textstyle Y_{FULL}}

without row 2 and column 2. We will call this rewritten matrix




Y

F
U
L
L

′



{\textstyle Y'_{FULL}}

.





Y

F
U
L
L

′

=


[



0



Y

R







Y

R




0



]




{\displaystyle Y'_{FULL}={\begin{bmatrix}0&Y_{R}\\Y_{R}&0\end{bmatrix}}}


Now we have a basis to create the translation equation by finding an equation that translates each entry in




Y

F
U
L
L

′



{\textstyle Y'_{FULL}}

to the corresponding entry in




Y

P
O
R
T
S




{\textstyle Y_{PORTS}}

:






[



0
⇒
−

Y

R



/

2



Y

R


⇒

Y

R



/

2





Y

R


⇒

Y

R



/

2


0
⇒
−

Y

R



/

2



]




{\displaystyle {\begin{bmatrix}0\Rightarrow -Y_{R}/2&Y_{R}\Rightarrow Y_{R}/2\\Y_{R}\Rightarrow Y_{R}/2&0\Rightarrow -Y_{R}/2\end{bmatrix}}}


For each of the four entries, it can be observed that subtracting




Y

R



/

2


{\displaystyle Y_{R}/2}

from the left-of-arrow value successfully makes the translation. Since




Y

R



/

2


{\displaystyle Y_{R}/2}

is identical to






Y

R




2



/

(
2

Y

R


)


{\displaystyle {Y_{R}}^{2}/(2Y_{R})}

, each case of




Y

F
U
L
L

′



{\textstyle Y'_{FULL}}

meets the condition




Y

i
j

′

=

Y

i
j


−

Y

i
j



Y

j
i



/


Y

k
k




{\displaystyle Y'_{ij}=Y_{ij}-Y_{ij}Y_{ji}/Y_{kk}}

shown in the general translation equations.
The same process may be used for elements of arbitrary admittance (




Y

11


≠
−

Y

12


,

Y

i
j


≠

Y

j
i




{\displaystyle Y_{11}\neq -Y_{12},Y_{ij}\neq Y_{ji}}

etc.) and networks of arbitrary size, but the algebra becomes more complex. The trick is to deduce and/or calculate an expression that translates the original matrix entries to the reduced matrix entries.




See also


Schur complement
Power-flow study




References

Kata Kunci Pencarian:

• Kron reduction
• Electronic circuit simulation
• Gabriel Kron
• Schur complement
• San Francisco Chronicle
• Ambassador Hotel (San Francisco)
• List of Advanced Dungeons & Dragons 2nd edition monsters
• Arabidopsis
• Low-rank approximation
• Young Left (Sweden)