Building Power Plant


CHAPTER 7


Building Power Plant


7.1    INTRODUCTION


Any power plant consists of a number of generators. The present chapter presents each generator with two or more states that the generator is passing through. The generator status represented in a matrix form. To combine the generators, a special type of mathematics needed and illustrated. The matrix dimension is the form based on the generator status. The present chapter starts with the basic definitions and properties of the Kronecker product of matrices. At the same time, it should be noted that the Kronecker products have many applications such as image processing, signal processing, and other applications. In the present chapter, the Kronecker technique presented and applied to the power plant, where it is forming a power station. The Kronecker results compared with direct differentiation results. The conclusion reached with that the Kronecker product is more convenient and simpler than the direct differentiation method (Society for Industrial and Applied Mathematics, 2005).


7.2    KRONECKER MULTIPLICATION


The general rule for Kronecker multiplication shown by considering two subsystems A and B, where the subsystem is illustrated more clear later in the real cases of applications (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018).


A=[a11a12a21a22]andB=[b11b12b21b22]


Then multiplication of A B defined as:


A B =[a11Ba12Ba21Ba22B]


where: ⊗ defined as Kronecker multiplication sign


AB=[a11[b11b12b21b22]a12[b11b12b21b22]a21[b11b12b21b22]a22[b11b12b21b22]]=[a11b11a11b12a12b11a11b12a11b21a11b22a12b21a12b22a21b11a21b12a22b11a22b12a21b21a21b22a22b21a22b22]


In the reliability study, the system is passing through two-state models or more. Therefore, it will generalize as n-number of states that represented as follows:


Let


A=[a11a12a1na21a22a2nan1an2ann]


and


B=[b11b12b1nb21b22b2nbn1bn2bnn]


Then A ⊗ B is defined as:


[a11[b11b12b1nb12b22b2nb1nb2nbnn]a12[b11b12b1nb12b22b2nb1nb2nbnn]a1n[b11b12b1nb12b22b2nb1nb2nbnn]a21[b11b12b1nb12b22b2nb1nb2nbnn]a22[b11b12b1nb12b22b2nb1nb2nbnn]a2n[b11b12b1nb12b22b2nb1nb2nbnn]a1n[b11b12b1nb12b22b2nb1nb2nbnn]a2n[b11b12b1nb12b22b2nb1nb2nbnn]ann[b11b12b1nb12b22b2nb1nb2nbnn]]


The general shape is as shown above for n number of states for both systems.


7.3    RULES AND PROPERTIES FOR KRONECKER PRODUCTS


Using the above definition of multiplication (Broxson, 2006 and Van Loan, 2000), the ensuring results can be illustrated in the coming sub-sections (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018).


7.3.1    SCALAR MULTIPLICATION (SHAKERI ET AL., 2016; MARIET ET AL., 2016; KEPNER ET AL., 2018)


In the case of n is a scalar, then







A(nB)=n(AB)


(1)


Proof:


The (i, j)th block of A ⊗ (nB) is


[aij(nB)]=n[aijB]=n[(i,j)thblockofAB]


7.3.2    MATRIX SUM AND PRODUCTS ASSOCIATION


In the case of matrix summation associated with Kronecker multiplication, the following are the results obtained (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018):







1.(A+B)C=AC+BC


(2)







2.A(B+C)=AB+AC


(3)


Proof:



1.  The (i, j)th block of LHS (A + B) ⊗ C is (aij + bij) C


Therefore, the (i, j)th of RHS is


AC+BC isAijC+bijC=(aij+bij)C


Since the two blocks are equal for every (i, j), the result follows.


2.  The (i, j)th block of the LHS A ⊗ (B + C) is A ⊗ (bij + cij)


Therefore, the (i, j)th block of the other side is


A(bij)+A(cij)=A(bij+cij)


Since the two blocks are equal for every (i, j), the result follows.


7.3.3    PRODUCT ASSOCIATION


The product of a number of matrices is presented as (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018):







A(BC)=(AB)C


(4)


7.3.4    MIXED PRODUCT


The mixed product of a number of matrices is presented as (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018):







(AB).(CD)=A.CB.D


(5)


7.3.5    KRONECKER SUM


Consider the two masteries A(n × n) and B(m × m), then the following (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018), the Kronecker sum can be defined by the following expression:







AB=AIm+InB


(6)


where:



Im is a unit matrix (m × m);


In is a unit matrix (n × n).


7.4    KRONECKER PRODUCT MODELING


Consider a power station (Shakeri et al., 2016; Broxson, 2006; Mariet et al., 2016; Kepner et al., 2018) with three generating-units as shown in Figure 7.1 and represented by the differential equation describing the subsystem (generating-unit) that can be written as:



Image
FIGURE 7.1    Three sub-systems (generators).

dP1(t)dt=T(1)P(t)(1)dP2(t)dt=T(2)P(t)(2)dP3(t)dt=T(3)P(t)(3)


Let







Q(t)=P(t)(1)P(t)(2)P(t)(3)


(7)


where: Q(t) is an equivalent system probability; T(i) is the transition rate matrix for i-th subsystem; P(i) (t) is an i-th column probability vector for the i-th subsystem.


dQ(t)dx=dP(t)(1)/dtP(t)(2)P(t)(3)+P(t)(1)dP(t)(2)/dtP(t)(3)+P(t)(1)P(t)(2)dP(t)(3)/dt=T(1)P(t)(1)P(t)(2)P(t)(3)+P(t)(1)T(2)P(t)(2)P(t)(3)+P(1)P(t)(2)T(3)P(t)(3)


Consider the first term of equation:


T(1)P(t)(1)P(t)(2)P(t)(3)=[(T(1)I(2))(P(t)(1)P(t)(2)]P(t)(3)=[T(1)I(2)I(3)]P(t)(1)P(t)(2)P(t)(3)=[T(1)I(2)I(3)]Q(t)


Consider the second term of the equation:


P(t)(1)T(2)P(t)(2)P(t)(3)=P(t)(1)(T(2)P(t)(2)I(3)P(t)(3))=P(t)(1)[(T(2)I(3))(P(t)(2)P(t)(3))]=I(1)P(t)(1)(T(2)I(3))(P(t)(2)P(t)(3))=(I(1)T(2)I(3))(P(t)(1)P(t)(2)P(t)(3))=(I(1)T(2)I(3))Q(t)P(t)(1)P(t)(2)T(3)P(t)(3)=P(t)(1)[(I(2)T(3))(P(t)(2)P(t)(3))]=(I(1)I(2)T(3))P(t)(1)P(t)(2)P(t)(3)=(I(1)I(2)T(3))Q(t)


Therefore, the equivalent system equation becomes as:


dQ(t)dt=[{T(1)I(2)I(3)}Q(t)+{I(1)T(2)I(3)Q(t)}+{I(1)I(2)T(3)}Q(t)]=[{T(1)I(2)I(3)}+{I(1)T(2)I(3)}+{I(1)I(2)T(3)}]Q(t)=[T(1)T(2)T(3)]Q(t)


The summation of the transition rate matrix, the Kronecker summation becomes:


T(1)T(2)T(3)=[A1μ3μ20μ1000λ3A20μ20μ100λ20A3μ300μ100λ2λ3A4000μ1λ1000A5μ3μ200λ100λ3A60μ200λ10λ20A7μ3000λ10λ2λ3A8]


where:


A1=λ1+λ2+λ3A2=λ1+λ2+μ3A3=μ1+μ2+λ3A4=λ1+μ2+μ3A5=μ1+λ2+λ3A6=μ1+λ2+μ3A7=μ1+μ2+λ3A8=μ1+μ2+μ3


which is identical to the transition rate matrix obtained in Section 7.5.1 by more means that are laborious.


7.5    SYSTEM BUILDING


Systems formed by combining a number of simpler subsystems (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018). The availability of each component described by


dP(t)dt=AP(t)


However, it is often hard to derive an overall formula for the whole system from the equations describing the subsystems. Such knowledge is necessary in order to obtain an understanding of the total system structure and in particular intersection between subsystems. This is mainly attractive if one needs to introduce common mode failures.


The sub-system matrices are the first step to build the overall matrix representing a large system by an iterative procedure, which systematically, adds each sub-system to the other. The equivalent transition matrix formed from the knowledge of each sub-system failure and repair rates.


Two different methods are discussed in the present chapter. These two methods are direct differentiation and the use of the Kronecker product. Both methods are used to obtain the equivalent transition matrix (Broxson, 2006; Van Loan, 2000), which a mathematical representation of a power station in this research.


7.5.1    SYSTEM BUILDING USING KRONECKER TECHNIQUE


As stated earlier, the Kronecker multiplication is a powerful tool to build the transition rate matrix. Therefore, the Kronecker algebra can easily present any large system by combining all the sub-systems under it. Then, using Kronecker algebra in system building, a Matlab function found to use Kronecker algebra. Furthermore, this function is not within the Matlab program yet (Shakeri et al., 2016; Mariet et al., 2016; Kepner et al., 2018).


As mentioned earlier, the Kronecker sum is:







AB=AIm+InB


(8)


where:



Im is a unit matrix (m × m);


In is a unit matric (n × n).


In the system building function, the size of each sub-system is 2 × 2, this came from the equation


dP1(t)dt=λP1(t)+μP2(t)dP2(t)dt=+λP1(t)μP2(t)


So each sub-system matrix will be as of:


Un=[λnμnλnμn]


The size of the unit matrix will be 2 × 2. The overall size of the transition rate matrix can be calculated from the number of sub-systems (n) as follows:


Transition rate matrix = 2n.


Let a system contain two sub-systems A and B. Then:


Transition rate matrix = A ⊗ B = A ⊗ IB + IA ⊗ B


A=[a11a12a21a22]andB=[b11b12b21b22]


Then,


AIB=[a11a12a21a22][1001]


and


IAB=[1001][b11b12b21b22]AIB=[a11a12a21a22][1001]=[a11[1001]a12[1001]a21[1001]a22[1001]]IAB=[1001][b11b12b21b22]=[1[b11b12b21b22]0[b11b12b21b22]0[b11b12b21b22]1[b11b12b21b22]][a11[1001]a12[1001]a21[1001]a22[1001]]=[a110a1200a110a12a210a2200a210a22][1[b11b12b21b22]0[b11b12b21b22]0[b11b12b21b22]1[b11b12b21b22]]=[b11b1200b21b220000b11b1200b21b12]


Then


AB=AIB+IAB=[a110a1200a110a12a210a2200a210a22]+[b11b1200b21b220000b11b1200b21b22]


Then the transition rate matrix for system containing two subsystems A and B are:


AB=AIB+IAB=[a11+b11b12a120b21a11+b220a12a210a22+b11b210a21b21a22+b22]


It should be noted that the Kronecker multiplication of a two-unit matrix with the same size is equal to doubling the size of the matrix, i.e., let I1 size 2 × 2; I2 size 2 × 2 and I3 size 2 × 2, then







I1I2=Isize4×4I1I2I3=Isize8×8


(9)


Proof:


I1I2=[1001][1001]=[1[1001]0[1001]0[1001]1[1001]]=[1000010000100001]


I1 ⊗ I2 ⊗ I3 =


[1000010000100001][1001]=[1[1001]0[1001]0[1001]0[1001]0[1001]1[1001]0[1001]0[1001]0[1001]0[1001]1[1001]1[1001]0[1001]0[1001]0[1001]1[1001]]


Then,


I1I2I3=[1000000001000000001000000001000000001000000001000000001000000001]


Three sub-systems A, B, and C then the transition rate matrix equal to:


ABC=AIBICIBBIC+IAIBC


It is well known that the Kronecker Multiplication step:


A ⊗ IB ⊗ IC = A ⊗ I (where I size 4 × 4)


IB ⊗ B ⊗ IC =


[a11a12a21a22][1000010000100001]=[a11[1000010000100001]a12[1000010000100001]a21[1000010000100001]a22[1000010000100001]]=[a11000a120000a11000a120000a11000a120000a11000a12a21000a220000a21000a220000a21000a220000a21000a22]IBBIC=[1001][b11b12b21b22][1001]=[1[b11b12b21b22]0[b11b12b21b22]0[b11b12b21b22]1[b11b12b21b22]][1001]=[b11b1200b21b220000b11b1200b21b22][1001]=[b11[1001]b12[1001]0[1001]0[1001]b21[1001]b22[1001]0[1001]0[1001]0[1001]0[1001]b11[1001]b12[1001]0[1001]0[1001]b21[1001]b22[1001]]=[b110b12000000b110b120000b210b22000000b210b2200000000b110b12000000b110b12000000b22000000b210b22]IAIBC=[1000010000100001][c11c12c21c22]=[1[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]1[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]1[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]0[c11c12c21c22]1[c11c12c21c22]]=[c11c12000000c21c2200000000c11c12000000c21c2200000000c11c12000000c21c2200000000c11c12000000c21c22]


Therefore, the Kronecker summation


ABC=AIBIC+IBBIC+IAIBC=[a11000a120000a11000a120000a11000a120000a11000a12a21000a220000a21000a220000a21000a220000a21000a22]+[b110b12000000b110b120000b210b2200000000b2200000000b110b12000000b110b120000b110b12000000b210b22]+[c11c12000000c21c2200000000c11c12000000c21c2200000000c11c12000000c21c2200000000c11c12000000c21c22]=[z1c12b120a12000c21z20b120a1200b210z3c1200a1200b210z4000a12a21000z5c12000a2100c21z60000a210b210z7c12000a210b21c21z8]


where:


z1=a11+b11+c11z2=a11+b11+c22z3=a11+b22+c11z4=a11+b22+c22z5=a22+b11+c11z6=a22+b11+c22z7=a22+b22+c11z8=a22+b22+c22


From the above examples, the Kronecker Sum can be generalized in the following equation:


A1A2An=A1I1I2In+I1A2I3In+I1I2In1An


In case, the evaluation of electric power plant is required. Therefore, the Kronecker is applied. For the different electric power plant, the reliability evaluation is required. As an example, five generators are assumed, and their data represented in Table 7.1. The results of combinations for the five generators are 32 steady-state probabilities are calculated and recorded in Table 7.2, where each generating-unit assumed to pass through two states. It should be noted that (1) means the generating-unit is ON and (0) means the generating-unit is OFF. Furthermore, it is assumed that each generator is working with its full capacity.


The calculation of the number of states that the five generators are passing through can be calculated as:


NumberofStatesthatsystempassingthrough(FiveConnectedGenerators)=25


where:



2  represent the number of states that each generator is passing through;


5  represent the number of generators.

Only gold members can continue reading. Log In or Register to continue

Aug 1, 2021 | Posted by in Electrical Engineer | Comments Off on Building Power Plant
Premium Wordpress Themes by UFO Themes