Write the primitive admittance matrix of the network of Figure 3.8b.
The matrix is written by simply examining the figure. There are no mutual couplings between the elements. The required matrix is
The top and left-side identifications of the elements between nodes are helpful in the formation of the matrix. It is a diagonal matrix. If there are mutual couplings between elements of the network, the appropriate off-diagonal elements in the matrix are populated.
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |
0–1 | 0–2 | 0–3 | 0–4 | 1–2 | 1–3 | 1–4 | 2–4 | 3–4 | |
0–1 | y_{10} | ||||||||
0–2 | y_{20} | ||||||||
0–3 | y_{30} | ||||||||
0–4 | y_{40} | ||||||||
1–2 | y_{12} | ||||||||
1–3 | y_{13} | ||||||||
1–4 | y_{14} | ||||||||
2–4 | y_{24} | ||||||||
3–4 | y_{34} |