# Multiparameter Fractional Difference Linear Control Systems

Authors: Dorota Mozyrska
Journal: Discrete Dynamics in Nature and Society
 (2014)

---

## Abstract

The Riemann-Liouville-, Caputo-, and Grünwald-Letnikov-type fractional order difference operators are discussed and used to state and solve the controllability and observability problems of linear fractional order discrete-time control systems with multiorder and multistep. It is shown that the obtained results do not depend on the type of fractional operators and steps. The comparison of systems is made under the number of steps needed, firstly to achieve a final point, and secondly to distinguish initial conditions for particular operator.


---

## Body

## 1. Introduction

The main topic of the paper concerns systems with fractional difference operators. Fractional sums and operators are generalizations ofnth order differences. Since discrete dynamics are often used in modeling real phenomena and recently there is noticed great progress in using fractional dynamics for descriptions of some behaviours, the discussion of properties of possible discrete fractional control systems is strongly needed. Particularly, we consider systems with multiorder and multistep, which could help better in an attempt at simulation of processes and could be easily adapted by CAS programs. Properties of the fractional sums and operators were developed firstly by Miller and Ross [1] and continued by Atici and Eloe [2, 3] and Abdeljawad et al. [4, 5]. Another concept of the fractional sum/difference was introduced in [6–8]. We use in the paper sums and operators with h-differences. Since h>0 can represent a sample step, the presence of h in operators is interesting from both engineering and numerical points of view. We analyze the controllability and observability problem for multiorder and multistep linear systems while the problems of local controllability of nonlinear control systems defined by Caputo-type, Riemann-Liouville-type, and Grünwald-Letnikov-type difference operators, with step h=1 and commensurate order, were studied in [9]. Relations between these three types of operators were studied in [10].In this contribution, the Riemann-Liouville-, Caputo-, and Grünwald-Letnikov-type fractional order difference operators are discussed and used to state and solve the controllability and observability problems of linear fractional order discrete-time control systems with multiorder and multistep. Our goal is to state basic properties of fractional difference multiorder and multistep linear control systems and to compare using some particular examples if there are some varieties between operators and numbers of steps that we need to have a system being controllable or observable or achieve some exact target. It is shown that the obtained results do not depend on the type of fractional operators and steps. The comparison of systems is made under the number of steps needed, firstly to achieve a final point and secondly to distinguish initial conditions for particular operator. As our results are formulated for multistep systems, they remain also true for systems with the same step along coordinates of solutions and particularly for the common steph=1. We can also conclude similar corollaries comparing systems according to different or the same orders.In the paper definitions of operators for general step and orders are presented. In our systems we usen different orders and steps, so we define the multiorder as (α)=(α1,…,αn), where αi∈(0,1] and multistep (h)=(h1,…,hn), hi>0 for each i=1,…,n. In our paper we give proofs for solutions and some properties of systems defined by Riemann-Liouville-type fractional difference operator and using the formula of transformations between Riemann-Liouville and Grünwald-Letnikov types of operators presented in [10], we state results also for systems with Grünwald-Letnikov-type operator.The paper is organized as follows. In Section2, all preliminary definitions, facts, and notations are gathered. Section 3 presents initial value problems of fractional order systems of multiorder and multistep difference equations with three types of operators. There are considered systems with operators written in general form. In Section 4, the controllability problem for generalized form of systems is stated and solved, while in Section 5 the observability issue is discussed. At the end of Section 5 there is the example of flat fractional system. The problem of observability of this system is discussed.


## 2. Preliminaries

Now we are listing the necessary definitions and technical propositions that we use in the sequel of the paper. Leth>0, a∈ℝ and put
(1)(hℕ)a∶={a,a+h,a+2h,…}.
Then ℕ0={0,1,2,…}. For a function x:(hℕ)a→ℝ the forward h-difference operator is defined as (see [7])
(2)(Δhx)(t)=x(σ(t))-x(t)h,
where t∈(hℕ)a. In many papers there are defined fractional summations using the special kind of function called factorial function; see, for example, [7, 8, 10]. In order to have here simpler notation we use in definition generalized binomial function (αβ)=Γ(α+1)/Γ(β+1)Γ(α-β+1), where α,β∈ℝ∖{-1,-2,…} and Γ is the Euler gamma function. We use the convention that division at a pole yields zero.Definition 1.
For a functionx:(hℕ)a→ℝ the fractional h-sum of order α>0 is given by
(3)(Δah-αx)(t)∶=hα∑s=0q‍(q-s+α-1q-s)x(a+sh),
where t=a+(α+q)h, q∈ℕ0, and additionally (Δah0x)(t):=x(t).Fora=0 we write shortly Δh-α instead of Δ0h-α. Note that Δah-αx:(hℕ)a+αh→ℝ. Two fractional h-sums can be composed as follows.Proposition 2 (see [11]).
Letx be a real valued function defined on (hℕ)a, where a,h>0. For α,β>0 the following equalities hold:
(4)(Δa+βhh-α(Δah-βx))(t)=(Δah-(α+β)x)(t)=(Δa+αhh-β(Δah-αx))(t),
where t∈(hℕ)a+(α+β)h.In [7] the authors prove the following lemma that gives transition between fractional summation operators for any h>0 and h=1.Lemma 3.
Letx:(hℕ)a→ℝ and α>0. Then,
(5)(Δah-αx)(t)=hα(Δa/h1-αx~)(th),
where t∈(hℕ)a+αh and x~(s)=x(sh).In our consideration the crucial role is played by the power rule formula; see [7]:
(6)(Δah-αψ)(t)=Γ(μ+1)Γ(μ+α+1)(t-a+μh)h(μ+α),
where ψ(r)=(r-a+μh)h(μ), r∈(hℕ)a, and t∈(hℕ)a+αh. Then for ψ≡1 we have μ=0. Next, taking t=qh+a+αh, q∈ℕ0, we get
(7)(aΔh-α1)(t)=1Γ(α+1)(t-a)h(α)=Γ(q+α+1)Γ(α+1)Γ(q+1)hα=(q+αq)hα.As the tool in the present consideration we can define the next family of functions. Let(8)(k):=(k1,…,kn),ki∈ℕ0,(α)=(α1,…,αn),αi∈(0,1].
Moreover, let μ=∑i=1n‍αiki and K=∑i=1n‍ki. Then we define the family of functions φ(k)*:ℤ→ℝ by the following values:
(9)φ(k)*(q)∶={(q-K+μq-K),forq∈ℕK0,forq<K.
Note that the following relations hold:(1)
φ(0)*(q)=1, φ(k)*(K)=1, and φei*(1)=1, where ei is the unit vector in ℝn with 1 at the ith position and (0)=(0,…,0) is the zero vector in ℝn;(2)
φei*(q)=(q+νiq-1)=(Δ1-αi1)(q+νi), where νi=αi-1;(3)
φ(k)*(q)=Γ(q+1-K+μ)/Γ(1+μ)Γ(q+1-K) and as the division by pole gives zero, the formula works also for q<K;(4)
φ(k)*(q)=(1/Γ(1+μ))(q-K+μ)(μ)=(q-K+μμ).The properties of two-indexed functionsφk,s were given in [12, Proposition 2.5] and generalized for n-indexed functions φ(k)* in [12, 13] with multiorder (α). In the paper therein we use functions φ(k)* with step h=1 which gives better tool for multistep systems.Proposition 4.
Let fori=1,…,n: αi∈(0,1] and νi=αi-1, q∈ℕ1, k=(k1,…,kn)∈ℝn. Then for q∈ℕ0 holds
(10)(Δ-αiφ(k)*)(q+νi)=φ(k)+ei*(q).Family of functionsφ(k)* is useful for solving systems with Caputo-type operators. We formulate also similar family of functions that are used in solutions of systems with Riemann-Liouville-type operators. We define the family of functions φ(k):ℤ→ℝ by the following values:
(11)φ(k)(q)∶={(q-K+μq-K+1),forq∈ℕK-10,forq<K-1.
Note that the following relations hold: (1)
φ(k)(q)=(μ/(q-K+1))φ(k)*(q);(2)
φ(0)(0)=0, φ(k)(K)=μ, φei(1)=αi;(3)
for all(k)∈ℝn: φ(k)(q)≥0 and φ(k)*(q)≥0.For the family of functionsφ(k) we have similar behaviour for fractional summations as for φ(k)* so we can state the following proposition.Proposition 5.
Let fori=1,…,n: αi∈(0,1] and νi=αi-1, q∈ℕ1, k=(k1,…,kn)∈ℝn. Then for q∈ℕ0 holds
(12)(Δ-αiφ(k))(q+νi)=φ(k)+ei(q).Lemma 6 (see [12, 14]).
Letu:ℕ0→ℝ, α>0. For k∈ℕ0 let (Δ-kαu)(q+kα)=u1(q+kα) and u¯1(q)∶=u1(q+kα), q∈ℕ0. Then for k∈ℕ0 holds
(13)(Δ-αu¯1)(t)=(Δ-(k+1)αu)(t+kα),
where t=q+α, q∈ℕ0.Similarly as in [14], taking h=1 we can write that for ki∈ℕ0 and αi>0, i=1,…,n:
(14)(Δ-αj(Δ-∑iαikiu))(t)=(Δ-∑i≠jαiki-(kj+1)αju)(t),
where t=q+∑i≠j‍αiki+(kj+1)αj, q∈ℕ0. Also for μ=∑i‍αiki and q∈ℕ0 we have
(15)(Δ-μu)(q+μ)=∑r=0q‍(q-r+μ-1q-r)u(r).The next step is to present three main fractional difference operators: Caputo-type, Riemann-Liouville-type, and Grünwald-Letnikov-typeh-difference operators. We present all definitions for any positive h and scalar function x. In fact each of the operators with step h>0 can be translated into the according operator with step h=1. We state results about the inversions of operators in two cases for any positive h and h=1. Only the case of the Grünwald-Letnikov-type h-difference operators has no exact inverse operator, but we can transform an initial value problem stated for this operator into initial value problem for the Riemann-Liouville-type h-difference operators, where we change the domain of the state.Definition 7 (see [11]).
Letα∈(0,1]. The Caputo-type h-difference operator aΔh,*α of order α for a function x:(hℕ)a→ℝ is defined by
(16)(aΔh,*αx)(t)=(aΔh-(1-α)(Δhx))(t),
where t∈(hℕ)a+(1-α)h.Note thataΔh,*αx:(hℕ)a+(1-α)h→ℝ. Moreover, for α=1 the Caputo-type h-difference operator takes the form (aΔh,*1x)(t)=(aΔh0(Δhx))(t)=(Δhx)(t), where t∈(hℕ)a.For the Caputo-type fractional difference operator there exists the inverse operator that is the tool in recurrence and direct solving fractional difference equations.Proposition 8 (see [11]).
Letα∈(0,1], h>0, a=(α-1)h, and x be a real valued function defined on (hℕ)a. The following formula holds:
(17)(Δh-α(aΔh,*αx))(t)=x(t)-x(a),t∈(hℕ)αh.We can also state, similarly as in Lemma3, the transition formula for the Caputo-type operator between the cases for any h>0 and h=1.Lemma 9.
Letx:(hℕ)a→ℝ and α>0. Then,
(18)(aΔh,*αx)(t)=h-α(a/hΔ1,*αx~)(th),
where t∈(hℕ)a+αh and x~(s)=x(sh).From this moment for the caseh=1 we write Δa/h*α∶=Δa/h1,*α and the same notation we use for two other operators and fractional summations. Then the result from Proposition 8 is stated as
(19)(Δ-α(a/hΔ*αx~))(q+α)=x~(q+α)-x(a),
where q∈ℕ0, x~(s)=x(sh), and a=(α-1)h.The next presented operator is called fractionalh-difference Riemann-Liouville-type operator. The definition of the operator can be found, for example, in [2] (for h=1) or in [6] (for any h>0).Definition 10.
Letα∈(0,1]. The Riemann-Liouville-type fractional h-difference operator aΔhαx of order α for a function x:(hℕ)a→ℝ is defined by
(20)(aΔhαx)(t)=(Δh(aΔh-(1-α)x))(t),hhhhhhhhhhhhhlt∈(hℕ)a+(1-α)h.Forα=1 we have: (aΔh,*1x)(t)=(aΔh1x)(t)=(Δhx)(t).The next propositions give useful formula for transforming fractional difference equations into fractional summations.Proposition 11.
Letα∈(0,1], h>0, a=(α-1)h, and x be a real valued function defined on (hℕ)a. The following formula holds:
(21)(0Δh-α(aΔhαx))(t)=x(t)-x(a)·(thα-1),t∈(hℕ)αh.The next Lemma gives the transition formula for the Riemann-Liouville-type operator between the cases for anyh>0 and h=1.Lemma 12.
Letx:(hℕ)a→ℝ and α>0. Then,
(22)(aΔhαx)(t)=h-α(a/hΔ1αx~)(th),
where t∈(hℕ)a+(1-α)h and x~(s)=x(sh).For the caseh=1 we write Δa/hα∶=Δa/h1α. Then the result from Proposition 11 is stated as
(23)(Δ-α(a/hΔαx~))(q+α)=x~(q+α)-x(a)·(q+αq+1),
where q∈ℕ0, x~(s)=x(sh) and with a=(α-1)h.The third type of the operators that we take into our consideration is the fractionalh-difference Grünwald-Letnikov-type operator; see, for example, [15–17] for case h=1 and also for case h>0.Definition 13.
Letα∈ℝ. The Grünwald-Letnikov-type h-difference operator aΔ~hα of order α for a function x:(hℕ)a→ℝ is defined by
(24)(aΔ~hαx)(t)=∑s=0(t-a)/h‍as(α)x(t-sh),
where
(25)as(α)=(-1)s(αs)1hαwith(αs)={1fors=0α(α-1)⋯(α-s+1)s!fors∈ℕ.We can easily see the following comparison.Proposition 14 (see [10]).
Leta=(α-1)h. Then
(26)∇h(aΔh-(1-α)x)(nh)=(0Δ~hαy)(nh),
where y(nh):=x(nh+a) or x(t)=y(t-a) for t∈(hℕ)a and (∇hx)(nh)=(x(nh)-x(nh-h))/h.From Proposition14 we get in the next chapters the possibility of stating exact formula for solution of initial value problems with the Grünwald-Letnikov-type difference operators by the comparison with parallel problems with the Riemann-Liouville-type operators.The operators presented in this section can be extended to operators acting on vector valued functions in a componentwise manner.


## 3. Multiorder and Multistep Fractional Difference Linear Systems

In this section we consider initial value problems of fractional order systems of multiorder and multistep difference equations with three types of operators. In the next section we state as the conclusion the solution of initial value problem for control systems with the Caputo-, the Riemann-Liouville-, and the Grünwald-Letnikov-type difference operators and formulate common results for the controllability as well for observability. We consider systems with operators written in the general form(27)(aiΥhiαixi)(qhi)=∑j=1n‍Aijxj(qhj+aj),q∈ℕ0,
where i=1,…,n and n∈ℕ1, with the initial condition
(28)x(a)=[x1(a1)⋮xn(an)]=[xa1⋮xan]∈ℝn.
Therein functions xi:(hℕ)ai→ℝ, Aij∈ℝ, x¯i(s)=x~i(s+νi)=xi(ai+shi), ai=νihi=(αi-1)hi if aiΥhiαi=aiΔhi,*αi or aiΔhiαi and ai=0 if aiΥhiαi(qhi)=0Δ~hiαi(qhi+hi). We stress that for the Grünwald-Letnikov-type the left side of (27) is shifted; compare [10]. By Lemma 9 we can write system (27) in the form
(29)(νiΥαix~i)(q)=hiαi∑j=1n‍Aijx¯j(q),i=1,…,n,x¯i(0)=xai,
where νi=ai/hi=αi-1.Theorem 15.
The solution of system (27) with initial condition (28) is of the form
(30)[x1(qh1+a1)⋮xn(qhn+an)]=Φ(q)[xa1⋮xan],
where for q∈ℕ0:
(31)Φ(q)=∑(k):0≤∑i=1nki≤q‍T(k)M(k)(q),(32)Mk(q)={φ(k)*(q)In,aiΥhiαi=Δaihi,*αi;diag⁡(φe1+(k),φe2+(k),…,φen+(k))(q),aiΥhiαi=Δaihiαi,T(k)={In,for(k)=(0);hikiαi[0…0⋮⋮⋮Ai1…Ain0…0⋮⋮⋮0…0]ki,forki>0,kj=0,j≠i,∑i=1n‍TeiT(k)-ei,forki>0,kj≠0,j≠i.Proof.
The most important step in the proof is to use the properties of fractional summations with different orders of functions from familiesφ(k)* and φ(k). Let x(a)=[xa1⋮xan] and νi=ai/hi=αi-1. For q=0 we see that Φ(0)=T(0)M(0)(0)=In; hence, the formula agrees with the initial condition. The only one doubt that we should check is the value of M(0)(0) for the case of Riemann-Liouville-type operator. In fact we have M(0)(0)=diag⁡(φe1(0),…,φen(0))=In. By Proposition 8 we obtain the recursive formulas for the Caputo-type operator, i=1,…,n and q∈ℕ1, νi=αi-1:
(33)xi(qhi+ai)=x¯i(q)=xai+hiαi∑j=1n‍Aij(Δ-αix¯j)(q+νi).
Since for the Riemann-Liouville-type operator we start with x¯i(q)=xaiφei(q)=xai(q+αi-1q), from Proposition 11 we obtain
(34)xi(qhi+ai)=x¯i(q)=φei(q)xai+hiαi∑j=1n‍Aij(Δ-αix¯j)(q+νi).
Using matrices T(0),Tei and functions M(k)(q), recursive relations (33) and (34) could be rewritten in the form
(35)x¯(q)=T(0)M(0)(q)x(a)+∑i=1n‍Tei(Δ-αix¯)(q+νi)
or equivalently as
(36)x¯(q)=[x¯1⋮x¯n](q)=T(0)M(0)(q)[xa1⋮xan]+∑i=1n‍Tei(Δ-αi[x¯1⋮x¯n])(q+νi).
It is important to stress that the recursive formula (36) and the initial value problem given by the system (27) with initial condition (28) are equivalent. Moreover, the recursive formula (36) represents the unique solution to the initial value problem. In order to prove that formula (30) is the solution to the stated problem we can check that it satisfies the equality (36) and initial condition. The zero step for initial condition has been already checked. Then, the crucial role is played by the following property:
(37)(Δ-αiM(k))(q+νi)=M(k)+ei(q),
that follows from Propositions 4 and 5. Moreover, as for sequences (k) such that ∑i=1n‍ki>q we have M(k)(q)=0; then the values of the matrix Φ in the formula (31) can be written as an infinite summation:
(38)Φ(q)=∑(k):0≤∑i=1nki≤q‍T(k)M(k)(q)=∑(k):∑i=1nki≥0‍T(k)M(k)(q).
LetK=∑i=1n‍ki. Then the right-hand side of the recursive formula (36) takes the form
(39)T(0)M(0)(q)x(a)+∑i=1n‍Tei(Δ-αix¯)(q+νi)=(T(0)M(0)(q)+∑i=1n‍Tei∑(k):K≥0‍T(k)M(k)+ei(q))x(a)=(T(0)M(0)(q)+∑i=1n‍Tei∑(k):K≥1‍T(k)-eiM(k)(q))x(a)=T(0)M(0)(q)x(a)+∑(k):K≥1‍∑i=1n‍TeiT(k)-ei︸T(k)M(k)(q)x(a)=∑(k):K≥0‍T(k)M(k)(q)x(a)=∑(k):0≤K≤q‍T(k)M(k)(q)x(a)=x¯(q).
Hence the thesis holds.


## 4. Controllability

In this section we construct the solution of initial value problems and consider the controllability problem of multistep and multiorder difference linear control systems for different forms of operators.We consider systems with operators written in the general form(40)(aiΥhiαixi)(qhi)=∑j=1n‍Aijxj(qhj+aj)+biu(q),hhhhhhhhhhhhhhhhhhhlhhhhhhhhlhq∈ℕ0,
where i=1,…,n and n∈ℕ1 and with initial condition
(41)x(a)=[x1(a1)⋮xn(an)]=[xa1⋮xan]∈ℝn.
Therein functions xi:(hℕ)ai→ℝ, Aij∈ℝ, x¯i(s)=x~i(s+νi)=x(shi+ai) with ai=(αi-1)hi and νi=αi-1 if aiΥhiαi=Δaihi,*αi or aiΔhiαi and νi=0 if aiΥhiαi=Δ~0hiαi. Moreover, bi∈ℝ1×m are constant-row matrices. By Lemmas 9 and 12 we can write system (40) in the form
(42)(νiΥαix~i)(q)=hiαi∑j=1n‍Aijx¯j(q)+hiαibiu(q),2222222i=1,…,n,q∈ℕ0.Theorem 16.
Let(43)Bi=[0bihiαi0]∈ℝn×m
be the ith row which is equal to bihiαi. Then, the solution of system (42) with the initial condition x(a)=xa∈ℝn which is unique and given by
(44)γ(q,x(a),u)=Φ(q)x(a)+∑i=1n‍∑r=0q‍Ei(q-σ(r))Biu(r),
where q∈ℕ0 and
(45)Ei(q)=∑(k):0≤∑inki≤q‍T(k)φ~(k)+ei(q),φ~(k)(q)∶=(q+μ-1q),μ=∑i=1n‍kiαi.Proof.
The steps in the proof are similar to the case with one value for the steph=1 like it is presented in [14].We can consider also the valueE(-1)=0. Then for q∈ℕ1 the solution of (40) can be rewritten in the form
(46)γ(q,x(a),u)=Φ(q)x(a)+∑i=1n‍∑r=0q-1‍Ei(q-σ(r))Biu(r).Definition 17.
System (40) is (completely) controllable inq-steps from the initial state (41) to the final state
(47)x(f)=[xf1⋮xfn]∈ℝn,
such that x(f)≠x(a), if there is a control u, such that
(48)γ(q,x(a),u)=x(f).Note that controllability means that the final state can be reached inq-steps, where q∈ℕ1.Let us define the controllability matrix for the system (42) in the following way, as in [13]:
(49)Qq=∑r=0q-1‍P(q,r)PT(q,r),
where
(50)P(q,r)=∑i=1n‍Ei(q-σ(r))Bi
and PT(q,r) denotes the transposition of the matrix P(q,r). It can be noticed that Qq is a symmetric n×n-dimensional matrix.The next propositions give the formula for the values of steering control and also rank condition for complete controllability. The results have the same meaning like in the classical theory. For the fractional difference systems with the Caputo-type operator with one steph and two orders (α)=(α1,α2) some conditions were proved in [13]. The basic difference here is the form of the matrices T(k) and Bi, where we have multiplication of rows by hikiαi or only hiαi for bi, which can influence the rank of controllability matrix Qq. See the example in the end of the next section. It is important to notice that the form of the controllability matrix and of the formula of values u¯(r)>0 do not depend on the type of the operator.Proposition 18 (see [13]).
If the matrixQq is nonsingular, then the following control function
(51)u¯(r)=PT(q,r)·Qq-1(x(f)-Φ(q)x(a))
transfers the initial state x(a) to the final state x(f)=γ(q,x(a),u).Proposition 19.
Control system (40) is controllable in q steps if and only if rank⁡Qq=n.


## 5. Observability

Let us consider multiorder and multistep difference linear control system of the form (40), written as a common form for each operator, where the output function is the same
(52)η(q)=Cx¯(q)+Du(q)
as initial condition x(a) given by (41), where q∈ℕ0. Note that for q∈ℕ0 from the output relation (52) it follows that the output trajectory of this system, denoted by χ(·,x(a),u), is given by
(53)χ(q,x(a),u)=CΦ(q)x(a)+C·∑i=1n‍∑r=0q‍Ei(q-σ(r))Biu(r)+Du(q),
where x(a) is the initial state described by (41) and E(-1)=0.Definition 20.
System (40) with the output function (52) is observable inqsteps, if having a control u={u(0),u(1),…,u(q)}, and output sequence y={η(0),η(1),…,η(q)} one can determinate the initial condition x(a) of this system.
Let us define a real matrix(54)𝒪q=∑r=0q‍ΦT(r)CTCΦ(r),
where q∈ℕ0 and ΦT denotes the transposition of Φ. Since it is defined in the similar manner as the classical observability Gramian, we call it the (fractional) observability Gramian. Observe that C∈ℝp×n and so CΦ(q)∈ℝp×n.Theorem 21.
System (40) with the output function (52) is observable in q steps if and only if matrix 𝒪q given by (54) is nonsingular.At the end we give the example in which we show that for a given system with the Riemann-Liouville-type operator we have faster recognition of the initial state than for the system with the Caputo-type operator.Theorem 22.
System (40) with the output (52) is observable in q steps if and only if one of the following conditions is satisfied: (i)
columns of the matrixCΦ(q) are linearly independent;(ii)
rank⁡[CΦ(0)⋮CΦ(q)]=n.The matrix(55)[CΦ(0)⋮CΦ(q)]
is called the (fractional) observability matrix. Directly from the fact that matrix 𝒪q is nonsingular and from the proof of Theorem 21 it follows that this matrix is positively defined.Example 23.
Let us consider linear control system with two fractional ordersα≠β and with two steps (h)=(h1,h2):
(56)(a1Υh1αx¯)(q)=x¯(q)+2y~(q),(a2Υh2βy¯)(q)=2x¯(q)+y~(q),η(q)=x¯(q)+y~(q)
with initial condition [x(a1),y(a2)]=[x¯(0),y~(0)]. Let x:(hℕ)a→ℝ, y:(hℕ)b→ℝ. (1)
Firstly we consider the situation with the Caputo-type difference andh1=h2=1. Note that T(0,0)=I2 and φ(0)*(q)=1, φei*(1)=1. Then Φ(1)=T(0)φ(0)*(1)+ T(0,1)φ(1,0)*(1)+T(0,1)φ(0,1)*(1) =[2222]. This implies that
(57)rank⁡[CΦ(0)CΦ(1)]=1,
so our system is not observable in q=1 step. For q=2 we have
(58)φ(1,0)*(2)=1+α,φ(0,1)*(2)=1+β,φ(1,1)*(2)=φ(2,0)*(2)=φ(0,2)*(2)=1,T(1,1)=[4224],T(2,0)=[1200],T(0,2)=[0021].
Now we are ready to state the value of fundamental matrix for q=2: Φ(2)= T(0)φ(0)*(2) +T(0,1)φ(1,0)*(2) +T(0,1)φ(0,1)*(2)+ 2T(1,1)φ(1,1)*(2)+T(2,0)φ(2,0)*(2) +T(0,2)φ(0,2)*(2)= [11+α8+2α8+2β11+β]. Then CΦ(2)=[19+α+2β,19+2α+β]. Hence for α≠β holds rank⁡[CΦ(0)CΦ(1)CΦ(2)]=2, so the system is observable in q=2 step.(2)
Taking into account the Caputo-type operator andh1=1, h2=h≠1 we get Φ(1)=I2+ [1200]+hβ[0021] =[222hβ1+hβ]. This implies that
(59)det⁡[CΦ(0)CΦ(1)]=1-hβ≠0;
hence then system is observable in q=1 step.(3)
Now we take the Riemann-Liouville-type operator; then we need values of matrix functionM(k)(q). Observe that
(60)M(0,0)(1)=diag⁡(φ(1,0),φ(0,1))(1)=[α00β],M(1,0)(1)=diag⁡(φ(2,0),φ(1,1))(1)=I2,M(0,1)(1)=I2;
then Φ(1)=T(0,0)M(0,0)(1)+T(1,0)M(1,0)(1)+T(0,1)M(0,1)(1)=[α00β]+[1221]=[1α221+β]. And
(61)det⁡[CΦ(0)CΦ(1)]=2,
for α≠β; hence then system is observable in q=1 step.


## 6. Conclusions

From our consideration it follows that we could not distinguish which model/type of the system is better according to the controllability or the observability properties. In fact it depends on the matrices inside the systems. Moreover parameters that one can include in the description of some process involve the model and the type operator with ramifications of the used model. We cannot downplay the role of the used orders and steps. However this paper does not discuss any particular process. This is rather theoretical consideration of possible properties.



---

*Source: 183782-2014-03-02.xml*