# Generalized Quadratic Linearization of Machine Models

Authors: Parvathy Ayalur Krishnamoorthy; Kamaraj Vijayarajan; Devanathan Rajagopalan
Journal: Journal of Control Science and Engineering
 (2011)

---

## Abstract

In the exact linearization of involutive nonlinear system models, the issue of singularity needs to be addressed
in practical applications. The approximate linearization technique due to Krener, based on Taylor series expansion, apart from being applicable to noninvolutive systems, allows the singularity issue to be circumvented. But approximate linearization, while removing terms up to certain order, also introduces terms of higher order  than those removed into the system. To overcome this problem, in the case of quadratic linearization, a new concept called
“generalized quadratic linearization” is introduced in this paper, which seeks to remove quadratic terms without introducing third- and higher-order terms into the system. Also, solution of generalized quadratic linearization of a class of control affine systems is derived. Two machine models are shown to belong to this class and are reduced to only linear terms through coordinate and state feedback. The result is applicable to other machine models as
well.


---

## Body

## 1. Introduction

Control of nonlinear systems is gaining increasing attention in recent years due to its technical importance and its impact on various applications as well. When nonlinearities of systems become significant, linear control techniques generally fail to produce the desired results. However, feedback linearization of nonlinear systems allows linear control methods to be applied effectively to the resultant linearized system.In the application of exact linearization technique [1–3] to involutive systems, an issue of singularity needs to be addressed in practical situations. The singularity is caused when a function of the system state tends towards zero causing the state feedback to fail. Approximate linearization technique due to Krener [4] based on a Taylor series expansion, applicable to non-involutive systems, has the merit of allowing the problem of singularity to be overcome.Poincare [5] derived what are known as homological equations for approximate linearization of autonomous differential systems. Kang and Krener [6–8] extended the result for the approximate linearization of control affine systems and derived what are termed generalized homological equations. Tall  [9, 10] extended Kang and Krener's normal forms to multi-input systems. Devanathan [11, 12] developed necessary and sufficient conditions for quadratic linearization of control affine systems with a single input.Using the approximate linearization technique, the problem of singularity of state feedback can be circumvented by appropriate definition of state feedback. But the approximate linearization, while removing nonlinearities up to a certain higher order, introduces nonlinearities into the system of higher order than those removed. Introduction of higher-order nonlinearities into a system which originally may not have such nonlinearities is a matter of concern.In the case of machine models, for example, the second-order dynamic models as given in [13] seem adequate to describe the normal behaviour of the machine. Applying quadratic linearization based on approximate linearization technique to this model introduces third- and higher-order terms into the model even though the machine does not possess nonlinearities of this order during normal operation.In this paper, a new concept called “generalized quadratic linearization” which seeks to remove the second-order nonlinearity in the model without introducing third-and higher-order nonlinearities in the process is introduced. This is in contrast to the existing quadratic linearization techniques due to Kang and Krener [6–8] and Devanathan [11, 12] which introduce third- and-higher order terms in the process of removing second-order terms. The generalized quadratic linearization, being a stronger condition than quadratic linearization, imposes additional constraints on the quadratic polynomials of the system than those imposed due to quadratic linearization alone. Sufficient conditions on the quadratic polynomials together with coordinate and state feedback transformations are derived for a class of systems for which generalized quadratic linearization is applicable. In particular, the results are shown to apply to the induction motor and permanent magnet synchronous motor models. The results can be extended to other machine models as well. Application of generalized quadratic linearization to machine models also helps to avoid the issue of singularity which is a drawback attributed to the existing exact linearization of machine models [2, 3]. This is the main contribution of the paper.To summarise the rest of the paper, in Section2, homological equations for arbitrary order linearization are introduced. Section 3 helps to simplify the homological equations for quadratic linearization, thus paving the way for the central result on generalized quadratic linearization presented in Section 4. In Section 5, generalized quadratic linearization is applied to two machine models including a real-world numerical example. In Section 6, the paper is concluded.


## 2. Background

Consider a multiple-input control affine system of the form [7, 14, 15] (1)ẋ=Ax+Bu+f(2)(x)+f(3)(x)+⋯+f(p)(x)+⋯+g(1)(x)u+g(2)(x)u+⋯+g(p-1)(x)u+⋯,
where (A,B) are in Brunovsky normal form. That is, let k={k1,k2,…,kr} be a sequence of integers such that k1≥k2≥⋯≥kr such that k1+k2+⋯+kr=n(2)A=[Ak10⋯00Ak2⋯0⋮⋮⋮⋮00⋯Akr],B=[bk10⋯00⋯00bk2⋯00⋯0⋮⋮⋮⋮⋮⋮⋮00⋯bkr0⋯0],
where matrix A is partitioned into r2 blocks while matrix B is partitioned into μr blocks with r≤μ. Each block Aki or bki is  of the form (3)Aki=[010⋯0001⋯0⋮⋮⋮⋮⋮000⋯1000⋯0],bki=[00⋮01].Aki is of order ki×ki, bki is of order ki×1, and B is n×μ matrix. x=[x1,x2,…,xn]T and u=[u1,u2,…,uμ]T are the vector input such that μ<n. f(p)(x) and  g(p-1)(x) are vector polynomials of order p and (p-1), respectively, p=2,3,….In order to linearize the system, change of coordinate and state feedback [6] of the following form is considered: (4)y=x+ϕ(x),u=(Iμ+β(x))v+α(x),
where (5)ϕ(x)=∑j=2,3,4,…ϕ(j)(x),α(x)=∑j=2,3,4,…α(j)(x),β(x)=∑j=2,3,4,…β(j-1)(x),
and Iμ is the identity matrix of order μ. Applying the transformations (4), (1) is reduced to (6)ẏ=Ay+Bv
provided the following equations, called homological equations [6], are satisfied for m≥2: (7)-Aϕ(m)(x)+Bα(m)(x)+f′(m)(x)+∂ϕ(m)(x)∂xAx=0,(8)Bβ(m-1)(x)v+∂ϕ(m)(x)∂xBv+g′(m-1)(x)v=0,∀v,
where f′(m)(x)=f(m)(x) for m=2 and f′(m)(x) is expressed in terms of f(m-i)(x),i=0,1,2,…(m-2), and ϕ(m-j)(x),j=1,2,…(m-2),m>2. g′(m-1)(x)=g(1)(x); m=2, and g′(m-1)(x) is expressed in terms of g(m-i)(x),i=1,2,…(m-1),  and ϕ(m-j)(x),j=1,2,…(m-2),m>2.


## 3. Quadratic Linearization

Consider the specialized case of system (1) containing only quadratic terms in x as in (9)ẋ=Ax+Bu+f(2)(x).
Quadratic linearization of (9) involves specialization of the result discussed in Section 2 for m=2 and simplifying it by applying g(1)(x)=0. That is, applying the following coordinate transformation and feedback, (10)y=x+ϕ(2)(x),u=(Iμ+β(1)(x))v+α(2)(x),(9) is reduced to (11)ẏ=Ay+Bv+O(3)(y,v),
where O(3)(y,v) corresponds to terms of order 3 or higher, provided the following equations are satisfied: (12)-Aϕ(2)(x)+Bα(2)(x)+f(2)(x)+∂ϕ(2)(x)∂xAx=0,(13)Bβ(1)(x)v+∂ϕ(2)(x)∂xBv=0,∀v.Remark 3.1.
Applying quadratic linearization to system (9) introduces third- and higher-order terms into the system (see (11)) even though originally the system does not possess nonlinearities of this order. To avoid this situation, we introduce a new concept of generalized quadratic linearization which seeks to remove the second-order nonlinearity in the system without introducing third- and higher-order nonlinearities in the process. Sufficient conditions for the generalized quadratic linearization for a class of systems are discussed in the next section.We next simplify the homological equations (12) and (13) by representing them in partitioned form, using the Brunovsky normal form introduced in Section 2.Let(14)ϕ(2)(x)=[ϕk1(2)(x)ϕk2(2)(x)⋮ϕkr(2)(x)],(15)x=[xk1xk2⋮xkr],(16)f(2)(x)=[fk1(2)(x)fk2(2)(x)⋮fkr(2)(x)],(17)α(2)(x)=[α1(2)(x)α2(2)(x)⋮αμ(2)(x)],
where putting pi=∑iki,i=1,2,…r,(18)ϕki(2)(x)=[ϕpi-1+1(2)(x)⋮ϕpi-1+t(2)(x)⋮ϕpi-1(2)(x)ϕpi(2)(x)],(19)xki=[xpi-1+1⋮xpi-1+t⋮xpi-1xpi],(20)fki(2)(x)=[fpi-1+1(2)(x)⋮fpi-1+t(2)(x)⋮fpi-1(x)fpi(2)(x)],(21)∂ϕ(2)(x)∂x=[ϕk1,k1(2)ϕk1,k2(2)⋯ϕk1,kr(2)ϕk2,k1(2)ϕk2,k2(2)⋯ϕk2,kr(2)⋮⋮⋮⋮ϕkr,k1(2)ϕkr,k2(2)⋯ϕkr,kr(2)],
where (22)ϕki,kj(2)=[∂ϕpi-1+1(2)(x)∂xpj-1+1⋯∂ϕpi-1+1(2)(x)∂xpj⋮⋮⋮∂ϕpi-1+t(2)(x)∂xpj-1+1⋯∂ϕpi-1+t(2)(x)∂xpj⋮⋮⋮∂ϕpi(2)(x)∂xpj-1+1⋯∂ϕpi(2)(x)∂xpj],i,j=1,2,…r,β(1)(x)=[β1(1)(x)β2(1)(x)⋮βμ(1)(x)],
where
(23)βi(1)(x)=[βi,1(1)(x),βi,2(1)(x),…,βi,μ(1)(x)],i=1,2,…,μ.Using (2), (14)–(17), and (21), the ith block row of (12) can be written as (24)-Akiϕki(2)(x)+bkiαi(2)(x)+fki(2)(x)+∑j=1rϕki,kjAkjxkj=0,i=1,2,…,r.
The second homological equation, namely, (13), can be simplified as follows. Since the effect of control input u in (9) is dependent on the B matrix only, without loss of generality, we can then assume that μ=r, because the terms in B matrix are nonzero only for the first r inputs. So, we can write the revised B matrix as (25)B=[bk10⋯00bk2⋯0⋮⋮⋮⋮00⋯bkr].We now put (13) in partitioned form. Using (2) and (21)–(23), the ith block row of (13) can be written as (26)bkiβi(1)(x)v+[ϕki,k1bk1ϕki,k2bk2⋯ϕki,krbkr]v=0∀v,i=1,2,…,r.Since (26) is to be an identity in v, we can drop v and rewrite (26) as (27)[00⋯000⋯000⋯0⋮⋮⋮⋮⋮⋮⋮⋮00⋯0βi,1(1)(x)βi,2(1)(x)⋯βi,r(1)(x)]+[∂ϕpi-1+1(2)(x)∂xp1⋯∂ϕpi-1+1(2)(x)∂xpr⋮⋮⋮∂ϕpi-1+t(2)(x)∂xp1⋯∂ϕpi-1+t(2)(x)∂xpr⋮⋮⋮∂ϕpi(2)(x)∂xp1⋯∂ϕpi(2)(x)∂xpr]=0,i=1,2,…,r.
Since βi,l(1)(x),l=1,2,…,r, are arbitrary, it is clear that a necessary condition for (13) to be satisfied is (28)∂ϕpi-1+t(2)(x)∂xpq=0,q=1,2,…,r,t=1,2,…,(ki-1),i=1,2,…,r.


## 4. Generalized Quadratic Linearization

Theorem 4.1.
Consider the system(29)ẋ=Ax+Bu+f(2)(x),
where x=[x1,x2,…,xn]T and  u=[u1,u2,…,ur]T,n>r. (A,B) are in Brunovsky normal form as given in (2), (3), and (25). f(2)(x) is given by (16), where
(30)fki(2)(x)={[0⋮0fpi-1(2)(x′)fpi(2)(x)],ki>2,[fpi-1(2)(x′)fpi(2)(x)],ki=2,[fpi(2)(x)],ki=1,i=1,2,…r,fki(2)(x) is of order ki×1 and x′ is given by the r-tuple x′=(xp1,xp2,…,xpr). Then the transformation (4), where ϕ(x)=ϕ(2)(x), is given by (14), where
(31)ϕki(2)(x)={[ϕpi-1+1(2)(x)⋮ϕpi-1(2)(x)ϕpi(2)(x)]=[0⋮0fpi-1(2)(x′)],ki≥2,[ϕpi(2)(x′)];ϕpi(2)(x′)arbitrary,ki=1,i=1,2,…,r.α(x)=α(2)(x) given by (17), where
(32)αi(2)(x)=-fpi(2)(x),i=1,2,…,r,(33)β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1,m≥2,
reduces the system (29) to
(34)ẏ=Ay+Bv.Proof.
We first show that the quadratic linearization of (29) is achieved using (10), assuming (30)–(33). That is, it needs to be verified that (12) and (13) are satisfied. To verify that (12) is satisfied, it is sufficient to verify that (24) is satisfied. Substituting (30)–(32) into (24), we need to satisfy the following:
(35)-[010⋯0001⋯0⋮⋮⋮⋮⋮000⋯1000⋯0][00⋮0fpi-1(2)(x′)]-[00⋮01]fpi(2)(x)+[0⋮0fpi-1(2)(x′)fpi(2)(x)]+∑j=1r[0⋯0⋮⋮⋮0⋯0∂fpi-1(2)(x′)∂xpj-1+1⋯∂fpi-1(2)(x′)∂xpj][xpj-1+2xpj-1+3⋮xpj0]=0,i=1,2,…,r.
Note that fpi-1(2)(x′) is a function of xpj,j=1,2,…,r, only. Hence, ∂fpi-1(2)(x′)/(∂xpj-1+t)=0,t=1,2,…,(ki-1). Equation (35) then reduces to the following after simplification:
(36)-[00⋮fpi-1(2)(x′)0]-[00⋮0fpi(2)(x)]+[0⋮0fpi-1(2)(x′)fpi(2)(x)]+∑j=1r[0⋯00⋮⋮⋮⋮⋮⋮⋮⋮0⋯0∂fpi-1(2)(x′)∂xpj][xpj-1+2xpj-1+3⋮xpj0]=0,i=1,2,…,r.
Clearly (36) is an identity. Hence (24) is satisfied for ki≥2. For the case ki=1, it is easy to verify that (24) is satisfied as ϕpi(2)(x′)is a function of xpj,j=1,2,…,r, only.
Equation (28) is a necessary condition for (13) to hold, and it follows easily from (31), where ϕpi-1+t(2)(x)=0,t=1,2,…,(ki-1),i=1,2,…,r. To satisfy (13), note that, from (25), it follows that
(37)BTB=Ir.
Premultiply (13) by BT and rearrange to yield
(38)β(1)(x)=-BT∂ϕ(2)(x)∂xB
which is (33) for m=2. Substitution of (38) satisfies (13). Hence, the result holds for m=2.
As a result of quadratic linearization (i.e., satisfying (12) and (13)), higher-order terms are left in the system as per (11) even though originally (29) did not have third- and higher-order terms. These are now to be removed to effect generalized quadratic linearization. The higher-order terms are functions of α(x),ϕ(x), and β(x) and are given for the case g(m)(x)=0,m≥1, through algebraic computations as
(39)f′(m)(x)=∂ϕ(m-1)(x)∂xf(2)(x)+∑j=2m-1∂ϕ(j)(x)∂xBα(m-j+1)(x),m≥3,(40)g′(m-1)(x)=∑j=2m-1∂ϕ(j)(x)∂xBβ(m-j)(x),m>2.
Form=3,
(41)f′(3)(x)=∂ϕ(2)(x)∂x[f(2)(x)+Bα(2)(x)].
Partitioning f′(3)(x) similar to f(2)(x) in (16) and considering the ith block row,
(42)fki′(3)(x)=∑j=1rϕki,kj(fkj(2)(x)+bkjαj(2)(x))=∑j=1r([∂ϕpi-1+1(2)(x)∂xpj-1+1⋯∂ϕpi-1+1(2)(x)∂xpj⋮⋮⋮∂ϕpi-1+t(2)(x)∂xpj-1+1⋯∂ϕpi-1+t(2)(x)∂xpj⋮⋮⋮∂ϕpi(2)(x)∂xpj-1+1⋯∂ϕpi(2)(x)∂xpj]×[00⋮⋮0fpj-1(2)(x′)fpj(2)(x)+αj(2)(x)]),i=1,2,…,r.
Using (31) and (32) and that ϕpi(2)(x) being a function of xpj,j=1,2,…,r, only as above, (42) can be reduced to
(43)fki′(3)(x)=∑j=1r[0⋯00⋮⋮⋮⋮⋮⋮⋮⋮0⋯0∂fpi-1(2)(x′)∂xpj][0⋮0fpj-1(2)(x′)0]=0,i=1,2,…,r.
Hence, f′(3)(x)=0. Homological equation (7), for m=3, is satisfied if we put ϕ(3)(x)=0 and α(3)(x)=0.
Form=4,
(44)f′(4)(x)=∂ϕ(3)(x)∂xf(2)(x)+∂ϕ(2)(x)∂xBα(3)(x)+∂ϕ(3)(x)∂xBα(2)(x).
As ϕ(3)(x)=0 and α(3)(x)=0, it follows from (44) that f′(4)(x)=0. Hence, one can have ϕ(4)(x)=0andα(4)(x)=0 to satisfy (7) for m=4. Proceeding this way, it can be proved that f′(m)(x)=0,m>3.
Noting that from (40), g′(2)(x)=(∂ϕ(2)(x)/∂x)Bβ(1)(x) for m=3, and (8) can be written as
(45)Bβ(2)(x)+∂ϕ(3)(x)∂xB+g′(2)(x)=0,
from which using the fact that  ϕ(3)(x)=0,β(2)(x)=-BT(∂ϕ(2)(x)/∂x)Bβ(1)(x)=(BT(∂ϕ(2)(x)/∂x)B)2 using (38) is derived. Substitution of β(2)(x) satisfies (8) for m=3.
Proceeding this way, one can show thatf′(m)=0,m>3, and we can choose ϕ(m)=0andα(m)=0,m>3, to satisfy (7). β(m-1)(x) as given in (33) is easily derived so as to satisfy (8), where g′(m-1)(x) is given in (40), using the same technique as for m=2,3 successively as above, hence the result.Remark 4.2.
The result of Theorem4.1 provides a solution to the generalized quadratic linearization of a class of systems defined by (29). Equation (29) may appear to be a strong condition. But this is needed because of the requirement that the third- and all higher-order nonlinearities, which are usually introduced into the system during the course of quadratic linearization, identically vanish. As shown in Section 5, system (29) can represent many electric machine models [13] of which induction motor and permanent magnet synchronous motor are examples. Also, temperature and flow variables in heat transfer (composition and flow variables in mass transfer) processes, for example, combine to produce quadratic nonlinearity [16] of the form (9) which is a general form of (29). Further, even if a quadratic model (9) does not correspond exactly to model (29), one can always tune the coordinate and state feedback on the lines described by the authors in [17] to bring the system to a linear normal form. It can also be pointed out that quadratic system of the form ẋ=Ax+Bu+f(2)(x)+g(1)(x)u can be brought to the form ẋ=Ax+Bv+f′(2)(x) through state feedback as shown in [6]. Hence the forms (9) and (29), which are a special case of (9), are more general than they appear to be.Remark 4.3.
A specialized result of Theorem4.1 appears in an earlier paper by the authors [18]. In [18], the concept of generalized quadratic linearization is applied to a class of control affine systems with a specific configuration of Brunovsky form for multiple inputs. A PMSM model is shown to belong to this class and the generalized quadratic linearization of PMSM is derived. In Theorem 4.1, however, we have considered a more general class of systems with no assumption on the configuration of the Brunovsky form for multiple inputs. Hence, the theoretical result of [18] is a special case of the result of Theorem 4.1.


## 5. Generalized Quadratic Linearization of Machine Models

### 5.1. Squirrel Cage Induction Motor

The squirrel cage induction motor model can be derived as below [13]: (46)ẋ=Ax+Bu+f(2)(x),
where x=[x1,x2,x3,x4,x5]T=[idss,iqss,ψdrs,ψqrs,ωr]T,u=[u1,u2,u3,u4]T=[vdss,vqss,ψ′,ψ̂drs], where ψ′=iqss*ψ̂drs-idss*ψ̂qrs, where vqss,vdss,iqss,  and idss represent the quadrature and direct axis voltages and currents, respectively, and  ψdrs,ψqrs represent direct and quadrature axis fluxes, respectively. ψ̂drs,ψ̂qrs represent the estimated direct and quadrature flux, respectively, and ωr represents the angular velocity of the rotor. iqss* and idss* represent the reference values of quadrature and direct axis currents, respectively. The superscript refers to variables in the stationary frame: (47)A=[-(Lm2Rr+Lr2Rs)σLsLr20LmRrσLsLr2000-(Lm2Rr+Lr2Rs)σLsLr20LmRrσLsLr20LmRrLr00000LmRrLr0-RrLr000000],B=[1σLs00001σLs00000-RrLr000000-3P2Lm8JLr0],f(2)(x)=[LmωrψqrsσLsLr-LmωrψdrsσLsLr-ωrψqrsωrψdrs0]=[c1x4x5-c1x3x5-x4x5x3x50],
where Lm,Lr, and Ls represent the magnetizing, rotor, and stator inductances, respectively. Rr and Rs represent the rotor and stator resistances, respectively. Jrepresents the system moment of inertia, and P represents the number of poles. σ=1-Lm2/LsLr and c1=Lm/σLsLr. The model (46) can be reduced to normal form in a standard way using linear transformation of state variables [19] and linear state feedback as follows, where x,u, A,B and f(2)(x) are retained for simplicity of notation: (48)ẋ=Ax+Bu+f(2)(x),
where A and B given by (2), where r=μ=4 and k1=2,k2=k3=k4=1, are (49)A=[0100000000000000000000000],B=[00001000010000100001],f(2)(x)=[f1(2)(x)f2(2)(x)f3(2)(x)f4(2)(x)f5(2)(x)],
where f1(2)(x)=f1,35x3x5+f1,45x4x5, f2(2)(x)=f2,35x3x5+f2,45x4x5, f3(2)(x)=f3,35x3x5+f3,45x4x5, f4(2)(x)=f4,35x3x5+f4,45x4x5, f5(2)(x)=f5,35x3x5+f5,45x4x5.Remark 5.1.
f(2)(x) can be partitioned using (16) as
(50)f(2)(x)=[fk1(2)(x)fk2(2)(x)fk3(2)(x)fk4(2)(x)],
where
(51)fk1(2)(x)=[f1(2)(x)f2(2)(x)]=[f1,35x3x5+f1,45x4x5f2,35x3x5+f2,45x4x5],fk2(2)(x)=[f3(2)(x)]=[f3,35x3x5+f3,45x4x5],fk3(2)(x)=[f4(2)(x)]=[f4,35x3x5+f4,45x4x5],fk4(2)(x)=[f5(2)(x)]=[f5,35x3x5+f5,45x4x5].
As f1(2)(x) is a function of x3,x4, and x5 only and hence a function of x′=(x2,x3,x4,x5), one can write f1(2)(x)=f1(2)(x′). The systems given by (48) and (49) are then in line with conditions of Theorem 4.1 as given in (30). Hence, Theorem 4.1 can be applied to system (48) to obtain the solution of generalized quadratic linearization which is given in Corollary 5.2.Corollary 5.2.
The system (48) can be quadratic linearized in the generalized sense using the transformation
(52)y=x+ϕ(x),u=(I4+β(x))v+α(x),
where
(53)ϕ(x)=ϕ(2)(x)=[0f1(2)(x′)ϕ3(2)(x′)ϕ4(2)(x′)ϕ5(2)(x′)],α(x)=α(2)(x)=[-f2(2)(x)-f3(2)(x)-f4(2)(x)-f5(2)(x)],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1,
where ϕ3(2)(x′),ϕ4(2)(x′), and ϕ5(2)(x′) are completely arbitrary, and x′=(x2,x3,x4,x5). The system reduces to
(54)ẏ=Ay+Bv.Proof.
The result follows directly by applying the result of Theorem4.1 to (48) where n=5,r=4,μ=4,k1=2,  and k2=k3=k4=1;p1=2,p2=3,p3=4,  and p4=5.


### 5.2. Permanent Magnet Synchronous Motor

The PM machine model [13] can be expressed as(55)ẋ=Ax+Bu+f(2)(x);x=[x1,x2,x3]t=[iqs,ids,ωe]t and  u=[u1,u2]t=[vqs,vds]t where vqs,vds,iqs, and ids represent the quadrature and direct axes voltages and currents, respectively, and ωe is stator angular velocity: (56)A=[-RsLqs0-If′LdmLqs0-RsLds03P2LdmIf′8J00],B=[1Lqs001Lds00],f(2)(x)=[-LdsLqsx2x3LqsLdsx1x3(Lds-Lqs)x1x2].If′ is the field current equivalent to the permanent magnet. Lds,Lqs, and Ldm are the direct, quadrature, and magnetizing inductances, respectively. Rs is the stator resistance. P is the number of poles, and J is the system moment of inertia. The model (55) can be reduced to the following normal form in a standard way using linear transformation of state variables [19] and linear state feedback, where x, u, A, B, and f(2)(x) are retained for simplicity of notation:(57)ẋ=Ax+Bu+f(2)(x),
where A and B given by (2), where r=μ=2 and k1=2,k2=1, are (58)A=[010000000],B=[001001],f(2)(x)=[f1(2)(x)f2(2)(x)f3(2)(x)]=[C1x2x3C2x3x1C3x2x1],
with C1,C2,C3 being constants.Remark 5.3.
f(2)(x) can be partitioned using (16) as
(59)f(2)(x)=[fk1(2)(x)fk2(2)(x)],
where
(60)fk1(2)(x)=[f1(2)(x)f2(2)(x)]=[C1x2x3C2x3x1],fk2(2)(x)=[f3(2)(x)]=[C3x2x1].
Note that f1(2)(x) is a function of x′=(x2,x3) and hence f1(2)(x)=f1(2)(x′). The system given by (57) is in line with conditions of Theorem 4.1 as given in (30). Hence, Theorem 4.1 can be applied to system (57) to obtain the solution of generalized quadratic linearization which is given in Corollary 5.4.Corollary 5.4.
The system (57) can be quadratic linearized in the generalized sense using the transformation
(61)y=x+ϕ(x),u=(I2+β(x))v+α(x),
where
(62)ϕ(x)=ϕ(2)(x)=[0f1(2)(x′)ϕ3(2)(x′)],α(x)=α(2)(x)=[-f2(2)(x)-f3(2)(x)],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1,
where ϕ3(2)(x′) is completely arbitrary and x′=(x2,x3). The system then reduces to
(63)ẏ=Ay+Bv.Proof.
The result follows directly by applying the result of Theorem4.1 to (57) where n=3,r=2, and  μ=2;k1=2,k2=1;p1=2;p2=3.


### 5.3. Real-World Example of PMSM

The parameters of an actual machine are obtained from [20] as Rs=1.2 ohms, Lqs=12.5mH, Lds= 5.7 mH, ωe= 3500 rpm, P=4, J=0.0018 kgm2, and λaf= 123 mWb turns. The mathematical model of the machine in the normal form is given by (64)ẋ=Ax+Bu+f(2)(x),
where A and B are as given in (57) and (65)f(2)(x)=[C1x2x3C2x3x1C3x2x1],
where C1=-0.165(e-3),C2=-186.96,andC3=5.754386(e6). By applying Corollary 5.4 and choosing (66)ϕ(x)=ϕ(2)(x)=[0C1x2x30]=[0-0.0165(e-3)x2x30],α(x)=α(2)(x)=[α1(2)(x)α2(2)(x)]=[186.96x3x1-5.754386(e6)x2x1],β(1)(x)=[-C1x3-C1x200]=[0.0165(e-3)x30.0165(e-3)x200],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1.It is seen by verification that the system (64) becomes (67)ẏ=Ay+Bv
through transformation (61), given ϕ(x),α(x), and β(x) as above. The above system is completely linearized with no higher-order terms left behind.


### 5.4. Simulation Results

Verification of quadratic linearization of PMSM through simulations is given in an earlier paper by the authors [18]. The simulation results show that the closed-loop dynamic response of PMSM, before linearization, exhibits a behaviour that corresponds to varied responses for variations in reference and load conditions. However, it is verified that the quadratic linearized PMSM system gives a uniform closed-loop response for different reference and load conditions, as is expected of a linear system.


## 5.1. Squirrel Cage Induction Motor

The squirrel cage induction motor model can be derived as below [13]: (46)ẋ=Ax+Bu+f(2)(x),
where x=[x1,x2,x3,x4,x5]T=[idss,iqss,ψdrs,ψqrs,ωr]T,u=[u1,u2,u3,u4]T=[vdss,vqss,ψ′,ψ̂drs], where ψ′=iqss*ψ̂drs-idss*ψ̂qrs, where vqss,vdss,iqss,  and idss represent the quadrature and direct axis voltages and currents, respectively, and  ψdrs,ψqrs represent direct and quadrature axis fluxes, respectively. ψ̂drs,ψ̂qrs represent the estimated direct and quadrature flux, respectively, and ωr represents the angular velocity of the rotor. iqss* and idss* represent the reference values of quadrature and direct axis currents, respectively. The superscript refers to variables in the stationary frame: (47)A=[-(Lm2Rr+Lr2Rs)σLsLr20LmRrσLsLr2000-(Lm2Rr+Lr2Rs)σLsLr20LmRrσLsLr20LmRrLr00000LmRrLr0-RrLr000000],B=[1σLs00001σLs00000-RrLr000000-3P2Lm8JLr0],f(2)(x)=[LmωrψqrsσLsLr-LmωrψdrsσLsLr-ωrψqrsωrψdrs0]=[c1x4x5-c1x3x5-x4x5x3x50],
where Lm,Lr, and Ls represent the magnetizing, rotor, and stator inductances, respectively. Rr and Rs represent the rotor and stator resistances, respectively. Jrepresents the system moment of inertia, and P represents the number of poles. σ=1-Lm2/LsLr and c1=Lm/σLsLr. The model (46) can be reduced to normal form in a standard way using linear transformation of state variables [19] and linear state feedback as follows, where x,u, A,B and f(2)(x) are retained for simplicity of notation: (48)ẋ=Ax+Bu+f(2)(x),
where A and B given by (2), where r=μ=4 and k1=2,k2=k3=k4=1, are (49)A=[0100000000000000000000000],B=[00001000010000100001],f(2)(x)=[f1(2)(x)f2(2)(x)f3(2)(x)f4(2)(x)f5(2)(x)],
where f1(2)(x)=f1,35x3x5+f1,45x4x5, f2(2)(x)=f2,35x3x5+f2,45x4x5, f3(2)(x)=f3,35x3x5+f3,45x4x5, f4(2)(x)=f4,35x3x5+f4,45x4x5, f5(2)(x)=f5,35x3x5+f5,45x4x5.Remark 5.1.
f(2)(x) can be partitioned using (16) as
(50)f(2)(x)=[fk1(2)(x)fk2(2)(x)fk3(2)(x)fk4(2)(x)],
where
(51)fk1(2)(x)=[f1(2)(x)f2(2)(x)]=[f1,35x3x5+f1,45x4x5f2,35x3x5+f2,45x4x5],fk2(2)(x)=[f3(2)(x)]=[f3,35x3x5+f3,45x4x5],fk3(2)(x)=[f4(2)(x)]=[f4,35x3x5+f4,45x4x5],fk4(2)(x)=[f5(2)(x)]=[f5,35x3x5+f5,45x4x5].
As f1(2)(x) is a function of x3,x4, and x5 only and hence a function of x′=(x2,x3,x4,x5), one can write f1(2)(x)=f1(2)(x′). The systems given by (48) and (49) are then in line with conditions of Theorem 4.1 as given in (30). Hence, Theorem 4.1 can be applied to system (48) to obtain the solution of generalized quadratic linearization which is given in Corollary 5.2.Corollary 5.2.
The system (48) can be quadratic linearized in the generalized sense using the transformation
(52)y=x+ϕ(x),u=(I4+β(x))v+α(x),
where
(53)ϕ(x)=ϕ(2)(x)=[0f1(2)(x′)ϕ3(2)(x′)ϕ4(2)(x′)ϕ5(2)(x′)],α(x)=α(2)(x)=[-f2(2)(x)-f3(2)(x)-f4(2)(x)-f5(2)(x)],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1,
where ϕ3(2)(x′),ϕ4(2)(x′), and ϕ5(2)(x′) are completely arbitrary, and x′=(x2,x3,x4,x5). The system reduces to
(54)ẏ=Ay+Bv.Proof.
The result follows directly by applying the result of Theorem4.1 to (48) where n=5,r=4,μ=4,k1=2,  and k2=k3=k4=1;p1=2,p2=3,p3=4,  and p4=5.


## 5.2. Permanent Magnet Synchronous Motor

The PM machine model [13] can be expressed as(55)ẋ=Ax+Bu+f(2)(x);x=[x1,x2,x3]t=[iqs,ids,ωe]t and  u=[u1,u2]t=[vqs,vds]t where vqs,vds,iqs, and ids represent the quadrature and direct axes voltages and currents, respectively, and ωe is stator angular velocity: (56)A=[-RsLqs0-If′LdmLqs0-RsLds03P2LdmIf′8J00],B=[1Lqs001Lds00],f(2)(x)=[-LdsLqsx2x3LqsLdsx1x3(Lds-Lqs)x1x2].If′ is the field current equivalent to the permanent magnet. Lds,Lqs, and Ldm are the direct, quadrature, and magnetizing inductances, respectively. Rs is the stator resistance. P is the number of poles, and J is the system moment of inertia. The model (55) can be reduced to the following normal form in a standard way using linear transformation of state variables [19] and linear state feedback, where x, u, A, B, and f(2)(x) are retained for simplicity of notation:(57)ẋ=Ax+Bu+f(2)(x),
where A and B given by (2), where r=μ=2 and k1=2,k2=1, are (58)A=[010000000],B=[001001],f(2)(x)=[f1(2)(x)f2(2)(x)f3(2)(x)]=[C1x2x3C2x3x1C3x2x1],
with C1,C2,C3 being constants.Remark 5.3.
f(2)(x) can be partitioned using (16) as
(59)f(2)(x)=[fk1(2)(x)fk2(2)(x)],
where
(60)fk1(2)(x)=[f1(2)(x)f2(2)(x)]=[C1x2x3C2x3x1],fk2(2)(x)=[f3(2)(x)]=[C3x2x1].
Note that f1(2)(x) is a function of x′=(x2,x3) and hence f1(2)(x)=f1(2)(x′). The system given by (57) is in line with conditions of Theorem 4.1 as given in (30). Hence, Theorem 4.1 can be applied to system (57) to obtain the solution of generalized quadratic linearization which is given in Corollary 5.4.Corollary 5.4.
The system (57) can be quadratic linearized in the generalized sense using the transformation
(61)y=x+ϕ(x),u=(I2+β(x))v+α(x),
where
(62)ϕ(x)=ϕ(2)(x)=[0f1(2)(x′)ϕ3(2)(x′)],α(x)=α(2)(x)=[-f2(2)(x)-f3(2)(x)],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1,
where ϕ3(2)(x′) is completely arbitrary and x′=(x2,x3). The system then reduces to
(63)ẏ=Ay+Bv.Proof.
The result follows directly by applying the result of Theorem4.1 to (57) where n=3,r=2, and  μ=2;k1=2,k2=1;p1=2;p2=3.


## 5.3. Real-World Example of PMSM

The parameters of an actual machine are obtained from [20] as Rs=1.2 ohms, Lqs=12.5mH, Lds= 5.7 mH, ωe= 3500 rpm, P=4, J=0.0018 kgm2, and λaf= 123 mWb turns. The mathematical model of the machine in the normal form is given by (64)ẋ=Ax+Bu+f(2)(x),
where A and B are as given in (57) and (65)f(2)(x)=[C1x2x3C2x3x1C3x2x1],
where C1=-0.165(e-3),C2=-186.96,andC3=5.754386(e6). By applying Corollary 5.4 and choosing (66)ϕ(x)=ϕ(2)(x)=[0C1x2x30]=[0-0.0165(e-3)x2x30],α(x)=α(2)(x)=[α1(2)(x)α2(2)(x)]=[186.96x3x1-5.754386(e6)x2x1],β(1)(x)=[-C1x3-C1x200]=[0.0165(e-3)x30.0165(e-3)x200],β(m-1)(x)=(-1)m-1{BT∂ϕ(2)(x)∂xB}m-1.It is seen by verification that the system (64) becomes (67)ẏ=Ay+Bv
through transformation (61), given ϕ(x),α(x), and β(x) as above. The above system is completely linearized with no higher-order terms left behind.


## 5.4. Simulation Results

Verification of quadratic linearization of PMSM through simulations is given in an earlier paper by the authors [18]. The simulation results show that the closed-loop dynamic response of PMSM, before linearization, exhibits a behaviour that corresponds to varied responses for variations in reference and load conditions. However, it is verified that the quadratic linearized PMSM system gives a uniform closed-loop response for different reference and load conditions, as is expected of a linear system.


## 6. Conclusion

In this paper, linearization of machine models, which are predominantly quadratic in nature, is considered. Since the machine models only exhibit higher-order nonlinearities such as core loss, stray loss, and saturation, under extreme conditions, quadratic models can be used to represent the machines during normal operation.The existing exact feedback linearization techniques introduce singularities in the system. This may result in the the faliure of linearization and the corresponding control technique, during the course of operation of the machine. Application of Poincare's approximate linearization technique due to Kang and Krener can remove the quadratic nonlinearity through a homogeneous transformation. This technique does not suffer from singularity issues but, being an approximate method, introduces higher-order terms in the process of quadratic linearization. Hence, in this paper, the concept of generalized quadratic linearization technique is introduced, wherein the higher-order terms introduced during the process of quadratic linearization are removed even as the quadratic term is removed.A solution to the problem of generalized quadratic linearization is given for a class of control affine systems. Induction motor and PM motor models involving quadratic nonlinearity are considered and are quadratically linearised in the generalized sense. The proposed method can also be extended to wound rotor and synchronous machine models as well.The generalized quadratic linearization technique proposed in this paper can also be considered as the approximate feedback linearization equivalent of exact linearization of a class of systems of the form (29). Since the solution of the generalized quadratic linearization involves removing third- and higher-order nonlinearities, the result of the paper can also been seen as a contribution towards a special case of the open problem on arbitrary order linearization [21] of control affine systems.Finally, as per the result of Theorem4.1, β(x)=∑m=2,3,…βm-1(x) whose convergence needs to be established. Also, Theorem 4.1 of Section 4 deals only with sufficient conditions for generalized quadratic linearization. The question arises as to what are the necessary conditions for (9) to be generalized quadratically linearizable in general: this is our future work.



---

*Source: 926712-2011-11-03.xml*