Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Mathematics

formerly Central European Journal of Mathematics

Editor-in-Chief: Gianazza, Ugo / Vespri, Vincenzo

1 Issue per year


IMPACT FACTOR 2016 (Open Mathematics): 0.682
IMPACT FACTOR 2016 (Central European Journal of Mathematics): 0.489

CiteScore 2016: 0.62

SCImago Journal Rank (SJR) 2016: 0.454
Source Normalized Impact per Paper (SNIP) 2016: 0.850

Mathematical Citation Quotient (MCQ) 2016: 0.23

Open Access
Online
ISSN
2391-5455
See all formats and pricing
More options …
Volume 14, Issue 1 (Jan 2016)

Issues

Decomposition of a second-order linear time-varying differential system as the series connection of two first order commutative pairs

Mehmet Emir Koksal
Published Online: 2016-10-06 | DOI: https://doi.org/10.1515/math-2016-0059

Abstract

Necessary and sufficiently conditions are derived for the decomposition of a second order linear time- varying system into two cascade connected commutative first order linear time-varying subsystems. The explicit formulas describing these subsystems are presented. It is shown that a very small class of systems satisfies the stated conditions. The results are well verified by simulations. It is also shown that its cascade synthesis is less sensitive to numerical errors than the direct simulation of the system itself.

Keywords: Differential equations; Analogue control; Equivalent circuits; Feedback circuits; Feedback control systems; Robust control

MSC 2010: 34H99; 93A30; 93B35; 93C05; 93C15; 93C99

1 Introduction

The realization of many engineering systems consists of cascade connection of subsystems of simple orders, which is very important in design of electrical and electronic systems [1,5]. Although the order of connection of the subsystems mainly depends on the special design approach, engineering ingenuity, traditional synthesis methods, when sensitivity, stability, linearity, noise disturbance, robustness effects are considered the change of the order of connection without changing the main function of the total system (commutativity) may lead positive results. Therefore the commutativity is very important from the practical point of view.

Consider two linear time-varying differential systems

A:n=0Nan(t)dndty1(t)=x1(t),withy1(n)(0),n=0,1,,N1,(1)

B:m=0Mbm(t)dmdty2(t)=x2(t),withy2(n)(0),m=0,1,,M1,(2)

where an(t) and bm(t) are continuous functions RR; the superscripts in the parenthesis denote the derivatives with respect to time t ≥ 0; aN (0) ≠ 0, bM (0) ≠ 0 where N, M ≥ 1 indicate the order of the differential systems A and B, respectively. These equations are assumed to describe the models of physical systems, also referred as A and B, with inputs xi (t) and outputs yi (t), i = 1, 2.

When the output y1 of A is fed as (equal to) the input x2 of B, the combined system with input x = x1 and output y = y2 is called the cascade connection of AB; BA is defined similarly. If the cascade connections AB and BA have identical input-output pairs for all time t ≥ 0, then A and B are said to be commutative subsystems, that is AB = BA. It is very simple to show that y(t) = x(t)/a0(t)b0(t) for the cascade connections of AB and BA when A and B are zero-order (scalar) subsystems; hence all zero-order linear time-varying systems are commutative; for this trivial result the case of N = 0 and M = 0 are excluded in Eqs. (1) and (2) and in the content of this paper.

The first record about the commutativity in the literature is known to be [6] where it is proved that a time-varying system can be commutative only with another time-varying system (excluding a scalar constant gain system), which is the first basic general conclusion about the commutativity of linear time-varying systems.

After several publications about the commutativity of low-order systems [7,10], an exhaustive study was introduced in 1988 [11]. This paper had been the main reference for many years since it covers the most general necessary and sufficient conditions for the commutativity of systems of any order but without initial conditions. The previous results for commutativity conditions of first-order [6], second-order [7], third-order [9], and fourth-order [10] systems were shown to be deduced from the main theorem of [11]. The paper also includes results concerning the commutativity properties of feed-back control systems and Euler differential systems.

Another tutorial work about the subject appeared in 2011 [12], where the explicit commutativity conditions for linear time-varying differential systems with non-zero initial conditions [13], the effects of commutativity on system sensitivity [14], and the explicit commutativity conditions for the fifth-order systems were derived for the first time.

Although the commutativity study of linear systems has recently extended to discrete time-varying systems [15], this case is out of scope of this paper which focuses on the decomposition of a second-order continuous time linear time-varying systems into two cascade (chain) connected first-order systems. After this introductory section, Section II presents the main theorem and its proof. Illustrative examples and simulation results are outlined in Section III. Finally, Section IV includes concluding remarks.

2 Main Theorem

Consider the second-order linear time-varying system C described by the differential equation

C:c2(t)y¨(t)+c1(t)y˙(t)+c0(t)y(t)=x(t);y(0),y˙(0);t0;c2(t)0,(3)

where c2(t) and its first (c˙2) and second (c¨2) time derivatives, c1(t) and c0(t) are continuous functions R+R; and y(0), (0) ∊ R are initial conditions; x(t) and y(t) being the input (independent exciting) and output (dependent response) variables. Let A and B be two first-order linear time-varying systems with the inputs x1(t) and x2(t), and outputs y1(t) and y2(t), respectively, and they are defined by

A:a1(t)y˙1(t)+a0(t)y1(t)=x1(t);y1(0),t0;a1(t)0,(4)

B:b1(t)y˙2(t)+b0(t)y2(t)=x2(t);y2(0),t0;b1(t)0.(5)

Then, the following theorem holds.

For the decomposition of system (3) as the cascade connected first-order commutative pair of subsystems (4) and (5), that is C = AB = BA, it is necessary and sufficient that

a1(t)=c2(t)k1,(6)

a0(t)=2c1(t)c˙2(t)4k1c2(t)k02k1,(7)

b1(t)=k1c2(t),(8)

b0(t)=2c1(t)c˙2(t)4k1c2(t)+k02,(9)

where k0 and k1 are arbitrary constants in R satisfying

3(c˙2(t))216c2(t)c¨2(t)4+c1(t)2c˙2(t)4c2(t)c1(t)+c˙1(t)2k024k1=c0(t).(10)

Further if the equivalence is to be valid under non-zero initial conditions y(0), (0). the constraint

y1(0)=y2(0)=y(0)(11)

between the initial conditions, and the relation

k1+k0=1(12)

between the arbitrary constants should be included in the necessary and sufficient conditions in (6), (7), (8), (9), (10).

Consider the connection AB; that is the input x of AB is that of A, the output of A is equal to the input of B, the output of B is that of AB; which can be expressed as

x=x1,(13)

y1=x2,(14)

y2=y.(15)

Differentiating (5), we obtain

b˙1y˙2+b1y¨2+b˙0y2+b0y˙2=x˙2.(16)

From (14), and then from (4)

x˙2=y˙1=x1a0y1a1.(17)

Inserting the value x1 = x from (13), and the value

y1=x2=b1y˙2+b0y2(18)

from (14), and (5) all in to (17), we obtain

x˙2=xa0(b1y˙2+b0y2)a1.(19)

Finally, substituting this expression in (16) and letting y2 = y from (15), (16) is transformed to

b1a1y¨+[b˙1a1+b1a0+b0a1]y˙+[b˙0a1+b0a0]y=x(20)

after rearrangements. This equation describes the interconnection AB with the initial conditions

y(0)=y2(0),(21)

y˙(0)=y˙2(0)=x2(0)b0(0)y2(0)b1(0)=y1(0)b0(0)y2(0)b1(0),(22)

where the first equation follows from (15); the subsequent equalities in the second equation follow from (15), (5), and (14).

When the interconnection BA is considered, a similar procedure can be followed to derive

a1b1y¨+[a˙1b1+a1b0+a0b1]y˙+[a˙0b1+b0a0]y=x,(23)

y(0)=y1(0),(24)

y˙(0)=y2(0)a0(0)y1(0)a1(0).(25)

These equations can also be obtained straightforwardly from (20), (21) and (22), respectively, by interchanging aibi, (i = 0, 1) and y1y2.

The first commutativity condition for subsystems A and B is reduced from the general theorem (Koksal 1) of [12] as

[b1b0]=[a10a01][k1k0],(26)

where k1 and k0 are arbitrary constants. And the second commutativity condition is reduced from Eq. 3.2a of [12] as

[y1(0)y2(0)a0(0)y1(0)a1(0)]=[y2(0)y1(0)b0(0)y2(0)b1(0)].(27)

For the case of first-order subsystems considered in the present proof, (27) results from the comparison of (21), (22), and (24), (25). Equation (26) is obvious by equating the coefficients of (20) and (23). In fact the equality of the coefficients of the first derivatives of yields

a˙1b1=b1a1b1=k1a1,(28)

which is the first line equation in (26). The second line equation can be obtained by equating the coefficients of y in (20) and (23), which yields together with (28)

a˙0b1=b˙0a1b0=k1a0+k0.(29)

Before proceeding further, we focus on the second line equation in (27). For nonzero initial conditions, this equation together with the first line equation and (26) yields

1a0(0)a1(0)y1(0)=1b0(0)b1(0)y1(0)=1a0(0)k1k0a1(0)k1y1(0),(30)

which results in

k1+k0=1(31)

for the nonzero initial conditions y1 (0) = y2(0).

The intermediate step of the proof is to eliminate the coefficients b1 (t), b0(t) and the initial condition y2(0) from the description (20), (21), (22) of the interconnection AB. In fact, using (26) and (27) in (20), (21), (22), we obtain

a12k1y¨+[a˙1a1k1+2a1a0k1+a1k0]y˙+[a1a˙0k1+a02k1+a0k0]y=x,(32)

y(0)=y1(0),(33)

y˙(0)=1k0a0(0)k1a1(0)k1y1(0)=1a0(0)a1(0)y1(0)=1a0(0)a1(0)y(0).(34)

Since it is well known that (3) and (32) will have identical input-output pairs (x(t), y(t)) for all inputs x(t) and the initial conditions y(0) and (0) if and only if they have the same continuous time-varying coefficients, for their equivalence it is required that

a12k1=c2,(35)

a˙1a1k1+2a1a0k1+a1k0=c1,(36)

a1a˙0k1+a02k1+a0k0=c0.(37)

In fact (35) yields (6). Moreover, (36) yields (7) since a˙1=c˙22a1k1 from (35). Inserting (6) and (7) in (26) yields (8) and (9) respectively. Finally, substituting (6) and (7) in (37) yields (10).

Note that (11) and (12) have already been proved as seen in (21), (24) and (31), respectively. Hence the proof of the theorem is completed.

Theorem 2.1 and its proof reveal some important results which are expressed by the following corollaries. ◻

For the synthesis of a second-order linear time-varying system in the form (3) with zero initial conditions as the cascade connection of two first-order linear time-varying subsystems in the forms (4) and (5), it is necessary and sufficient that the coefficient c0(t) of the system is expressible in terms of the first two coefficients c2(t) and c1(t) as in (10) where k1 and k0 are arbitrary constants.

This corollary is a direct consequence or a simpler expression of Theorem 2.1.

The next corollary is for the case of nonzero initial conditions.

For the synthesis of the second-order linear time-varying system considered in Corollary 2.2 but with non-zero initial conditions as the cascade connection of two first-order linear time-varying subsystems in the forms (4) and (5), it is necessary and sufficient that the condition of Corollary 2.2 is valid with the exposed condition (12) and further

y˙(0)=[k1+12k1c2(0)+c˙2(0)2c1(0)4c2(0)]y(0).(38)

Substitutions y2(0) = y(0) from (21) and y1(0) = y(0) from (24) in (25), writing the expressions in (6), (7) for a1(0) and a0(0) in, and finally using (12) yield (38).

Although the necessity and sufficiency of the coefficient c0(t) being expressible in terms of the coefficients c2(t), c1(t), and some of their derivatives as in (10) is enough under zero initial conditions, the second corollary states that the constants k1 and k0 should sum up to 1 as in (12) and k1 should satisfy (38) with the arbitrarily given initial conditions (0) and y(0). ◻

3 Examples

To illustrate the results of the paper, some examples are introduced in this section. The simulations conducted with MATLAB R2012a and obtained by a PC Intel® Core® i3 CPV, 2.13 GHz, 3.86 GB of RAM well verify the results.

3.1 Example 1

Consider the system defined by

y¨(t)+sinty˙(t)+116(4sin2t+8cost9)y(t)=x(t);y(0)=1,y˙(0)=1.25,t0.(39)

For the synthesis of this second-order linear time-varying system in the form of two first-order cascade connected commutative subsystems, the constant k1 is determined first by using (38). Since

c2(t)=1;c1(t)=sint;c0(t)=116(4sin2t+8cost9);y(0)=1,y˙(0)=1.25(40)

(38) yields

k1=2,k1=4,(41)

k1=0.5,k1=0.25(42)

with two possibilities for k1, and (12) yields the following two values for k0, respectively

k0=3,(43)

k0=0.75.(44)

Considering the first possibility, (10) is obviously satisfied with k1 = 4, k0 = −3. It is further seen that this equation is also satisfied for the second possibility k1 = 0.25, k0 = 0.75. Hence, the given second-order system seems to have two commutative decompositions of order one. For the first case with k1 = 4, k0 = −3, the commutative subsystems A and B of the given system C in (39) are found from (6), (7) and (8), (9) with the initial conditions in (11);

a1(t)=12,a0(t)=18(8+2sint),y1(0)=1;hence(45)

A:12y˙1t+183+2sinty1t=x1t,y10=1,(46)

b1(t)=2,b0(t)=12(3+2sint),y2(0)=1;hence(47)

B:2y˙2(t)+12(3+2sint)y2(t)=x2(t),y2(0)=1.(48)

The above computed synthesis of the given second-order system C in the form of cascade connections AB and BA of the subsystems A and B are tested by MATLAB simulations for the input

x(t)=10sin10t.(49)

The outputs of the original second-order system C, and its synthesis AB and BA by cascade connected commutative first-order systems (A and B) are all observed to be identical as shown in Fig. 1 (C = AB = BA).

Output of C and its cascade synthesis AB and BA for Example 1.
Fig. 1

Output of C and its cascade synthesis AB and BA for Example 1.

It can easily be shown that A and B can be found in a similar manner as above for the second case of values k1 = 0.25, k0 = 0.75; the result is not different from that of the first case except the subsystems A and B found in (45), (46) and (47), (48) are interchanged AB. When commutativity is of concern this does not necessitate any change in the statements of the main theorem and its corollaries. But it deserves to note that although the quadratic equation (38) yields two solutions for k1 they both yield the same result effectively.

To show the validity of Corollary 2.3, the same example is simulated by changing (0) = 0.25 which is a case (38) is not satisfied. The decompositions AB and BA are not valid in this case since C does not have the same output as shown in Fig. 1 (C1).

Simulation results reveal that C and its subsystem B are unstable systems. Although unlike linear time-invariant systems, stability of linear time-varying systems does not depend on only whether the characteristic value lies in the left half complex plane [16,18], the characteristic value of B remains always on the right hand side, and those of C enter in the right hand side some times; hence the instability of B and C is expected. The next example is chosen as a stable second-order system.

3.2 Example 2

In this example, the constants k1 and k0 which are arbitrarily selectable when initial conditions are zero are tried to be chosen so that both the second-order system C and its commutative subsystems A and B are all stable. Let C be in the form

C:y¨..(t)+2(2cost)y˙(t)+c0(t)y(t)=x(t).(50)

Obviously, c2(t) = 1 and c1(t) = 4 −2cost. Hence, (10) yields that c0(t) will be in the form

c0(t)=(2cost)2+sintk024k1.(51)

Using (6), (7) and (8), (9), the subsystems A and B become

A:1k1y˙1(t)+(2costk1k02k1)y1(t)=x1(t),(52)

B:k1y˙2(t)+((2cost)k1k02)y2(t)=x2(t).(53)

The characteristic values of A and B are obviously

DA=k02k12+cost,(54)

DB=k02k12cost.(55)

It can be shown very easily that both of these values remain negative for all t ≥ 0 if

2k1<k0<2k1.(56)

Hence, when (k0, k1) is chosen inside of the parabola k1=k024(k0=2k1) as shown in Fig. 2, both DA and DB will always remain negative (this may not be sufficient for stability [16, 18]) and A and B most likely be stable subsystems, so is C = AB = BA. When the initial conditions are not zero, the additional equation (12) should also be satisfied for commutativity, the line k0 + k1 = 1 is also shown in Fig. 2. For two different choices of k0, k1, the outputs of the systems C, AB and BA are observed on the MATLAB Scope and plotted as shown in Fig. 3.

In Case I, k1 = 4, k0 = −3 (point P in Fig. 2), the subsystems A, B and their cascade connections C = AB = BA as found from (52), (53) and (51) become

A:12y˙1(t)+(1.3750.5cost)y1(t)=x1(t),y1(0)=1,(57)

B:2y˙2(t)+(2.52cost)y2(t)=x2(t),y2(0)=1,(58)

C:y¨(t)+(42cost)y˙(t)+(4cost0.5cos2tsint3.9375)y(t)=x(t);y(0)=1,y˙(0)=1.(59)

Different regions of k1 − k0 plane for possibly stable choices of C and its stable subsystems A, B.
Fig. 2

Different regions of k1k0 plane for possibly stable choices of C and its stable subsystems A, B.

Outputs of Example 2 for Cases I and II.
Fig. 3

Outputs of Example 2 for Cases I and II.

Note that y1(0) = y2(0) = y(0) and (0) for C is computed from (38); hence, all the conditions of the main theorem and its corollaries are satisfied. All of the systems C, AB and BA are excited by x(t) = −5 + 10sint superimposed by a square wave of amplitude 20, period 5 and pulse with % 5. It is observed in Fig. 3 that all the outputs are the same (CI = ABI = BAI) and verify the theory. It is pertinent to note that when the simulation time is extended far beyond t = 10, all the systems’ outputs remain bounded, that is they are all stable as expected.

In Case II, k1 = 4, k0 = 1 as shown in Fig. 2 by point Q. For this case, the subsystems A, B and the second-order system C become

A:12y˙1(t)+1cost2y1(t)=x1(t),y10=1,(60)

B:2y˙2(t)+(62cost)y2(t)=x2(t),y20=0,C:y¨(t)+2(2cost)y˙(t)+3+cos2tsint4costy(t)=x(t)(61)

y(0)=y˙(0)=0,(62)

which are found as mentioned in the previous case. For the same input of Case I, all the outputs are observed to be equal as in the first case and are shown in Fig. 3 (CII 0 = ABII 0 = BAII 0). Note that k1 + k0 ≠ 1 for this case, which is not a necessary condition for commutativity in the case of zero initial conditions. We observe in this figure that due to the strong stability of the system, the initial condition response dies away quickly so that the total response of Case I approaches to that of the input response (response with zero initial conditions) of Case II.

Case III is exactly the same as Case II except nonzero initial conditions are assigned to A, B and C. In fact A, B and C are assigned to have the same initial conditions for their outputs, that is y1(0) = y2(0) = y(0) = 4 and hence, (11) of the main Theorem is satisfied; (0) = 2 as to satisfy the condition (38) of Corollary 2.3. Since the condition of (12) of this Corollary is not satisfied (k1 + k0 ≠ 1), we should not have equal outputs for C, AB and BA; see Fig. 4 (CIIIABIIIBAIII). We note again that due to the strong stability of the systems C, AB, BA, the initial condition responses die away quickly and the outputs become equal as t → ∞. This is because of the decomposition of C into the commutative pair AB (or BA) is valid under zero initial conditions.

Outputs of Example 2 for Case III.
Fig. 4

Outputs of Example 2 for Case III.

3.3 Example 3

This example is presented to exhibit the numerical accuracies in simulations while validating the main theorem and its corollaries stated in the paper. The second-order linear time-varying system C to be synthesized as the commutative cascade connected pair of two first-order linear time-varying subsystems A and B are described by

C:y¨(t)+2t2y˙(t)+(t4+2t0.5626)y(t)=x(t),y(0)=1,y˙(0)=1.25,(63)

A:2y˙1(t)+(2t21.5)y1(t)=x1(t),y1(0)=1,(64)

B:12y˙2(t)+(0.5t2+0.375)y2(t)=x2(t),y2(0)=1,(65)

respectively. Note that all the conditions of Theorem 2.1 are satisfied with k1 = 0.25, k0 = 0.75, where k1 +k0 = 1. The input is chosen as x(t) = −5 + 10sin4t. The simulation results for all outputs of C, AB and BA are equal as shown in Fig. 5 (C = AB = BA). The small discrepancies due to the numerical errors in the simulations are observed in the same figure as (CAB) and (ABBA). Note that the outputs of C, AB and BA can not be differed, though there is a difference between the results of C and AB in the order of smaller than 10−5 in magnitude. On the other hand, the difference between AB and BC are almost smaller than 10−15 in magnitude. This means that the cascade connections AB and BA are much more insensitive to the numerical errors than the whole system C. This shows the numerical stability of cascade synthesis procedure over the direct synthesis.

The outputs and differences between the outputs of the system of Example 3 and its cascade synthesis.
Fig. 5

The outputs and differences between the outputs of the system of Example 3 and its cascade synthesis.

3.4 Example 4

This example is designed to show the importance of the orders AB or BA from the effect of the noise point of view interfered at the interconnection. The systems considered are

C:y¨(t)+(12t25t+3)y˙(t)+6y(t)=x(t),y(0)=1,y˙(0)=0.475,(66)

B:1.25y˙1(t)+(1.25t23.125t+1.59375)y1(t)=x1(t),y1(0)=1,(67)

A:0.8y˙2(t)+(0.8t22t+1.38)y2(t)=x2(t),y2(0)=1.(68)

The given decomposition of C into the cascade connections AB and BA satisfies all the conditions of Theorem 2.1 where k1 = 0.64, k0 = 0.36. The input x(t) is chosen as 10sin4t − 5 plus a square wave of amplitude 20, period 1 and % 20 pulse width. After validating that all outputs of C, AB and BA are the same (see Fig. 6, C = AB = BA), a noise signal of a square wave of period 1 (5 for 0 ≤ t ≤ 0.25, −5 for 0.25 ≤ t ≤ 0.5, 0 for 0.5 ≤ t ≤ 1) is added as disturbance at the interconnection of subsystems A and B. The effect of this noise at the output of the cascade connection is also shown in Fig. 5 (BA noise and AB noise). It is apparently true that the cascade connection BA is preferable since it causes almost half of the noise effect of produced in the connection AB. Hence among the alternative orders AB and BA, BA is preferred for the cascade synthesis of C since it is less sensitive to distortive signals occurring at the interconnection point.

The outputs of the system C and its cascade synthesis AB and BA with and without noise.
Fig. 6

The outputs of the system C and its cascade synthesis AB and BA with and without noise.

4 Conclusions

The necessary and sufficient conditions are derived for the decomposition of a second-order linear time-varying system into the cascade connection of two first-order commutative linear time-varying subsystems. The results of the main theorem and its corollaries are well verified by MATLAB simulations. It is shown that the cascade synthesis is more robust against the numerical errors that the direct simulation of the system. Although the order of the subsystems is not important from the view point of input-output relations, the paper shows that one of the sequences can be preferable when the effects of disturbance at the interconnection of two subsystems are considered.

Acknowledgement

This paper has been supported by the Scientific and Technological Research Council of Turkey under the project no. 115E952.

References

  • [1]

    Holt A.G.J., Reineck K.M., Transfer function synthesis for a cascade connection network, IEEE Transactions on Circuit Theory, 1968, 15 (2), 162-163 Google Scholar

  • [2]

    Ainbund M.R., Maslenkov I.P., Improving the characteristics of microchannel plates in cascade connection, Instruments and Experimental Techniques, 1983, 26 (3), 650-652Google Scholar

  • [3]

    Gohberg I., Kaashoek M.A., Ran A.C.M., Partial role and zero displacement by cascade connection, SIAM Journal on Matrix Analysis and Applications, 1989, 10 (3), 316-325Google Scholar

  • [4]

    Polyak B.T., Vishnyakov A.N., Multiplying disks: robust stability of a cascade connection, European Journal of Control, 1996, 2 (2), 101-111Google Scholar

  • [5]

    Walczak J., Piwowar A., Cascade connection of a parametric section and its properties, Przeglad Elektrotechniczny, 2010, 86 (1), 56-58 Google Scholar

  • [6]

    Marshall E., Commutativity of time-varying systems, Electro Letters, 1977, 18, 539-540 Google Scholar

  • [7]

    Koksal M., Commutativity of second order time-varying systems, International Journal of Control, 1982, 36 (3), 541-544 Google Scholar

  • [8]

    Saleh S.V., Comments on ‘Commutativity of second-order time-varying systems’, International Journal of Control, 1983, 37, 1195-1195Google Scholar

  • [9]

    Koksal M., General conditions for commutativity of time-varying systems, Proceedings of the International Conference on Telecommunication and Control, (1984, Halkidiki, Greece), 1984, 223-225 Google Scholar

  • [10]

    Koksal M., A survey on the commutativity of time-varying systems. (Circuit and Systems, Middle East Technical University, Department of Electrics & Electronics Engineering, Technical Report no: GEEE CAS-85/1, 1985), p. 5 Google Scholar

  • [11]

    Koksal M., An exhaustive study on the commutativity of time-varying systems, International Journal of Control, 1988, 47 (5), 1521-1537 Google Scholar

  • [12]

    Koksal M., Koksal M.E., Commutativity of linear time-varying differential systems with non-zero initial conditions: A review and some new extensions, Mathematical Problems in Engineering, 2011, 2011 (2011), 1-25 Google Scholar

  • [13]

    Koksal M., Effects of nonzero initial conditions on the commutativity of linear time-varying systems, Proceedings of the International AMSE Conference on Modeling and Simulation, (June 1988, Istanbul, Turkey), 1988, 1A, 49-55 Google Scholar

  • [14]

    Koksal, M., Effects of commutativity on system sensitivity, Proceedings of the 6th International Symposium on Networks, Systems and Signal Processing, (June 1989, Zagreb, Yugoslavia), 1989, 61-62 Google Scholar

  • [15]

    Koksal M., Koksal M.E., Commutativity of cascade connected discrete-time linear time-varying systems, Transaction of the Institute of Measurement and Control, 2015, 37 (5), 615-622. Google Scholar

  • [16]

    C.A. Desoer, Slowly varying system x˙=a(t)x, IEEE Transactions on Automatic Control, 14 (1969), pp. 780-781 Google Scholar

  • [17]

    Okano R., Kida T., Nagashio T., Asymptotic stability of second-order linear time-varying systems, Journal of Guidance, Control, and Dynamics, 2006, 29 (6), 1472-1476Google Scholar

  • [18]

    Ratchagit K., Stability of linear time-varying systems, International Journal of Pure and Applied Mathematics, 2010, 63 (4), 411-417 Google Scholar

About the article

Received: 2016-07-28

Accepted: 2016-08-26

Published Online: 2016-10-06

Published in Print: 2016-01-01


Citation Information: Open Mathematics, ISSN (Online) 2391-5455, DOI: https://doi.org/10.1515/math-2016-0059.

Export Citation

© 2016 Koksal, published by De Gruyter Open.. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in