240164036 ee2092-4-2011-matrix-analysis
-
Upload
homeworkping4 -
Category
Education
-
view
215 -
download
1
Transcript of 240164036 ee2092-4-2011-matrix-analysis
Get Homework/Assignment Done Homeworkping.comHomework Help https://www.homeworkping.com/
Research Paper helphttps://www.homeworkping.com/
Online Tutoringhttps://www.homeworkping.com/
click here for freelancing tutoring sites
Matrix Analysis of Networks – J. R. Lucas
Used to have a compact and neat form of solution. necessary to know the structure of a network, and formulate the problem based on the structureMatrix Analysis of Networks – Professor J R Lucas 1 May 2011
Because Large networks are tedious to analyse using normal equations easier/more convenient to formulate in matrix form.
Matrix Analysis of Networks – Professor J R Lucas 2 May 2011
Topology
Deals with structure of an interconnected systemFormulates the problem based on non-measurable
properties of network.
Geometric structure of the interconnection of network elements completely characterises number of independent loop currents number of independent node-pair voltages that are necessary to study the network.
Matrix Analysis of Networks – Professor J R Lucas 3 May 2011
Figure 1 – Structure of the network1(a) and (b) have the same structure (or topology).
However elements are quite different.
Matrix Analysis of Networks – Professor J R Lucas 4 May 2011
R1
L1
C
(a) (b)
Graph of NetworkFigure 2 – Circuit
Figure 2Circuit of figure 2(a) also has same topology.Figure 2(b) shows structure corresponding to all 3 circuits.
Matrix Analysis of Networks – Professor J R Lucas 5 May 2011
(a) Network (b) Graph of Network
Does not indicate any of the elements in the networks. Known as the graph of the network– Has all the nodes of the original networkIn obtaining the graph, each element of the network is represented by a line each voltage source by a short-circuit and each current source by an open circuit.
Matrix Analysis of Networks – Professor J R Lucas 6 May 2011
Tree of a Network
Which of the diagrams would also represent a normal tree (without leaves) ? and why ?
Only first diagram would fully satisfy the requirements. Second diagram has branches closing on itself only a tree like Nuga might appear to close on itself Third diagram has branches in mid air not joined to main tree. Matrix Analysis of Networks – Professor J R Lucas 7 May 2011
Properties associated with trees. 1. All branches must be part of the tree2. There cannot be closed loops formed from branches3. There cannot be branches isolated from the treeSame properties apply in defining a tree of a network can be many trees associated with a given network. need not have a trunk coming from the ground and
branches coming from the trunk. a reduced graph of network with some of the links
removed so as to leave all the nodes connected together by graph, but not to have any loop left.
Matrix Analysis of Networks – Professor J R Lucas 8 May 2011
Possible trees for the Graph
When a tree of the network is removed from graph, what remains is called the co-tree of the network.
Co-tree is graph of removed links –compliment of the tree. A co-tree may contain closed loops, and disconnected branches. Matrix Analysis of Networks – Professor J R Lucas 9 May 2011
Graph of Network Some of the possible trees
Analysis structure of networkA single branch is required to join two nodes.
Joining each additional node would require an additional branch.
Let b = number of branches in the networkn = number of nodes in the networkl = number of independent loops
Thus number of branches in tree = n – 1number of links removed = b – (n – 1) = b – n + 1Matrix Analysis of Networks – Professor J R Lucas 10 May 2011
Node 1 Node 2
Node 1 Node 2
New Node
Formation of Independent LoopsIf any one of removed links are added to the tree, then a new loop is formed. number of links removed from graph to form the
tree is equal to the number of independent loops.l = b – n + 1
Oriented Graph Numbered branches with assigned
directions to currents. Voltage considered to increase in
direction opposite to flow of current
Matrix Analysis of Networks – Professor J R Lucas 11 May 2011
Oriented Graph
1
32
46
5
Matrix Analysis of NetworksTo solve circuit problems, need to write the equations corresponding to Ohm’s Law, and Kirchoff’s Current Law Kirchoff’s Voltage Law Same is true even when there are a large number of branches. use matrix analysis
Matrix Analysis of Networks – Professor J R Lucas 12 May 2011
k-1
-1
+1+1
+1
0
0i1
i2
i3
i4
i6
i7
i5
Kirchoff’s current Law in matrix formFor any node k i1 i2 i4 + i6 + i7 = 0 ori1 i2 i4 = i6 + i7ori1 + i2 + i4 – i6 – i7 = 0or+1 . i1 + 1 . i2 + 0 .i3 + 1 .i4 + 0 . i5 – 1 .i6 – 1 .i7 = 0 Last form is preferred for matrix implementation all currents in network are included in equation with
different coefficients. Matrix Analysis of Networks – Professor J R Lucas 13 May 2011
For computer implementation, there must be a unique method (convention) of obtaining the coefficients ajk. Ij – current in jth branchjth branch directed away from kth node: ajk = +1 directed towards kth node: ajk = –1 not incident on the kth node: ajk = 0Kirchoff’s current law may be written, for the kth nodea1k . i1 + a2k . i2 + a3k . i3 + a4k . i4 + ...... ....... ..... a7k . i7 = 0
or at kth node, for all k
Collection of equations, for each node k, would give Matrix Analysis of Networks – Professor J R Lucas 14 May 2011
In [A]t, row vectors are dependant, since sum is zero. [A]t written with one row less, giving only (n-1) rows. [A]t – node-branch incidence matrix, (n-1)b. [A] – branch-node incidence matrix, b (n-1)ajk = +1 if jth current is directed away from the kth node ajk = 1 if jth current is directed towards the kth node ajk = 0 if jth current is not incident on the kth node Kirchoff’s voltage Law in matrix form
for sth loop, for all s;
Matrix Analysis of Networks – Professor J R Lucas 15 May 2011
0
0
0+1
-1
-1
0
-1
+1
s
0
0
0
where brs = 1, 0, or +1
[B]t – mesh-branch incidence matrix, (lb)[B] – branch-mesh incidence matrix, (bl)brs = +1 if rth current is in same direction as sth loop brs = 1 if rth current is in opposite direction to sth loopbrs = 0 if rth current is in the not part of the sth loopOhm’s Law in matrix form
Matrix Analysis of Networks – Professor J R Lucas 16 May 2011
egk
igk
Zkik+ igkik
vk
for all branches k = 1, 2, .... ... b vk = – egk + Zk igk + Zk ik
Either voltage source or current source would normally be used.Conversion with either Thevenin’s Theorem or Norton’s Theorem.
With a voltage source onlyvk = – egk + Zk ik
for all branches k = 1, 2, ....... bMatrix Analysis of Networks – Professor J R Lucas 17 May 2011
egkZk
vk
ik
Figure - General branch
and in matrix form as
With a current source only ik = Yk vk – igk for all branches k = 1, 2, .... ... band in matrix form as
, where [Yb] = [Zb]-1
Matrix Analysis of Networks – Professor J R Lucas 18 May 2011
igk
Ykik
vk
In SummaryFrom Kirchoff’s Laws
(1) (n-1) independent equations(2) l independent equations
and from Ohm’s Law(3) b independent equations
or (3)* b independent equationsThus total number of independent equations is n – 1 + l + b = b + b = 2 b2b independent equations2b unknowns (b branch currents and b branch voltages)
Matrix Analysis of Networks – Professor J R Lucas 19 May 2011
Can be solved.Not usual to solve for both current and voltage simultaneously.Reductions can be done in two ways.
1) Eliminate voltages and solve for currents mesh analysis
2) Eliminate currents and solve for voltages. nodal analysis.
Matrix Analysis of Networks – Professor J R Lucas 20 May 2011
Mesh Analysis Eliminate the branch voltages from the equations. Reduce remaining currents to a minimum using
Kirchoff’s current law.Apply Kirchoff’s voltage law for solution.Define a set of mesh currents, .Branch currents related to mesh currents by an algebraic summation.
(4)Eliminate Vb from the equations, Pre-multiply equation (3) by [B]t.Matrix Analysis of Networks – Professor J R Lucas 21 May 2011
from equation (2), [B]t Vb = 0. Also [B]t Vb = 0 sum of voltages around a loop is zero.i.e. [B]t Vb sum of voltages around a loop. [B]t Egb sum of source voltages around a loop. Defined as mesh source voltage vector Egm .i.e. Egm [B]t Egb
Egm =where [Zm] = corresponds to l equationsMatrix Analysis of Networks – Professor J R Lucas 22 May 2011
[B] also known as the tie-set matrix (as its elements tie the loop together)Unknowns are l values of current Im
Original 2b equations and 2b unknowns reduced tol equations and l unknowns.Elements of [Zm] can be obtained either from above mathematics, or by inspection as follows. Simple evaluation of [Zm] and Egm
zjj = self impedance of mesh j= sum of all branch impedances in mesh j
zjk = mutual impedance between mesh j and mesh kMatrix Analysis of Networks – Professor J R Lucas 23 May 2011
= sum of all branch impedances common to mesh j and mesh k and traversed in mesh direction sum of all branch impedances common to mesh j and mesh k, and traversed in opposite direction
ej = algebraic sum of the branch voltage sources in mesh j in mesh direction.
Matrix Analysis of Networks – Professor J R Lucas 24 May 2011
Example 1
Solve the circuit using Mesh matrix analysis.Work from first principles.SolutionNumber the branches and the loops.
Matrix Analysis of Networks – Professor J R Lucas 25 May 2011
j6
E1
10000 V
j20
-j120 E2
100300 V
10
20
10
Write the loop currents in terms of the branch currents.i1 = I1
i2 = – I3
i3 = I1 – I2
i4 = I2 i5 = I2 – I3
i6 = I3Matrix Analysis of Networks – Professor J R Lucas 26 May 2011
or in matrix form
I1 I2 I3
i1 i4
i3i5
i6
i2
E1
10000 V
j20 j6
–j120 E2
10036.870
10
20
10
This gives the Branch-Mesh incidence matrix [B].Mesh–Branch incidence matrix [B]t can also independently by writing the relation between the mesh direction and the branch direction.
Notice that this corresponds to the transpose of the earlier written matrix.
Matrix Analysis of Networks – Professor J R Lucas 27 May 2011
Vector of branch source voltages is
Branch impedance matrix is
Egm = [B]t Egb , and [Zm] = [B]t [Zb] [B]
, Egm =
Matrix Analysis of Networks – Professor J R Lucas 28 May 2011
=
Both Egm and Zm could have been written by inspection.Thus
= Equations may be solved by inversion or otherwise.
Matrix Analysis of Networks – Professor J R Lucas 29 May 2011
= (1220 – j2220)(–j100) + (720 –
j2400) (j120) + (–j1200) 0= – j122000 – 222000 + j 86400 + 288000 = 66000 – j 35600 = 74989-28.34o
I1 = (122000 – j 222000 + 0 + j 96000 – 72000)/74989-28.34o
= (50000 – j 126000)/ 74989-28.34o = 135558-68.36o/74989-28.34o = 1.808-40.02o A
[Note: Inversion has not been checked so answers may be in error.]Currents I2 and I3 can be similarly determined.The branch currents i1, i2, ..... may then be determined from the matrix equation. [Normally branch 6 would have been marked as part of branch 2]
Matrix Analysis of Networks – Professor J R Lucas 30 May 2011
Nodal Analysis eliminate branch currents from the equations. Reduce number of remaining voltages to a minimum
using Kirchoff’s voltage law.Apply Kirchoff’s current law for solution.Define a set of nodal voltages, which are node pair voltages (i.e. voltage across a pair of nodes)Branch voltages are related to nodal voltages by an algebraic summation.
(5)[A] too does not have the reference node.
Matrix Analysis of Networks – Professor J R Lucas 31 May 2011
Pre-multiply equation (3)* by [A]t.
from equation (1), [A]t Ib = 0 . Substituting from (5)
IgN = [YN]VN
where , and
Source nodal current vector IgN and the nodal admittance matrix [YN] could be written by inspection.Matrix Analysis of Networks – Professor J R Lucas 32 May 2011
yii = sum of all branch admittances incident at node iyij = negative of the sum of all branch admittances
connecting node i and node j .Reason for negative sign can be understood as follows:
ik = yk vk = yk (Vi – Vj)At any node i, injected current Igi ik = yk (Vi – Vj)
for all j Since Vi is a constant for a given i,
Matrix Analysis of Networks – Professor J R Lucas 33 May 2011
vk ji
ykik
corresponds to nodal equation
As in the case of mesh analysis, I gN = [YN]VN is first solved to give VN and the branch voltages and branch currents then obtained using the matrix equations.
Matrix Analysis of Networks – Professor J R Lucas 34 May 2011
Example 2
Example 1 has been reformulated as a problem with current sources rather than with voltage sources.
[If voltage sources are present, they would first have to be converted to current sources].
Matrix Analysis of Networks – Professor J R Lucas 35 May 2011
5-900 A
j20
j6
-j120 8.5755.910 A10
20
10
i1 i4
i3i5
i2V1 V2
Network may also be drawn in terms of admittances.
The branch-node incidence matrix [A], branch injected current Igb, and branch admittance matrix may be written, with reference selected as earthed node as follows.
Matrix Analysis of Networks – Professor J R Lucas 36 May 2011
5-900 A
-j0.05 S
0.0735 – j 0.0441 S
j0.00833 S
8.5755.910 A0.1 S
0.05 Si1 i4
i3i5
i2V1 V2
, Igb = ,
As in mesh analysis, nodal current injection vector and nodal admittance matrix may be written from first principles. Left as an exercise for you to work out.This is worked by inspection.
= (–j0.05+j0.00833+0.05)(0.05+0.1+0.0735–j0.0441) – 0.052
Matrix Analysis of Networks – Professor J R Lucas 37 May 2011
= (0.05 – j 0.04167)(0.2235 – j 0.0441) – 0.0025 = 0.06509-39.81o0.2278-11.16o – 0.0025= 0.01483-50.97 – 0.0025 = 0.00934 – 0.0025 – j 0.01152 = 0.00684 – j 0.01152= 0.0134-59.30o
V1 = (0.2278-11.16o5-90o+0.058.5755.91o)/0.0134-59.3o
= (– 0.2205 – j 1.1175 + 0.4265 + j 0.04415) /0.0134-59.30o = (0.2060 – j 1.0733)/0.0134-59.30o = 1.093-79.14o/0.0134-59.30o
V1 = 81.6-19.84o Vbranch current i1 =
i1
Matrix Analysis of Networks – Professor J R Lucas 38 May 2011
which is the same answer (to calculation accuracy) that was obtained in example 1.
Matrix Analysis of Networks – Professor J R Lucas 39 May 2011
Conversion of Ideal sources(a) Ideal Voltage sources
No impedance directly in series with voltage source
Ideal voltage sources are distributed to branches connected to one of the nodes of original ideal source.
Matrix Analysis of Networks – Professor J R Lucas 40 May 2011
E
EE E E E
or
Z1Z3
Z2
Z5Z4
Z1
Z3
Z2
Z5Z4
Z1
Z3
Z2
Z5
Z4
(b) Ideal Current sources No admittance appears directly in parallel with current source
Ideal current source has been distributed around a loop connecting the two points of original source.
Matrix Analysis of Networks – Professor J R Lucas 41 May 2011
Is
Is
Is
Is
PortPair of nodes across which a device can be connected. Voltage is measured across the pair of nodes.Current going into one node is the same as the current coming out of the other node in the pair. These pairs are entry (or exit) points of the network. Compare with an Airport or a Sea Port. Entry and exit points to a country.Planes that enter at a given port are the ones that take off from same port.
Matrix Analysis of Networks – Professor J R Lucas 42 May 2011
Two-Port TheoryConvenient to develop special methods for systematic treatment of networks. Single-port linear active networks Thevenin’s or Norton’s equivalent circuit. Linear passive networks Convenient to study behaviour relative to a pair of
designated ports.
Matrix Analysis of Networks – Professor J R Lucas 43 May 2011
LinearPassiveNetwork
I1 I2
V1 V2Port 1 Port 2
DefinitionsDriving point impedance is defined as ratio of applied voltage (driving point voltage) across a node-pair to the current entering at the same port. [input impedance of network seen from particular port]
Driving point impedance at Port 1 = V1/I1
Driving point impedance at Port 2 = V2/I2
Driving point admittance is similarly defined as the ratio of the current entering at a port to the applied voltage across the same node-pair.
Driving point admittance at Port 1 = I1/V1
Driving point admittance at Port 2 = I2/V2Matrix Analysis of Networks – Professor J R Lucas 44 May 2011
Immittance is sometimes used to represent either an impedance or an admittanceTransfer impedance is defined as the ratio of the applied voltage across a node-pair to the current entering at the other port.
Transfer impedance = V1/I2 , V2/I1
Transfer admittance is similarly defined as the ratio of the current entering at a port to the voltage appearing across the other node-pair.
Transfer admittance = I1/V2 , I2/V1
Matrix Analysis of Networks – Professor J R Lucas 45 May 2011
Transfer Voltage gain (or ratio) is defined as the ratio of the voltage at a node pair to the voltage appearing at the other node-pair.
Transfer voltage gain = V1/V2 , V2/V1
Transfer Current gain (or ratio) is similarly defined as the ratio of the current at a port to the current at the other port.
Transfer current gain = I1/I2 , I2/I1
Matrix Analysis of Networks – Professor J R Lucas 46 May 2011
Common Two-port parameters External conditions of a two-port network can be completely defined by currents and voltages at the 2 ports. A general two port network can be characterised by four parameters, derived from the network elements.With symmetry, number of parameters will be reduced.
(a) Impedance parameters(b) Admittance parameters(c) Transmission Line parameters(d) Hybrid parameters.
Matrix Analysis of Networks – Professor J R Lucas 47 May 2011
(a) Impedance Parameters (z-parameters) or Open-circuit parameters
V1 = z11 I1 + z12 I2
If I2 = 0, then z11 = V1/I1
If I1 = 0, then z12 = V1/I2
It follows that,
Matrix Analysis of Networks – Professor J R Lucas 48 May 2011
LinearPassiveNetwork
I1 I2
V1 V2Port 1 Port 2
, ,, .
z-parameters correspond to the driving point and transfer impedances at each port with the other port having zero current (i.e. open circuit). open circuit parameters.
Matrix Analysis of Networks – Professor J R Lucas 49 May 2011
Example 3Find impedance parameters of the two port T – network. With port 2 on open circuit
similarly with port 1 open, z12 = Zb z22 = Zb + Zc
(b) Admittance Parameters (y-parameters) or Short-circuit parameters
Matrix Analysis of Networks – Professor J R Lucas 50 May 2011
I1 I2
V1 V2Port 1 Port 2
Za Zc
Zb
y11, y12, y21, y22 defined with either V1 or V2 zero.y-parameters correspond to driving point and transfer admittances at each port with the other port having zero voltage (i.e. short circuit) short circuit parameters.
Matrix Analysis of Networks – Professor J R Lucas 51 May 2011
LinearPassiveNetwork
I1 I2
V1 V2Port 1 Port 2
Example 4Find admittance parameters of the 2 port –network.
y11 = = Ya + Yb
y21 = = – Yb
Matrix Analysis of Networks – Professor J R Lucas 52 May 2011
I1 I2
V1 V2
Yb
Ya Yc
I1 I2
V1 V2=0
Yb
Ya Yc
with port 2 on short circuit
[Y] =
(c) Transmission Line Parameters (ABCD-parameters)
Parameters can be defined using either port 2 on short circuit or port 2 on open circuit. In case of symmetrical system, parameter A = D.For a reciprocal system, A.D – B.C = 1Matrix Analysis of Networks – Professor J R Lucas 53 May 2011
LinearPassiveNetwork
I1 I2
V1 V2Port 1 Port 2
Example 5Find ABCD parameters.A = , B = C = and D = [For symmetrical network, Ya
= Yb , A = D].A.D – B.C =
= =1(d) Hybrid Parameters (h-parameters)
Matrix Analysis of Networks – Professor J R Lucas 54 May 2011
I1 I2
V1 V2
Yc
Ya Yb
LinearPassiveNetwork
I1 I2
V1 V2Port 1 Port 2
The hybrid parameter matrix may be written as
h-parameters can be defined as in other examples, and are commonly used in some electronic circuit analysis.
Matrix Analysis of Networks – Professor J R Lucas 55 May 2011
Interconnection of two-port networks(a) Series connection of two-port networks
Series properties are applied to each portat port 1, Ir1 = Is1 = I1, and Vr1 + Vs1 = V1 at port 2 I r2 = Is2 = I2, and Vr2 + Vs2 = V2
[Z] = [Zr] + [Zs]Matrix Analysis of Networks – Professor J R Lucas 56 May 2011
LinearPassiveNetwork
r
Ir1 Ir2
Vr1 Vr2Port r1 Port r2
LinearPassiveNetwork
s
Is1 Is2
Vs1 Vs2Port s1 Port s2
V2V1
(b) Parallel connection of two-port networksa t p o r t 1 ,
Ir1 + Is1 = I1, and Vr1 = Vs1 = V1 a t p o r t 2 ,
I r2 + Is2 = I2, and Vr2 = Vs2 = V2
[Y] = [Yr] + [Ys](c) Cascade connection of networks
Matrix Analysis of Networks – Professor J R Lucas 57 May 2011
LinearPassive
Network r
Ir1 Ir2
Vr1Vr2
LinearPassive
Network s
Is1 Is2
Vs1Vs2
V2V1
I1 I2
Output of one network becomes input to next.Ir2 = Is1
Vr2 = Vs1
,
ABCD matrix of component networks
Matrix Analysis of Networks – Professor J R Lucas 58 May 2011
LinearPassiveNetwork
Is1 Is2
Vs1 Vs2Port s1 Port s2LinearPassiveNetwork
Ir1 Ir2
Vr1 Vr2Port r1 Port r2
V1 V2
I1 I2
ZV1 V2
I1 I2
Y
A = = 1, = 1B = = Z, = 0C = = 0, =YD = = 1, = 1
In matrix form= , =
Consider example 5 again
Matrix Analysis of Networks – Professor J R Lucas 59 May 2011
I1 I2
V1 V2
Yb
Ya Yc
Yb
Ya Yc
= Simplification of matrix product would give the same answer as in example 5.
Matrix Analysis of Networks – Professor J R Lucas 60 May 2011