On Thevenin-Norton and Maximum power transfer theorems
Abstract
In this paper we state and prove complete versions of two basic theorems of linear circuit theory.
The Thevenin-Norton theorem expresses the port behaviour of a linear multiport in terms of the zero source and zero port input conditions when the port behaviour has a hybrid input- output representation of the form
(1) |
where the partition of into is known.
In this paper we show how to handle multiports which have port behaviour equations of the general form which cannot even be put into the hybrid form of Equation 1, indeed may have number of equations ranging from to where is the number of ports. We do this through repeatedly solving with different source inputs, a larger network obtained by terminating the multiport by its adjoint through a gyrator. The method works for linear multiports which are consistent for arbitrary internal source values and further have the property that the port conditions uniquely determine internal conditions.
The maximum power transfer theorem states that if the multiport has a Thevenin impedance matrix then the maximum power transfer from the multiport takes place when we terminate the multiport by another whose Thevenin impedance matrix is the adjoint (conjugate-transpose) of provided has only positive eigenvalues [1]. The theorem does not handle the case where the multiport does not have a Thevenin or Norton equivalent.
In this paper we present the most general version of maximum power transfer theorem possible. This version of the theorem states that ‘stationarity’ (derivative zero condition) of power transfer occurs when the multiport is terminated by its adjoint, provided the resulting network has a solution. If this network does not have a solution there is no port condition for which stationarity holds. This theorem does not require that the multiport has a hybrid immittance matrix.
keywords:
Basic circuits, Implicit duality, Thevenin, Maximum power.MSC:
15A03, 15A04, 94C05, 94C151 Introduction
Note: This paper is a brief and self contained account of the basic circuit theorems extracted from ‘Implicit Linear Algebra and Basic Circuit Theory’ (ILABC) (arXiv:2005.00838v1 [eess.SY]). ILABC attempts to relate implicit linear algebra (ILA) and circuit theory and the discussion of the theorems in that paper is meant to be an application of ILA. The present paper does not emphasize ILA but only concentrates on Thevenin-Norton and Maximum Power Transfer Theorems.
In this paper we give complete versions of Thevenin-Norton Theorem and Maximum Power Transfer Theorem.
Thevenin-Norton Theorem gives a method for computing the port behaviour (formal definition in Section 3) of a linear multiport which has a hybrid representation ([11, 4, 9], see [2] for a standard treatment), and for which we know before hand, which ports should be treated as current or voltage input kind. The characteristic feature of this approach is the computation of the port condition for a special port termination (open circuit or short circuit), and then the computation of the resistance, conductance or hybrid matrix setting the sources inside to zero. It is clear how to use a standard circuit simulator for this purpose, if one knew before hand that a hybrid matrix exists for the network and which are its current and voltage input ports. However, in general, a hybrid matrix may not even exist for a multiport. A simple termination such as open or short circuit may result in inconsistency, so that a standard circuit simulator would give an error message.
We present in this paper a method which works for very general linear multiports, which we call ‘rigid’ (which may have number of port equations ranging from to twice the number of ports). These have nonvoid solution for arbitrary internal source values and further have a unique internal solution for a given voltage plus current port condition. These are also the only kind of multiports which can be handled by standard circuit simulators, which are built for solving linear circuits with unique solution. Our method involves terminating the given multiport by its adjoint (see Subsection 3.1) through a multiport gyrator with identity matrix as the gyrator resistance matrix. The gyrator has external current or voltage sources attached in such a way that the original multiport does not see a direct termination by a source (see Figure 1) and the circuit is solved repeatedly by the simulator. It is to be noted that the adjoint of a multiport can be built by changing the device characteristic block by block, usually without serious computation.
We next use these ideas to present the most general form of the maximum power transfer theorem. We show that the maximum power transfer, if it occurs at all, corresponds to the port condition that is obtained when we terminate the multiport by its adjoint through a ideal transformer. When the multiport is rigid, if the simulator fails to solve for this termination because there is no solution, it means that power transfer can be unbounded. If it fails to solve because the solution is non unique, it means that there are an infinity of port conditions corresponding to stationarity of power transfer.
To summarize, we claim there are two significant contributions in the paper:
-
1.
If we terminate a rigid multiport by its adjoint, through a gyrator, the resulting network always has a unique solution. This holds even if the gyrator has sources attached (current source in parallel, voltage source in series) to its ports. Further, every possible port condition of the multiport can be realized by a suitable distribution of sources to the gyrator ports. This yields a technique for computing the port behaviour of a rigid multiport, using a conventional circuit simulator repeatedly.
-
2.
To find the maximum power transferred by a rigid multiport, it is enough if we terminate it by its adjoint and solve the resulting circuit. There is no need to compute its port behaviour, which is usually a more cumbersome process.
Note on the notation: We have to deal with solution spaces of equations of the kind rather than with those of the kind Instead of working with the adjoint (conjugate transpose) of a matrix we have to work with the adjoint (see Subsection 3.1) of the solution space of In order for our technique to be effective, we have to show that if defines the port behaviour of then the adjoint of the solution space of is the port behaviour of the multiport which is the adjoint of (Corollary 9). We therefore have to use notation not usual in circuit theory, dealing with operations on vector spaces such as sum, intersection, contraction, restriction, matched composition etc., instead of operations on matrices.
Example. It is possible to build a rigid (as defined above) multiport using controlled sources, norators and nullators, which has any given representation at the ports with nonvoid solution. Suppose the rigid multiport has the behaviour (see formal definition in Section 3) The number of equations may range from to where Neither the Thevenin nor the Norton representation, indeed even a hybrid representation, need exist. Our method can be used to compute the port behaviour of this multiport, whereas the usual Thevenin-Norton theorem cannot handle a case of this level of generality.

Briefly, the steps in our method are as follows:
1. Build the adjoint multiport
This is done by retaining the same graph as but replacing
each device by its adjoint (see Example 7). The name of the set of internal edges
is changed to and that of the port edges
is changed to
2. Between every pair of corresponding ports
insert a source accompanied gyrator. (For simplicity, in Figure 1 we have taken
to be a -port.)
3. Solve the circuit resulting when all the gyrator sources
are zero and internal port sources are active as in Figure 1 (a).
Let be the corresponding port condition.
4. Set internal sources to zero but gyrator accompanied sources
active one at a time as in Figure 1 (b),(c).
The resulting set of voltage- current vectors at will span the source
free port behaviour
(We have to change the sign of the current port vector in the solution
to correspond to port behaviour current, which ‘enters’ the multiport).
5. The port behaviour
Further, we can also test this port behaviour for condition of maximum power transfer by terminating by its adjoint through a ideal transformer () and solving the resulting circuit by a simulator. Solving this circuit is equivalent to solving Equation 23 of Section 5.1 rewritten as Equation 2 below. (Note that this equation is not being explicitly constructed and solved.)
(2) |
If this equation has a unique solution, the corresponding port condition
is the unique stationarity point. We have to verify whether it is maximum or minimum by perturbing the port condition around this point. If this equation has no solution, the power that can be drawn from the multiport is unbounded. If it has many solutions, there will be an infinity of port conditions corresponding to stationarity of power transfer. In both these latter cases our method will only indicate non unique solution and halt.
Finally, note that when the Thevenin equivalent exists, the port equation reduces to and the solution of Equation 2 (taking conjugate transpose of ) yields
(3) |
This corresponds to i.e., to This means that the stationarity of power transfer occurs when we terminate the multiport by the adjoint of the Thevenin impedance.
2 Preliminaries
The preliminary results and the notation used are from [7].
2.1 Vectors
A vector on a finite set over is a function where is either the real field or the complex field
The sets on which vectors are defined are always finite. When a vector figures in an equation, we use the
convention that denotes a column vector and denotes a row vector such as
in ‘’. Let be a vector on and let . The restriction of to is defined as follows:
When is on over , then the scalar multiplication of is on and is defined by , . When is on and on and both are over , we define on by
(For ease in readability, we will henceforth use in place of )
When are on over the inner product of and is defined by being the complex conjugate of If the field is the inner product would reduce to the dot product
When are disjoint, is written as The disjoint union of and is denoted by A vector on is written as
We say , are orthogonal (orthogonal) iff is zero.
An arbitrary collection of vectors on is denoted by . When , are disjoint we usually write in place of . We write iff We refer to as the direct sum of
A collection is a vector space on iff it is closed under addition and scalar multiplication. The notation always denotes a vector space on For any collection is the vector space of all linear combinations of vectors in it. We say is an affine space on iff it can be expressed as where is a vector and a vector space on The latter is unique for and is said to be its vector space translate.
For a vector space since we take to be finite, any maximal independent subset of has size less than or equal to and this size can be shown to be unique. A maximal independent subset of a vector space is called its basis and its size is called the dimension or rank of and denoted by or by For any collection of vectors the rank is defined to be The collection of all linear combinations of the rows of a matrix is a vector space that is denoted by
For any collection of vectors the collection is defined by It is clear that is a vector space for any When is a vector space and the underlying set is finite, it can be shown that and are said to be complementary orthogonal. The symbol refers to the zero vector on and refers to the zero vector space on The symbol refers to the collection of all vectors on over the field in question. It is easily seen, when are disjoint, and contain zero vectors, that
The adjoint of a matrix is defined by
(Later we define the adjoint of a vector space
which extends this notion (see Subsection 3.1).)
A matrix of full row rank, whose rows generate a vector space is called a representative matrix for A representative matrix which can be put in the form after column permutation, is called a standard representative matrix. It is clear that every vector space has a standard representative matrix. If is a standard representative matrix of it is easy to see that is a standard representative matrix of Therefore we must have
Theorem 1.
Let be a vector space on Then and
The collection
is denoted by
When we would write more simply as
Observe that
We say sets , are copies of each other iff they are disjoint and there is a bijection, usually clear from the context, mapping to .
When are copies of each other, the vectors and are said to be copies of each other with
The copy of is defined by
When and are copies of each other, the notation for interchanging the positions of variables with index sets and in a collection is given by , that is
An affine space is said to be proper
iff the rank of its vector space translate is
2.2 Sum and Intersection
Note: This extends the conventional definition of sum and intersection
of vector spaces on the same set.
Let , be collections of vectors on sets respectively, where are pairwise disjoint. The sum of , is defined over as follows:
Thus,
The intersection of , is defined over where are pairwise disjoint, as follows:
Thus,
It is immediate from the definition of the operations that sum and intersection of vector spaces remain vector spaces.
2.3 Restriction and contraction
The restriction of to is defined by The contraction of to is defined by Unless otherwise stated, the sets on which we perform the contraction operation would have the zero vector as a member so that the resulting set would be nonvoid. We denote by , , respectively when are pairwise disjoint, the collections of vectors ,
It is clear that restriction and contraction of vector spaces are also vector spaces.
The following is a useful result on ranks of restriction and contraction of vector spaces and on relating restriction and contraction through orthogonality [12, 7].
Theorem 2.
1. 2.
2.4 KVL and KCL
By a ‘graph’ we mean a ‘directed graph’. Kirchhoff’s Voltage Law (KVL) for a graph states that the sum of the signed voltages of edges around an oriented loop is zero - the sign of the voltage of an edge being positive if the edge orientation agrees with the orientation of the loop and negative if it opposes. Kirchhoff’s Current Law (KCL) for a graph states that the sum of the signed currents leaving a node is zero, the sign of the current of an edge being positive if its positive endpoint is the node in question.
Let be a graph with edge set We refer to the space of vectors which satisfy Kirchhoff’s Voltage Law (KVL) of the graph by and to the space of vectors which satisfy Kirchhoff’s Current Law (KCL) of the graph by (We need to deal with vectors of the kind To be consistent with our notation for vectors as functions, this is treated as a vector where is a disjoint copy of Therefore is taken to be on set and is taken to be on a disjoint copy )
The following is a fundamental result on vector spaces associated with graphs.
Theorem 3.
Tellegen’s Theorem [10] Let be a graph with edge set S, Then
2.5 Networks and multiports
An electrical network or a ‘network’ in short, is a pair where is a graph and called the device characteristic of the network, is a collection of pairs of vectors where are disjoint copies of are real or complex vectors on the edge set of the graph. In this paper, we deal only with affine device characteristics and with complex vectors, unless otherwise stated. When the device characteristic is affine, we denote it by and say the network is linear. If is the vector space translate of we say that is the source accompanied form of An affine space is said to be proper iff its vector space translate has dimension
Let denote the set of edges of the graph of the network and let
be a partition of each block being an
individual device. Let be disjoint copies of
with corresponding to edge The device characteristic would usually have the form
defined by
with rows of being linearly independent. The vector space translate
would have the form
being the translate of
Further, usually the blocks would have size one or two,
even
when the network has millions of edges.
Therefore, it would be easy to build
We say is a set of norators
iff i.e., there are no constraints on
We say is a set of nullators
iff i.e.,
We say is a gyrator
iff
where is a positive diagonal matrix.
We denote by the gyrator where is the identity matrix.
A solution of on graph is a pair
satisfying
(KVL,KCL) and
The KVL,KCL conditions are also called topological constraints.
Let be disjoint copies of
let so that, by Theorem 3, and let be the device characteristic of
The set of solutions of may be written as,
This has the form ‘[Solution set of topological constraints] [Device characteristics]’.
A multiport is a network with some subset of its edges which are norators, specified as ‘ports’. Let be on graph with device characteristic Let so that and let be the device characteristic on the edge set The device characteristic of a multiport would be For simplicity we would refer to as the device characteristic of The multiport is said to be linear iff its device characteristic is affine. The set of solutions of may be writen, using the extended definition of intersection as
We say the multiport is consistent iff its set of solutions is nonvoid.
3 Matched and Skewed Composition
In this section we introduce an operation between collections of vectors motivated by the need to capture the relationship between the port voltages and currents in a multiport.
Let be collections of vectors respectively on with being pairwise disjoint.
The matched composition is on and is defined as follows:
Matched composition is referred to as matched sum in [7]. It can be regarded as the generalization of composition of maps to composition of relations [8].
The skewed composition is on and is defined as follows:
When , are disjoint, both the matched and skewed composition of correspond to the direct sum . It is clear from the definition of matched composition and that of restriction and contraction, that
Further, it can be seen that
When , are vector spaces, observe that
When are pairwise disjoint,
we have
When the above reduces to
The multiport would impose a relationship
between
This relationship is captured by the multiport behaviour (port behaviour for short) at of defined
by
When the device characteristic of is affine, its port behaviour at would be
affine if it were not void.
Note that,
if the multiport
is a single port edge in parallel with a positive resistor
would be the solution of
But then as defined, would be the solution of
Let the multiports be on graphs respectively, with the primed and double primed sets obtained from
being pairwise disjoint,
and let them have device characteristics respectively.
Let denote a collection of vectors
The multiport
with ports obtained by connecting
through ,
is on graph (the graph obtained by putting
together with no common nodes) with device characteristic
When are void, would reduce to and would be a network without ports.
In this case we say the multiport is terminated by through
This network is on graph with device
characteristic
The following result is useful for relating the port behaviour of a multiport with internal sources to that of the source zero version of the multiport. Its routine proof is omitted.
Theorem 4.
Let be affine spaces on where
are pairwise disjoint sets. Let respectively, be the vector
space translates of Let be nonvoid and let
Then,
The following result is an immediate consequence of Theorem 4.
Theorem 5.
Let be multiports on the same graph
but with device characteristics
respectively where
is the vector space translate of the affine space
Let have
port behaviours respectively.
If then
is the vector space translate of
Implicit Duality Theorem, given below, is a part of network theory folklore. However, its applications are insufficiently emphasized in the literature. Proofs and applications may be found in [6, 7, 13, 8]. A version in the context of Pontryagin Duality is available in [3].
Theorem 6.
Implicit Duality Theorem Let be vector spaces respectively on with being pairwise disjoint. We then have, In particular,
Proof.
3.1 Adjoint of an affine space and the adjoint multiport
We say are orthogonal duals
of each other iff
By Theorem 1,
Let be an affine space with as its
vector space translate.
We say is the adjoint
of
denoted by
iff
It is easy to see that
It is clear that
Example 7.
Let be an affine device characteristic. Suppose its vector space translate is defined by (is the solution space of) the hybrid equations
(4) |
where is partitioned into Then is the complementary orthogonal space defined by
(5) |
and is obtained by replacing the variables by variables and the variables by variables. It can be seen that is defined by
(6) |
The individual devices which are present will usually have very few ports.
Building their adjoints is therefore computationally inexpensive.
1. Let be a nullator. The adjoint will have its voltage and current
unconstrained and is therefore a norator.
2. Let be a (multiport) impedance.
The adjoint has the characteristic
3. Consider the current controlled voltage source (CCVS)
and the voltage controlled current source (VCCS)
shown below.
(7) |
The adjoints are respectively (built by first building the orthogonal dual of the source zero characteristic, interchanging current and voltage variables and changing the sign of the current variables)
(8) |
Thus the adjoints of CCVS, VCCS remain CCVS,VCCS respectively,
with the same parameters respectively,
but the direction of control which was originally from port to
port is now from port to
port
4. Next consider current controlled current source (CCCS)
and the voltage controlled voltage source (VCVS)
shown below.
(9) |
The adjoints are respectively,
(10) |
Thus the adjoints of CCCS, VCVS are source zero VCVS,CCCS respectively, but the direction of control which was originally from port to port is now from port to port Also the current gain factor is now the negative of the voltage gain factor in the CCCS to VCVS case and vice versa in VCVS to CCCS case.
Let the multiport be on graph with device characteristic on The multiport is on graph but has device characteristic The adjoint of as well as of is on graph but has device characteristic
Let the solution set of be Then the solution set of would be and that of would be
The port behaviour of
would be
that of
would be
and that of
would be
We now have the following basic result on linear multiports [7, 6]. It essentially states that, and have adjoint port behaviours.
Theorem 8.
Let be multiports on the same graph
but with device characteristics
respectively
and port behaviours respectively.
Then if are adjoints of each other
so are adjoints of each other.
Proof.
Let
By Theorem 3, we have
Therefore
Let
It is clear that
Let
and let
We then have,
Thus are adjoints and therefore
and
are adjoints.
∎
Corollary 9.
Let with as the vector space translate of Suppose is the (nonvoid) port behaviour of with as its vector space translate. Then has the port behaviour
Proof.
Remark 1.
1. Suppose the original port behaviour is defined by Its vector space translate is defined by i.e., by
(11) |
is defined by
(12) |
i.e., by Now let every device in the multiport have the form and, further, at the ports let the behaviour be Theorem 8 implies that if every device is replaced by at the ports the behaviour would be But, as the theorem indicates, the idea of the adjoint works well even if we have only a relationship of the kind
2. The devices in a multiport have few device ports. So building their adjoints is easy. Therefore can be built essentially in linear time. Thus we can “implicitly” build, essentially in linear time, the adjoint of the port behaviour of We use “implicitly” because both the port behaviours are available not as explicit equations, but in terms of multiports. This fact is exploited subsequently to generalize Thevenin-Norton and maximum power transfer theorems.
4 Generalization of Thevenin-Norton Theorem
The characteristic feature of the Thevenin-Norton Theorem is that it is in terms of repeated solution of networks obtained by suitable termination of a given multiport. These networks are assumed to have unique solutions. Our generalization of the Thevenin-Norton theorem is in accordance with this feature and requires the notion of a rigid multiport. If a multiport is not rigid, it cannot be a part of a network with unique solution and therefore we cannot use a conventional simulator to solve a network of which the multiport is a part. A rigid multiport can permit any nonvoid port behaviour at its ports. Therefore our generalization of the Thevenin-Norton theorem in terms of rigid multiports is the best that is possible if conventional circuit simulators are to be used to compute the port behaviour. Our technique is to terminate a rigid multiport by its adjoint through a gyrator. We therefore need to prove that the adjoint of a rigid multiport is rigid. We need the development in the next subsection for this purpose.
4.1 Rigid Multiports
Definition 10.
Let multiport
where
The multiport is said to be rigid
iff every multiport
where
has a non void set of
solutions
and has a unique solution corresponding to every vector in its multiport behaviour.
Let be affine spaces on sets respectively, disjoint.
Further, let have vector space translates
respectively.
We say the pair has the full sum property iff
We say the pair has the zero intersection property iff
We say that the pair is rigid,
iff it has the full sum property and the zero intersection property.
Multiport rigidity reduces to affine space pair rigidity and the adjoint of a rigid multiport is also rigid.
Theorem 11.
Let be a rigid pair and let be the vector space translates of respectively. Then
-
1.
The full sum property of is equivalent to being nonvoid, whenever are the vector space translates of respectively. Further, when the full sum property holds for has vector space translate
-
2.
The zero intersection property of is equivalent to the statement that ,
if and then -
3.
The pair has the zero intersection (full sum) property iff has the full sum (zero intersection) property. Therefore is rigid iff is rigid.
-
4.
A multiport is rigid iff and are rigid.
-
5.
A network where is proper, has a unique solution iff where is the vector space translate of has a unique solution.
Proof.
1.
Let
By the definition of matched composition, is nonvoid iff is nonvoid,
i.e., iff is nonvoid,
i.e., iff there exist
such that i.e.,
such that
Clearly when
there exist
such that
so that is nonvoid.
On the other hand, if
there exist such that so that and therefore
is void.
By Theorem 4, if is nonvoid, its vector space translate is
2.
Let
If and
then
and similarly so that
Next suppose whenever and we have
Suppose
Let and let
If then there exists such that and
Clearly
and
so that we must have
But this means
a contradiction.
We conclude that
3. We have,
and
4. By part 1 and 2 above, the rigidity of
is equivalent to the rigidity of
By part 3, the rigidity of the latter is equivalent to the rigidity of
i.e., to the rigidity of
(using Theorem 3), i.e., to the rigidity of
4.2 Terminating a multiport by its adjoint through a gyrator
A conventional linear circuit simulator can process only linear circuits with proper device characteristics. Firther, unless the circuit has a unique solution, the simulator will return an error message. A useful artifice for processing a multiport through a conventional circuit simulator, is to terminate it appropriately so that the resulting network, if it has a solution, has a unique solution. This solution would also contain a solution to the original multiport. We now describe this technique in detail.
Let be representative matrices of vector spaces respectively. Consider the equation
(13) |
First note that the coefficient matrix, in Equation 13, has number of rows equal to (Theorem 1) which is the number of columns of the matrix. Next, suppose the rows are linearly dependent. This would imply that a non trivial linear combination of the rows is the zero vector, which, since the rows of are linearly independent, in turn implies that a nonzero vector lies in the intersection of complementary orthogonal complex vector spaces, i.e., satisfies a contradiction. Thus, if a matrix is made up of two sets of rows, which are representative matrices of complementary orthogonal vector spaces, then it must be nonsingular. Therefore, the coefficient matrix in Equation 13 is nonsingular.
Let the multiport behaviour be the solution space of the equation with linearly independent rows and let be the solution space of the equation Let the dual multiport behaviour be the solution space of equation where the rows of form a basis for the space complementary orthogonal to the row space of
The constraints of the two multiport behaviours together give the following equation.
(14) |
The first and second set of rows of the coefficient matrix of the above equation are linearly independent and span complementary orthogonal spaces. Therefore the coefficient matrix is invertible and the equation has a unique solution. Now suppose we manage to terminate by another multiport in such a way that the port voltage and current vectors of satisfy an equation of the kind (14) above. Then the port voltage and current vectors of would be unique and would uniquely determine the port voltage and current vectors of If both multiports are rigid, this would also uniquely determine the internal voltage and current vectors of both and which means that the network, obtained by terminating by has a unique solution. We show below that we can build by first building and attaching gyrators to its ports.
Let be a rigid multiport on graph and device characteristic and let it have the port behaviour Let be on the copy of with device characteristic By the definition of rigidity, the port behaviour is nonvoid and by Theorem 11, is also rigid. We will now show that the network has a unique solution.
Let be the vector space translate of
and be that of
We note that
Thus the constraints of are
equivalent, as far as the variables
are concerned, to the first set of equations of Equation 14.
Next,
using Theorem 4.
By Corollary 9,
the port behaviour of is
Further,
Thus the constraints of together
with the constraint
(the gyrator ),
are equivalent, as far as the variables
are concerned, to the defining equations of
i.e., to
the second set of equations of Equation 14.
Thus, the constraints of are equivalent as far as the variables are concerned, to the constraints of Equation 14. We have seen that this equation has a unique solution, say Using the gyrator constraints we get a corresponding vector that is the restriction of a solution of to Now Therefore, is the restriction of a solution of to By the rigidity of there is a unique solution of By the rigidity of there is a unique solution of Thus the vector is the unique solution of
The device characteristic is proper because so that dimension of equals Since the network has proper device characteristic and also a unique solution, our conventional circuit simulator can process it and obtain its solution.
We have computed a single vector
We next consider the problem of finding a generating set for the vector space translate
of
Let denote the
affine space that is the solution set of the constraints
Let denote the
affine space that is the solution set of the constraints
Now solve for each and for each (see Figure 1(b) and 1(c)). (We remind the reader that is obtained from by replacing its device characteristic by the vector space translate )
We prove below, in Lemma 12, that each solution yields a vector in and the vectors corresponding to all form a generating set for
We summarize these steps in the following Algorithm.
Algorithm I
Input: A multiport on with affine
device characteristic
Output: The port behaviour of if
is rigid.
Otherwise a statement that is not rigid.
Step 1. Build the network on graph
with device characteristic
where is the vector space translate of
and
(see Figure 1(a).)
Find the unique solution (if it exists) of and restrict it to
to obtain
The vector belongs to
If no solution exists or if there are non unique solutions output ‘ not rigid’ and
STOP.
Step 2. Let be obtained by replacing
the device characteristic by in
For build and solve and restrict it to
to obtain (see Figure 1(b).)
The vector
For build and solve and restrict it to
to obtain The vector
(see Figure 1(c).)
Step 3. Let be the span of the vectors
Output
STOP
We complete the justification of Algorithm I in the following lemma.
Lemma 12.
Let be rigid. Let be the port behaviour of and let be the vector space translate of Then the following hold.
-
1.
The network has a proper device characteristic and has a unique solution.
-
2.
Each of the networks has a unique solution and restriction of the solution to gives a vector such that or a vector such that
-
3.
The vectors form a generating set for
Proof.
We only prove parts 2 and 3 since part 1 has already been shown.
2. If we replace the device characteristic
of
or that of or that of by its vector space translate, i.e., by
we get the device characteristic of All three networks have the same graph
By part 5 of Theorem 11,
a linear network with a proper device characteristic, has a unique solution iff has a unique solution.
We know that has a proper device characteristic and has a unique solution. Thus
has a unique solution and therefore also and
The restriction of a solution of or of
to gives a solution of Its restriction to gives By Theorem 5,
3. Let be the solution space of
and let
be the solution space of
where the row spaces of are complementary
orthogonal.
A vector being the restriction of a solution of to
is equivalent to being a solution to the equation
(15) |
and a vector being the restriction of a solution of to is equivalent to being a solution to the equation
(16) |
where denotes the column of a identity matrix. In the variables Equation 15 reduces to
(17) |
and Equation 16 reduces to
(18) |
It is clear that a vector belongs to iff it is a solution of
(19) |
for some vector The space of all such vectors is the column space of the matrix Noting that, for any matrix the product is the column of we see that the solutions, for of Equations 17 and 18, span
∎
Remark 2.
If the multiport is not rigid, it may not have a solution and then the port behaviour would be void. Even if the multiport has a solution, so that the behaviour is nonvoid, the above general procedure of solving will yield non unique internal voltages and currents in the multiports Therefore, will have non unique solution. (In both the above cases our conventional circuit simulator would give error messages.) Thus has a unique solution iff is rigid.
5 Maximum power transfer for linear multiports
The original version of the maximum power transfer theorem, states that a linear -port transfers maximum power to a load if the latter has value equal to the adjoint (conjugate transpose) of the Thevenin impedance of the -port. In the multiport case the Thevenin equivalent is an impedance matrix whose adjoint has to be connected to the multiport for maximum power transfer. These should be regarded as restricted forms of the theorem since they do not handle the case where the Thevenin equivalent does not exist.
It was recognized early that a convenient way of studying maximum power transfer is to study the port conditions for which such a transfer occurs [1, 5]. We will use this technique to obtain such port conditions for an affine multiport behaviour. In the general, not necessarily strictly passive, case, we can only try to obtain stationarity of power transfer, rather than maximum power transfer. After obtaining these conditions we show that they are in fact achieved, if at all, when the multiport is terminated by its adjoint (which is easy to build), through an ideal transformer. This means that the multiport behaviour need only be available as the port behaviour of a multiport and not explicitly, as an affine space
5.1 Stationarity of power transfer for linear multiports
We fix some preliminary notation needed for the discussion of the maximum power transfer theorem. For any matrix we take to be the conjugate and to be the conjugate transpose. Our convention for the sign of power associated with a multiport behaviour is that when the power absorbed by the multiport behaviour is (We omit the scale factor for better readability of the expressions involved.) The power delivered by it, is therefore the negative of this quantity.
The maximum power transfer problem is
(20) | |||
(21) |
If is a stationary point for the optimization problem 20 , we have
(22) |
for every vector such that Therefore, Equation 22 is satisfied iff, for some vector
Thus the stationarity at is equivalent to
Since we must have
the stationarity condition reduces to
(23) |
The vector space translate, of is the solution space
of the equation,
and is the row space of
Thus, the stationarity condition says that
belongs to
In the case where the multiport has a Thevenin impedance and Thevenin voltage the above
stationarity condition reduces to the condition (see example in Section 1).
We note that, even when the multiport is rigid, Equation 23 may have no solution, in which case we have no stationary vectors for power transfer. If the equation has a unique solution, using that vector we get a unique stationary vector We next show that the stationarity condition is achieved at the ports of the multiport if we terminate it by through the ideal transformer resulting in the network where the ideal transformer satisfies the equations
Theorem 13.
Let on graph and device characteristic have the port behaviour Let be the vector space translates of respectively. Let be on the disjoint copy of with device characteristic
-
1.
A vector is the restriction of a solution of the network to iff
-
2.
Let Then satisfies stationarity condition with respect to the power absorbed by iff
-
3.
Let be the restriction of a solution of the multiport to Then satisfies the stationarity condition with respect to the power absorbed by iff is the restriction of a solution of the network to
Proof.
1. The restriction of the set of solutions of on graph to
is
This is the same as
The restriction of the set of solutions of on the disjoint copy of to is
This we know, by Corollary 9,
to be the same as
The restriction of the set of solutions of to is
We thus have,
since vectors in are precisely the ones that satisfy
The restriction of the set of solutions of
to is therefore equal to
Part 2 follows from the discussion preceding the theorem and part 3 follows from part 1 and part 2. ∎
5.2 Maximum Power Transfer Theorem for passive multiports
We show below that the stationarity conditions of the previous subsection reduce to maximum power transfer conditions when the multiport is passive.
The power absorbed by a vector
is given by
A vector space is passive, iff
the power absorbed by is nonnegative,
whenever
It is strictly passive iff
the power absorbed by every nonzero vector in is positive.
An affine space is (strictly) passive iff its vector space translate is (strictly) passive.
A multiport is (strictly) passive iff its port behaviour
is (strictly) passive.
We now have a routine result which links passivity of the device characteristic of a multiport to its port behaviour. (A cutset of a graph is a minimal set of edges which when deleted increases the number of connected components of the graph, equivalently, in the case of a connected graph, is a minimal set of edges not contained in any cotree.)
Lemma 14.
Let be a multiport on graph with device characteristic
-
1.
If is passive so is the port behaviour of
-
2.
If is strictly passive and contains no loops or cutsets of then the port behaviour of is also strictly passive.
Proof.
1. We assume that is nonvoid. We have,
where
By Theorem 3,
By Theorem 4, it follows that the vector space translate
of is
Let belong to
Then there exist and
such that
By the orthogonality of it follows that
and
by the passivity of it follows that
Therefore
2. Without loss of generality, we assume that the graph is connected.
If contains no cutset or circuit of then contains both
a tree as well as a cotree of
If the voltages assigned to the branches of a tree are zero, the branches
in its complement will have zero voltage. Therefore
must necessarily be a zero vector space.
If the currents in the branches of a cotree are zero the branches
in its complement will have zero current. Therefore
must necessarily be a zero vector space.
Now let
As in part 1 above, there exist and
such that
Since
and are both zero vector spaces,
we must have that so that,
by strict passivity of we have
Further so that
we can conclude
∎
When a port behaviour is passive or strictly passive, by taking into account second order terms, we can show that the stationarity condition implies a maximum power delivery condition.
Let satisfy the stationarity condition
for some
For any i.e., such that we can write
We then have and
Therefore
We can rewrite the right side as
Applying the condition
this expression reduces to
Therefore,
If is passive we have
so that
Equivalently, the power delivered
by is maximum when
If is strictly passive we have
whenever
so that
is the unique maximum delivery vector in
By Lemma 14, if a multiport is passive, so is its port behaviour. Therefore, Equation 23 also gives the condition for maximum power transfer from a passive
We thus have, from the above discussion, using Theorem 13, the following result.
Theorem 15.
Let on graph and with passive device characteristic have the port behaviour Let be the vector space translate of Let be on the disjoint copy of with device characteristic
-
1.
Let Then satisfies
(24) iff
-
2.
Let be the restriction of a solution of the multiport to Then satisfies the optimization condition in Equation 24, iff is the restriction of a solution of the network to
Remark 3.
Let be strictly passive. If or belongs to its strict passivity is violated. Therefore as well as must be zero and consequently as well as must equal using Theorem 2. Let be the representative matrix of It is clear that are nonsingular so that by invertible row transformation, we can reduce to the form or We then have The strict passivity is equivalent to being positive definite. In this case is invertible and maximum transfer port condition is unique.
6 Conclusions
We have given a method for computing the port behaviour of linear multiports using standard circuit simulators which are freely available. This will work for linear multiports which have non void solutions for arbitrary internal source values and further have a unique internal solution corresponding to a port condition consistent with the port behaviour. The procedure involves termination by the adjoint multiport through a gyrator. The above procedure can be regarded as the most general form of Thevenin-Norton theorem according to the view point that the theorem involves the computation of the unique solutions of certain circuits which result by some termination of the linear multiport.
We have used termination by the adjoint multiport through an ideal transformer to give a condition for maximum power transfer for general linear multiports. This is the most general form of the Maximum power transfer theorem that is possible in terms of stationarity of power delivered.
Data availability statement
The authors confirm that
there is no associated data for this manuscript.
Acknowledgements
Hariharan Narayanan was partially supported by a Ramanujan Fellowship.
References
- [1] C. A. Desoer, The Maximum Power Transfer Theorem for n-Ports, IEEE Transactions on Circuit Theory, (1973) 328–330.
- [2] C. A. Desoer & E. S. Kuh, Basic circuit theory, McGraw-Hill, New York, 1969.
- [3] G. D. Forney & M. D. Trott, The Dynamics of Group Codes : Dual Abelian Group Codes and Systems, IEEE Transactions on Information Theory 50 (11) (2004)
- [4] H. F. Mayer, Ueber das Ersatzschema der Verstärkerröhre [On equivalent circuits for electronic amplifiers], Telegraphen- und Fernsprech-Technik (in German), 15: (1926) 335–337.
- [5] H. Narayanan, On the maximum power transfer theorem, Int. J. Elect. Enging Educ., 15 (1978) 161–167.
- [6] H. Narayanan, A Unified Construction of Adjoint Systems and Networks, Circuit Theory and Applications 14 (1986) 263–276.
-
[7]
H. Narayanan, Submodular Functions and Electrical Networks, Annals of Discrete
Mathematics, vol. 54, North Holland, Amsterdam, 1997.
Open 2nd edition, http://www.ee.iitb.ac.in/ hn/ , 2009. - [8] H. Narayanan, Implicit Linear Algebra and its Applications, arXiv:1609.07991v1 [math.GM] (2016).
- [9] E. L. Norton, Design of finite networks for uniform frequency characteristic, Bell Laboratories, Technical Report TM26–0–1860 (1926).
- [10] B. D. H. Tellegen, A general network theorem, with applications, Philips Res. Rept., 7 (1952) 259–269.
- [11] L. Thevenin, Extension of Ohm’s law to complex electromotive circuits, Annales Telegraphiques, 1883.
- [12] W. T. Tutte, Lectures on matroids, Journal of Research of the National Bureau of Standards, B69 (1965) 1–48.
- [13] A. J. van der Schaft, Interconnection and geometry, in The Mathematics of Systems and Control: from Intelligent Control to Behavioral Systems, Editors J.W. Polderman, H.L. Trentelman, Groningen, 203–218, 1999.