State and input observability for structured linear systems: A graph-theoretic approach
|
|
- Myrtle Osborne
- 5 years ago
- Views:
Transcription
1 State and input observability for structured linear systems: A graph-theoretic approach Taha Boukhobza, Frédéric Hamelin, Sinuhé Martinez-Martinez To cite this version: Taha Boukhobza, Frédéric Hamelin, Sinuhé Martinez-Martinez. State and input observability for structured linear systems: A graph-theoretic approach. Automatica, Elsevier, 2007, 43 (7), pp < /j.automatica >. <hal > HAL Id: hal Submitted on 6 Jun 2007 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 State and input observability for structured linear systems: A graph-theoretic approach T. Boukhobza, F. Hamelin and S. Martinez-Martinez Centre de Recherche en Automatique de Nancy, Nancy University, CNRS UMR 7039, BP 239, Vandœuvre, France.Phone: , Fax: , taha.boukhobza@cran.uhp-nancy.fr Abstract This paper deals with the state and input observability analysis for structured linear systems with unknown inputs. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system s structure. Using a particular decomposition of the systems into two subsystems, we express, in simple graphic terms, necessary and sufficient conditions for the generic state and input observability. These conditions are easy to check because they are based on comparison of integers and on finding particular subgraphs in a digraph. Therefore, our approach is suited to study large scale systems. Key words: Graph theory, structured systems, state and input generic observability. 1 Introduction The problem of estimating the state and the unknown input is of great interest mainly in control law synthesis, fault detection and isolation, fault tolerant control, supervision and so on. In this respect, many works (Chu, 2000; Chu and Mehrmann, 1999; Hou et al., 1999; Trin and Ha, 2000; Tsui, 1996) are focused on the design of state observers for linear systems subject to unknown inputs. Otherwise, the issue of simultaneously observing the whole state and the unknown input has been investigated in (Hou and Müller, 1992; Koenig, 2005). In most cases, the studies on the state and input observability deal with algebraic and geometric tools (Basile and Marro, 1973; Hou and Müller, 1999; Hou and Patton, 1998; Trentelman et al., 2001). The use of such tools requires the exact knowledge of the state space matrices characterizing the system s model. However, in many modeling problems, these matrices have a number of fixed zero entries determined by the physical laws while the remaining entries are not precisely known. To study the properties of these systems in spite of poor knowledge we have on them, the idea is that we only keep the zero/non-zero entries in the state space matrices. Thus, we consider models where the fixed zeros are conserved while the non-zero entries are replaced by free parameters. There is a huge amount of interesting works in the literature using this kind of models called structured models. The study of such systems requires a low computational burden which allows one to deal with large scale systems. Many studies on structured systems are related to the graph-theoretic approach to analyse some system properties such as controllability, observability or the solvability of several classical control problems including disturbance rejection, input-output decoupling,... (Dion et al., 2003). It results from these works that the graph-theoretic approach provides simple and elegant solutions. However, the well-known graphic observability conditions for linear structured systems recalled in (Dion et al., 2003) cannot be applied to systems with unknown inputs. More recently, in (Boukhobza et al., 2006) authors express in graphic terms necessary and sufficient conditions for the observability of general descriptor systems. Nevertheless, these conditions are quite complicated. In this context, the purpose of this paper is to use a graphtheoretic approach for providing necessary and sufficient conditions for the state and input observability for structured linear systems. The paper is organised as follows: after Section 2, which is devoted to the problem formulation, a digraph representation of structured systems is given in Section 3. The main result is enounced in Section 4. Finally, some concluding remarks are made. 2 Problem formulation In this paper, we treat numerically non-specified systems on the form: Σ : { ẋ(t) = Ax(t) + Bu(t) y(t) = Cx(t) + Du(t) where x R n, u R q and y R p are respectively the state vector, the unknown input vector and the output vector. We assume that only the zero/nonzero structure of A, B, C and D is known. This means that, to each entry in these matrices, we only know whether its value is fixed to zero, in which case we call it a fixed zero, or that it has an unknown real value, in which case we call the entry a free parameter. In a structured system with h nonzero entries in A, B, C and D, we can parameterize these nonzero entries by scalar real (nonzero) parameters i, i = 1,..., h forming a parameter (1) Preprint submitted to Automatica December 7, 2006
3 vector Λ = ( 1,..., h ) T R h. We denote by A, B, C and D respectively the matrices obtained by replacing the nonzeros in A, B, C and D by the corresponding parameters i, i = 1,..., h, and we denote { ẋ(t) = A x(t) + B u(t) Σ Λ : (2) y(t) = C x(t) + D u(t) If all parameters i are numerically fixed, we obtain a socalled admissible realization of structured system Σ Λ. More precisely, a realization of Σ Λ is a linear system Σ which has no indeterminate parameters and has the same structure than Σ Λ i.e. A(i,j) = 0 A (i,j) = 0, B(i,j) = 0 B (i,j) = 0, C(i, j) = 0 C (i,j) = 0 and D(i,j) = 0 D (i,j) = 0. We say that a property is true generically (van der Woude, 2000) if it is true for almost all the realizations of structured system Σ Λ. Here, for almost all the realizations is to be understood (Dion et al., 2003; van der Woude, 2000) as for all parameter values (Λ R h ) except for those in some proper algebraic variety in the parameter space. The proper algebraic variety for which the property is not true is the zero set of some nontrivial polynomial with real coefficients in the h system parameters 1, 2,..., h or equivalently it is an algebraic variety which has Lebesgue measure zero (Reinschke, 1988). In this paper, we study the generic state and input observability for structured system Σ Λ. This notion is related to the strong observability and the left invertibility (Trentelman et al., 2001). Let us recall the inition of the generic state and input observability: Definition 1 Consider structured system Σ Λ, we say that Σ Λ is generically state and input observable if and only if it is generically strongly observable and left invertible. In other words, system Σ Λ is generically state and input observable iff, for almost all realizations of Σ Λ, for all initial state x 0 and for every input function u(t), y(t) = 0 for t 0 implies x(t) = 0 for t 0 and u(t) = 0 for t > 0. Roughly speaking, generic state and input observability means that a change in input or initial state can be reflected in a change of measurements. Necessary and sufficient conditions for the state and input observability of structured system Σ Λ can be deduced from the ones provided in (Trentelman et al., 2001) or from the conditions of the right-hand side observability of a descriptor system (Hou and Müller, 1999): Theorem 2 Consider ( structured ) system Σ Λ and let us denote P(s) = si n B. Structured system Σ Λ A is C D generically state and input observable ( ) iff s C B g_rank(p(s)) = n + g_rank = n + q. Assume that system Σ Λ is numerically specified. Regarding P(s) as a rational matrix, we call its rank the normal-rank (van der Woude, 2000) and we denote this normal rank by n-rank(p(s)). Thus, for each realization of system Σ Λ, we can compute the n-rank of P(s). This D rank will have the same value for almost all parameter values R h (Reinschke, 1988; van der Woude, 2000). This so-called generic n-rank of P(s) will be denoted by g_n-rank(p(s)). Generic rank of matrix P(s), denoted g_rank(p(s)), is quite different as it depends on s. Hence, g_rank(p(s)) = r, s C means that for almost all parameter values R h, rank(p(s)) = r, s C. The aim of the paper is to give graphical conditions to analyse the question whether or not structured system Σ Λ is generically state and input observable. These conditions are equivalent to the ones of Theorem 2 but are quite easy to check since they are based on finding paths in a digraph. 3 Graph representation of structured linear systems This section is devoted in a first stage to the inition of a digraph representing Σ Λ. Next, we give some useful notations and initions. Digraph G(Σ Λ ) associated to Σ Λ is constituted by a vertex set V and an edge set E i.e. G(Σ Λ ) = (V, E). More precisely, V = X Y U, where X = {x 1,...,x n } is the set of state vertices, Y = {y 1,...,y p } is the set of output vertices and U = {u 1,...,u q } is the set of unknown input vertices. The edge set is E = A-edges B-edges C-edges D-edges, with A-edges = { (x j,x i ) A (i,j) 0 }, B-edges = { (u j,x i ) B (i,j) 0 }, C-edges = { (x j,y i ) C (i,j) 0 }, D-edges = { (u j,y i ) D (i,j) 0 }. Here, M (i,j) is the (i,j)th element of matrix M and (v 1,v 2 ) denotes a directed edge from vertex v 1 V to vertex v 2 V. Hereafter, we illustrate the proposed digraph representation with an example. Example 3 To the system ined by the following matrices, we associate the digraph in Figure A = , B =, C = 18, D = x 1 u 1 x 2 u 2 x 6 x 3 x 4 x 5 x 8 x 7 y 4 x 9 y 3 y 1 y 2 Fig 1: Digraph associated to system of Example 3 2
4 Let us now give some useful initions and notations. Two edges e 1 = (v 1,v 1) and e 2 = (v 2,v 2) are v- disjoint if v 1 v 2 and v 1 v 2. Note that e 1 and e 2 can be v-disjoint even if v 1 = v 2 or v 1 = v 2. To illustrate the latter inition, note that in example 3, (x 5,y 2 ) and (x 4,x 5 ) as well as (x 2,x 1 ) and (x 1,x 2 ) are v-disjoint. However, neither (x 3,x 6 ) and (x 4,x 6 ) nor (x 7,y 3 ) and (x 7,x 5 ) are v-disjoint. Some edges are v- disjoint if they are mutually v-disjoint. A subgraph S G of G(Σ Λ ) is ined by an edge subset S E E and a vertex subset S V V such that S V is constituted by the begin and the end vertices of all elements of S E. We note S G = (S V, S E ). A subgraph S G of G(Σ Λ ) is a v-disjoint subgraph if all its edges are v-disjoint. A subgraph S G = (S V, S E ) of G(Σ Λ ) covers vertex v if e S E such that v is the begin vertex of e. We denote path P containing vertices v r0,..., v ri by P = v r0 v r1... v ri, where (v rj,v rj+1 ) E for j = 0, 1...,i 1. A cycle is a path of the form v r0 v r1... v ri v r0, where all vertices v r0, v r1,..., v ri are distinct. Some paths are disjoint if they have no common vertex. Path P is an Y-topped path if its end vertex is an element of Y. The length of a path is the number of edges that the path uses, counting multiple edges multiple times. Let V 1 and V 2 denote two subsets of V. The cardinality of V 1 is noted card(v 1 ). A path P is said a V 1 -V 2 path if its begin vertex belongs to V 1 and its end vertex belongs to V 2. If the only vertices of P belonging to V 1 V 2 are its begin and its end vertices, P is said a direct V 1 -V 2 path. A set of l disjoint V 1 -V 2 paths is called a V 1 -V 2 linking of size l. The linkings which consist of a maximal number of disjoint V 1 -V 2 paths are called maximum V 1 -V 2 linkings. We ine by ρ (V 1, V 2 ) the size of these maximum V 1 -V 2 linkings. The length of a V 1 -V 2 linking is ined as the sum of the lengths of all its paths. µ(v 1, V 2 ) is the minimal number of vertices belonging to a maximum V 1 -V 2 linking. Note that the minimal length of a maximum V 1 -V 2 linking is equal to µ(v 1, V 2 ) ρ(v 1, V 2 ). V ess (V 1, V 2 ) = {v V v is included in every maximum V 1 -V 2 linking}. Vertex subset V ess (V 1, V 2 ) denotes the set of all essential vertices (van der Woude, 2000), which correspond by inition to vertices present in all the maximum V 1 -V 2 linkings. S V is a separator between sets V 1 and V 2, if every path from V 1 to V 2 contains at least one vertex in S. We call minimum separators between V 1 and V 2 any separators having the smallest size. According to Menger s Theorem, the latter equals ρ(v 1, V 2 ). There exist two uniquely determined minimum separators between V 1 and V 2 noted S i (V 1, V 2 ) and S o (V 1, V 2 ) such that (van der Woude, 2000): - S i (V 1, V 2 ) is the set of the end vertices of all direct V 1 V ess (V 1, V 2 ) paths, where V ess (V 1, V 2 ) V 1 is considered, in the present inition, as output vertices. Vertex subset S i (V 1, V 2 ) is the minimum input separator. - S o (V 1, V 2 ) is the set of begin vertices of all direct V ess (V 1, V 2 ) V 2 paths, where V ess (V 1, V 2 ) V 2 is considered, in the present inition, as input vertices. Vertex subset S o (V 1, V 2 ) is the minimum output separator. It results, from the previous initions, that V ess (V 1, V 2 ) V 1 S i (V 1, V 2 ) and V ess (V 1, V 2 ) V 2 S o (V 1, V 2 ). θ(v 1, V 2 ) is the maximal number of v-disjoint edges from V 1 to V 2. In Example 3, ρ(u,y) = 2 and θ(u,y) = 1. Furthermore, there exist several maximum linkings: {u 1 x 3 x 4 x 5 y 1 ; u 2 y 4 }, {u 1 x 3 x 4 x 6 x 5 y 1 ; u 2 x 8 y 4 },... According to the fact that the first maximum linking is the "shortest one" with a length equal to 5, we have that µ(u,y) = 7. Finally, V ess (U,Y) = {u 1, x 3, x 5, u 2 }, S i (U,Y) = {u 1, u 2 } and S o (U,Y) = {x 5, u 2 }. 4 Main results 4.1 Preliminary results At first, let us specify a particular subdivision of structured system Σ Λ : Definition 4 For structured system Σ Λ represented by digraph G(Σ Λ ), we ine the vertex subsets: 0 X 1 Y 0 Y 1 U 1 = {x i ρ(u {x i },Y) = ρ(u,y)}; = {x i ρ(u {x i },Y) > ρ(u,y)} = X \ 0; = {y i ρ(u,y) > ρ(u,y \ {y i })} = Y V ess(u,y); = Y \ Y 0; U 0 = {u i θ({u i },X 1 Y 1) = 0}; = U \ U 0; X s = S o (U 0,Y) X and X 0 = 0 \ X s. Furthermore, we ine n 0 = card(x 0 ), n s = card(x s ), n 1 = card(x 1 ), q 0 = card(u 0 ), q 1 = card(u 1 ), p 0 = card(y 0 ) and p 1 = card(y 1 ). Considering the system described in Example 3, we have mentioned that ρ(u,y) = 2. Since Y V ess (U,Y) =, we have that Y 0 =, Y 1 = Y. Moreover, for i = 1,...,9, let us compute the number of disjoint paths from U {x i } to Y: for i = 1,...,6, ρ(u {x i },Y) = 2 and for i = 7,...,9, ρ(u {x i },Y) = 3. We can deduce that 0 = {x 1, x 2, x 3, x 4, x 5, x 6 }, X 1 = {x 7, x 8, x 9 }. Furthermore, contrary to u 2, u 1 cannot be linked with an edge to an element of X 1 Y 1, so U 0 = {u 1 } and U 1 = {u 2 }. Finally, V ess (U 0,Y) = {u 1,x 3,x 5 } and so S o (U 0,Y) = {x 5 }. Thus, X s = {x 5 } and X 0 = 0 \ X s = {x 1, x 2, x 3, x 4, x 6 }. Let us comment the graph partition presented above: 0 merges the state vertices which cannot be linked to Y, the state vertices belonging to V ess (U,Y). Obviously, V ess (U,Y) X 0 and the state vertices from which all Y-topped paths lead to V ess (U,Y). Indeed, if it is not the case i.e. there exist v i 0 and a path P from v i to Y which does not contain any element of V ess (U,Y), then there is no element of S o (U,Y) in P and so card(s o (U {v i },Y)) > card(s o (U,Y)). According to Menger s Theorem, this implies that ρ(u {v i },Y) > ρ(u,y), which is in contradiction with assumption v i 0. Directly from the inition of Y 0, we have that Y 0 V ess (U,Y) and so Y 0 S o (U,Y). 3
5 Assume that ρ(u,y) = q, then ρ(u 1,Y) = card(u 1 ). In this case, U 1 V ess (U,Y) and subsequently U 1 S i (U,Y). Moreover, all elements of U 1 are begin vertices of U-Y paths where all vertices are in U 1 X 1 Y 1. Since, (X 1 Y 1 ) V ess (U,Y) =, all elements of U 1 are begin vertices of direct V ess (U,Y) Y paths and so U 1 S o (U,Y). Otherwise, U 1 S i (U,Y) and U 1 S o (U,Y) imply that, in a maximum U-Y linking, all vertices included in a path starting from U 1 are not included in V ess (U,Y) and so are not included in 0. So, V ess (U,Y) = U 1 V ess (U 0,Y) (3) From each x i X 1, there exists an Y-topped path, which is disjoint with at least one maximum U-Y linking. Therefore, x i X 1, there exists an Y-topped path constituted only by the elements of X 1 and Y 1. In the same sense, x i X 1, in all the maximum U {x i } Y linkings, the paths beginning with the vertices of U 1 {x i } are necessarily in X 1 Y 1. Similarly, y i Y 1, in all the maximum U Y \{y i } linkings, the paths beginning with the vertices of U 1 are necessarily in X 1 Y 1. Thus, x i X 1 and y i Y 1, V ess (U {x i },Y) ( 0 Y 0 ) = V ess (U,Y \ {y i }) ( 0 Y 0 ) = V ess (U 0,Y) (4) According to Definition 4, we state now: Lemma 5 Consider structured system Σ Λ represented by digraph G(Σ Λ ), where ρ(u,y) = q. Using the subdivision given in Definition 4, we have: St1. S o (U 0,Y) (X 1 Y 1 ) = ; St2. v i 0 U 0, v i S o (U 0,Y) θ({v i },X 1 Y 1 ) 0; St3. θ(x s,x 1 Y 1 ) = card(x s ) = n s ; St4. S o (U 0,Y) U 0 = ; St5. θ(x 0,X 1 Y 1 ) = 0; St6. Y 0 S o (U 0,Y). Proof: [St1.] Due to the inition of X 1 and Y 1, (X 1 Y 1 ) V ess (U,Y) =. Yet, S o (U 0,Y) V ess (U 0,Y) V ess (U,Y). Then, S o (U 0,Y) (X 1 Y 1 ) =. [St2.] First, we show that v i 0, if θ({v i },X 1 Y 1 ) 0 then v i S o (U,Y). We have that v i 0 and θ({v i },X 1 Y 1 ) 0 imply that v i V ess (U,Y). Indeed, if is assumed that it is not the case, then according to relations (4), x j X 1, v i / V ess (U {x j },Y) and y k Y 1, v i / V ess (U,Y \ {y k }). Since v i is directly linked to X 1 Y 1, then there exists a {v i } Y path which is disjoint from all the paths constituting a maximum U-Y linking. This is equivalent to ρ(u {v i },Y) > ρ(u,y), which is in contradiction with the fact that v i 0. Furthermore, not only v i V ess (U,Y) but also it is the begin vertex of a direct V ess (U,Y) Y path. Thus, v i S o (U,Y). Moreover, from equality (3), v i V ess (U 0,Y) and as v i is the begin vertex of a direct V ess (U 0,Y) Y path, this implies that v i S o (U 0,Y). Now, we will prove that v i 0 U 0, θ({v i },X 1 Y 1 ) = 0 v i / S o (U 0,Y). Assume that there exists v i 0 U 0 such that θ({v i },X 1 Y 1 ) = 0 and v i S o (U 0,Y). Obviously, v i S o (U 0,Y) implies that v i is included in all maximum U 0 Y linkings. Consider any maximum U 0 Y linking, it necessarily includes a path of the form P = u j... v i v j1 v j2... v jk y t. First note that as θ({v i },X 1 Y 1 ) = 0, v j1 0. Next, for r > 1 if v jr X 1 then from the previous settings v jr 1 S o (U 0,Y). Nevertheless, this is impossible because in any maximum U 0 -Y linkings, we must have one and only one element of S o (U 0,Y) in every path. So, v j1, v j2..., v jk are all included in 0. Besides, y t / Y 1 because otherwise v jk S o (U 0,Y). This implies necessarily that, y t Y 0. By inition, Y 0 V ess (U,Y) and from equality (3), we have y t V ess (U 0,Y). Thus, y t S o (U 0,Y). Hence, in path P, we have two elements ofs o (U 0,Y). As this fact is impossible, the assumption that there exists v i 0 U 0 such that θ({v i },X 1 Y 1 ) = 0 and v i S o (U 0,Y) is false and [St2] is proved. [St3.] In any maximum U 0 -Y linking, there are n s paths containing vertices of X s which end necessarily with a vertex of Y 1. Moreover, in all these paths, all state vertices between elements of X s and output vertices belong to X 1. Hence, there exist n s disjoint paths linking X s to Y 1 and including only vertices of X 1 Y 1. So, θ(x s,x 1 Y 1 ) = n s. [St4.] As θ(u 0,X 1 Y 1 ) = 0, we have from [St2] that U 0 S o (U 0,Y) =. [St5.] Since X 0 = X \ (X s X 1 ), where X s = S o (U 0,Y) X, we have that S o (U 0,Y) X 0 =. So, directly from [St2], θ(x 0,X 1 Y 1 ) = 0. [St6.] From statement [St2], v i S o (U 0,Y), satisfying θ({v i },X 1 Y 1 ) 0 we have that v i S o (U,Y) and so that S o (U 0,Y) S o (U,Y). Besides, U 1 S o (U,Y), U 1 S o (U 0,Y) = and card(s o (U,Y)) = q 1 + q 0 = card(u 1 ) + card(s o (U 0,Y)). Thus, S o (U,Y) = S o (U 0,Y) U 1. Yet, Y 0 V ess (U,Y) Y 0 S o (U,Y) and as S o (U,Y) = S o (U 0,Y) U 1, we have finally Y 0 S o (U 0,Y). To summarize, Lemma 6 states that V ess (U,Y) = V ess (U 0,Y) U 1, θ(x s,x 1 Y 1 ) = n s, S o (U,Y) = S o (U 0,Y) U 1 = X s Y 0 U 1 and that θ(x 0 Y 0,X 1 Y 1 ) = 0. These equalities are important in the sequel of the paper. 4.2 Generic input and state observability Using the graph decomposition presented above, we give now the first result of the paper Proposition 6 Σ Λ is generically state and input observable iff, in its associated digraph G(Σ Λ ), there exists a v-disjoint subgraph S G which satisfies: Cond1. S G covers X U; Cond2. all vertices x i covered by cycles in S G are included in X 1 ; Cond3. S G contains a maximum U 0 -S o (U 0,Y) linking, with a length equal to µ(u 0,S o (U 0,Y)) card(s o (U 0,Y)). 4
6 Proof: We first prove the necessity of Cond1, next we decompose the system into two subsystems and we study separately each of them. Necessity of condition Cond1: Cond1 is equivalent to the existence of n + q v-disjoint edges and means that g_rank(p(0)) = n + q. Indeed, the number of v-disjoint edges in G(Σ Λ ) is equal to the maximum matching in the bipartite graph (Murota, 1987) associated to matrix P(0), which is equal to g_rank(p(0)). Therefore, Cond1 is a necessary condition to the generic input and state observability of Σ Λ. Moreover, Cond1 implies also that ρ(u,y) = q and so we can apply the results of Lemma 5. Decomposition of system Σ Λ : using Definition 4 and results of Lemma 5, there is no edge from X 0 U 0 to X 1 Y 1. So, we can write Σ Λ as: Ẋ 0 (t) = A 0,0 X 0(t) + A 0,s Xs(t) + A 0,1 X 1(t)+ +B0,0 U 0(t) + B0,1 U 1(t) Ẋ s(t) = A s,0 X 0(t) + A s,s Xs(t) + A s,1 X 1(t)+ +Bs,0 U 0(t) + Bs,1 U 1(t) Ẋ 1 (t) = A 1,s Xs(t) + A 1,1 X 1(t) + B1,1 U (5) 1(t) Y 0 (t) = C0,0 X 0(t) + C0,s X s(t) + C0,1 X 1(t)+ +D0,0 U 0(t) + D0,1 U 1(t) Y 1 (t) = C1,s Xs(t) + C 1,1 X 1(t) + D1,1 U 1(t) where X 0, X s, U 0, U 1, Y 0 and Y 1 represent the variables associated to vertex subsets X 0, X s, U 0, U 1, Y 0 and Y 1 respectively. Therefore, with some appropriate permutations on the rows and columns of P(s), we can transform P(s) into A 0,0 sin 0 A 0,s B0,0 A 0,1 B0,1 A s,0 A s,s si ns Bs,0 A s,1 B s,1 P(s) = C0,0 C0,s D0,0 C0,1 D0,1. 0 A 1,s 0 A 1,1 sin 1 B 1,1 0 C1,s 0 ( C1,1 ) D1,1 According to statement St3, g_rank A 1,s = θ(x s,x 1 C1,s Y 1 ) = n s. Matrix P(s), and so P(s), has generically full column rank s C, iff P e (s) has also generically full column rank s C, where: A 0,0 sin 0 A 0,s B0,0 A 0,1 B0,1 0 A s,0 A s,s sin s B s,0 A s,1 Bs,1 0 C0,0 C0,s D0,0 C0,1 D0,1 0 P e(s) = 0 I ns 0 A 1,1 sin 1 B 1,1 A 1,s 0 C1,1 D1,1 C 1,s Moreover, we have that ρ(u 0,Y) = card(u 0 ) = q 0 = card(s o (U 0,Y)) = p 0 + n s and so A 0,0 sin 0 A 0,s B0,0 P 1 (s) A = s,0 A s,s si ns B s,0 is a square ma- C0,0 C0,s D0,0 0 I ns 0 trix. Matrix P e (s) has generically full column rank s C iff P 1 (s) and P 2 (s) have both ( generically full column ) rank s C, where P 2 (s) A = 1,1 sin 1 B 1,1 A 1,s. C1,1 D1,1 C 1,s Necessity and Sufficiency of Cond2 and Cond3: for P 1 (s), we can apply Theorem 5.1 of (van der Woude, 2000) which states that the degree of the determinant of P 1 (s) is generically equal to n 0 +q 0 ( µ(u 0,S o (U 0,Y)) card(s o (U 0,Y)) ), with obviously S o (U 0,Y) = Y 0 X s. This determinant is non-zero s C iff its degree is equal to 0 and g_rank(p 1 (0)) = n 0 + q 0 + n s. Yet, according to θ(x 0 U 0,X 1 U 1 ) = 0, the existence of a v-disjoint subgraph which covers X 0 U 0, with the requirements enounced in Cond2 and Cond3, is necessary and sufficient to ensure that g_rank(p 1 (0)) = n 0 + q 0 + n s and µ(u 0,S o (U 0,Y)) = n 0 + q 0 + card(s o (U 0,Y)), and so, to ensure that P 1 (s) has generically full column rank i.e. g_rank(p 1 (s)) = n 0 + q 0 + n s, s C. Sufficiency of condition Cond1: From Theorem 5.2 of (van der Woude, 2000), adapted to the observation context, we have: If P 2 (s) has generically full column n-rank even after the deletion of an arbitrary row, then, generically, the greatest common divisor of all the (n 1 + q 1 + n s ) th order minors of P 2 (s) is a monomial in s with a degree equal to: n 1 +q 1 +n s minus the maximum number of edges in the disjoint union of a linking of size n s + q 1 from U 1 X s to Y, an Y-topped family and a cycle family in X 1. Cond1 implies that ρ(u 1 X s,y 1 ) = q 1 +n s and that the maximal number of edges in a disjoint union of a linking of size n s + q 1 from U 1 X s to Y, an Y-topped family and a cycle family in X 1 is equal to n 1 + n s + q 1. Thus, if the hypothesis that generically P 2 (s) has full column n- rank even after the deletion of an arbitrary row, is satisfied then, generically, the greatest common divisor of all the (n 1 + q 1 + n s ) th order minors of P 2 (s) is a monomial in s with a degree equal to zero and so P 2 (s) has generically full column rank. We will now show that the hypothesis that P 2 (s) generically has full column n-rank even after the deletion of an arbitrary row, is true. That is to say g_n-rank(p 2,i (s)) = n 1 +n s +q 1, i = 1,..., n 1 +q 1, where P 2,i (s), for i = 1,..., n 1 +q 1, corresponds to matrix P 2 (s) after the deletion of its i th row. The deletion of the i th row of ( ) A 1,1 sin 1 B 1,1 A 1,s in P 2 (s) is equivalent to the deletion of all the edges ending by x i1 in the digraph, where x i1 is the i th component of the state subvector X 1. Yet, ρ ( U {x i1 },Y ) > ρ(u,y) and so ρ (S o (U,Y) {x i1 },Y) > ρ(s o (U,Y),Y). Moreover, from Lemma 5, S o (U,Y) = U 1 X s Y 0. Knowing that Y 1 = Y \ Y 0, we have that ρ(u 1 X s {x i1 },Y 1 ) > ρ(u 1 X s,y 1 ) = q 1 +n s. Then, ρ(u 1 X s {x i1 },Y 1 ) = q 1 +n s +1. Applying results of (van der Woude, 2000), we have that for i < n 1, g_n-rank(p 2,i (s)) is equal to n 1 1 plus the maximal size of a U 1 X s {x i1 }-Y 1 linking. Thus, g_n-rank(p 2,i (s)) = n 1 + q 1 + n s for i n 1. ( ) The deletion of the i th row of C1,1 D1,1 C1,s in P 2 (s) is equivalent to the deletion of all edges ending by y i1 in the digraph, where y i1 is the i th component of out- 5
7 put subvector Y 1. Yet, ρ(u,y) = ρ (U,Y \ {y i1 }). Thus, ρ(s o (U,Y),Y) = ρ(u 1 X s Y 0,Y\{y i1 }). As Y 1 = Y \ Y 0, we have that ρ(u 1 X s,y 1 \ {y i1 }) = q 1 + n s. Applying results of (van der Woude, 2000), we have that g_n-rank(p 2,i (s)) for n 1 < i n 1 + p 1, is equal to n 1 plus the maximal size of a U 1 X s -Y 1 \ {y i1 } linking. So, for n 1 < i n 1 + p 1, g_n-rank(p 2,i (s)) = n 1 + q 1 + n s. To summarize, Cond1 of Proposition 6 ensures that: - the maximal number of edges in the disjoint union of a linking of size n s + q 1 from U 1 X s to Y, an Y-topped family and a cycle family in X 1 is equal to n 1 + n s + q 1 ; - P 2 (s) has generically full column n-rank, even after the deletion of an arbitrary row. Therefore, the greatest common divisor of all the (n 1 + q 1 + n s ) th order minors of P 2 (s) is generically a monomial in s with a degree equal to zero. As g_rank(p 2 (0)) = n 1 + n s + q 1, then P 2 (s) has generically full column rank s C. Thus, conditions of Proposition 6 are necessary and sufficient to ensure that s C, P e (s) has generically full column rank. Then, g_rank(p(s)) = n + q, s C. We can deduce from Proposition 6 other simpler graphic conditions: Corollary 7 Σ Λ is generically state and input observable iff Ca. in its associated digraph G(Σ Λ ), there exists a v- disjoint subgraph S G which covers X U; Cb. X 0 U 0 V ess (U 0,Y 0 X s ). Proof: First note that condition Ca is the same as Cond1 in Proposition 6. So, we have only to prove hereafter that condition Cb of Corollary 7 is equivalent to conditions Cond2 and Cond3 in Proposition 6. Necessity: If condition Cb is not satisfied then card(x 0 U 0 ) > µ(u 0,S o (U 0,Y)) ρ(u 0,S o (U 0,Y)). In this case, we cannot cover all the elements of X 0 U 0 with paths of total length µ(u 0,S o (U 0,Y)) card(s o (U 0,Y)). Thus, since no cycle can be used to cover X 0 U 0, there cannot exist a v-disjoint subgraph which covers X 0 U 0 and which satisfies Cond2 and Cond3. Sufficiency: Assume that Ca is satisfied. Condition Cb implies, on the one hand, that ρ(u 0,Y) = card(u 0 ) and on the other hand, that card(x 0 U 0 ) = µ(u 0,S o (U 0,Y)) ρ(u 0,S o (U 0,Y)). So, all the v-disjoint subgraphs which cover X 0 U 0 are constituted by a maximum U 0 X s Y 0 linking of a minimal length. Therefore, all v-disjoint subgraphs covering X U contain a maximum U 0 X s Y 0 linking of a minimal length, which covers X 0 U 0 and so cannot contain any cycles on X 0 X s. This is sufficient to ensure that conditions Cond2 and Cond3 are satisfied. Finally, note that conditions of Corollary 7 generalize explicitly the well-known state observability conditions for linear systems without unknown inputs. Indeed, if U =, Cb is equivalent to X 0 = and so, each state component is the begin vertex of an Y-topped path and Ca is equivalent to the existence of disjoint Y-topped paths and cycles, which cover X (Dion et al., 2003). 5 Conclusion In this paper, we propose a graph-theoretic tool to analyze the state and input generic observability for structured linear systems. Necessary and sufficient conditions for state and unknown input generic observability are given and expressed in graphic terms. These intrinsic conditions need few information about the system. Moreover, they are easy to check by means of well-known combinatorial techniques. Indeed, from a computational point of view, to check the first condition of Corollary 7, we use the Bipmatch method (Micali and Vazirani, 1980), which complexity order of algorithms is O(M N 0.5 ), where M = n 2 + nq + np + pq is the number of edges and N = n + q + p is the number of vertices in the digraph. Furthermore, condition Cb can be checked using depth search algorithms. These algorithms have a complexity order O(M N). Thus, the global complexity of our method is O(n 3 ). This is why our approach is particularly suited for large-scale systems. References Basile, G. & Marro, G. (1973). A new characterization of some structural properties of linear systems: unknown-input observability, invertibility and functional controllability. International Journal of Control, 17(5), Boukhobza, T., Hamelin, F. & Sauter, D. (2006). Observability of structured linear systems in descriptor form: a graph-theoretic approach. Automatica, 42(6), Chu, D. (2000). Disturbance decoupled observer design for linear timeinvariant systems: a matrix pencil approach. IEEE Transactions on Automatic Control, 45(8), Chu, D. & Mehrmann, V. (1999). Disturbance decoupled observer design for descriptor systems. System & Control Letters, 38(1), Dion, J-M., Commault, C., & Van der Woude, J. (2003). Generic properties and control of linear structured systems: A survey. Automatica, 39(7), Hou, M. & Müller, P. C. (1992). Design of observers for linear systems with unknown input. IEEE Transactions on Automatic Control, 37(4), Hou, M. & Müller, P. C. (1999). Causal observability of descriptor systems. IEEE Transactions on Automatic Control, 44(1), Hou, M. & Patton, R. J. (1998). Input observability and input reconstruction. Automatica, 34(6), Hou, M., Pugh, A. C. & Müller, P. C. (1999). Disturbance decoupled functionnal observer. IEEE Transactions on Automatic Control, 44, Koenig, D. (2005). Unknown input proportional multiple-integral observer design for linear descriptor systems: application to state and fault estimation. IEEE Transactions on Automatic Control, 50(2), Micali, S. & Vazirani, V. V.(1980). An O( V 1/2 E ) algorithm for finding maximum matching in general graphs. In Proceedings of the 21 st Annual Symposium on the Foundations of Computer Science, pages Murota, K. (1987). System Analysis by Graphs and Matroids. Springer- Verlag. New York, U.S.A. Reinschke, K. J. (1988). Multivariable Control. A Graph Theoretic Approach.. Springer-Verlag. New York, U.S.A. Trentelman, H. L., Stoorvogel, A. A. & Hautus, M. (2001). Control Theory for Linear Systems. Springer, London, U.K., Trinh, H. & Ha, Q. (2000). Design of linear functional observers for linear systems with unknown inputs. International Journal of Systems Science, 31(6), Tsui, C. C. (1996). A new design approach to unknown input observers. IEEE Transactions on Automatic Control, 41(3), van der Woude, J. W. (2000). The generic number of invariant zeros of a structured linear system. SIAM Journal of Control and Optimization, 38(1),
Observability of structured linear systems in descriptor form: a graph-theoretic approach
Observability of structured linear systems in descriptor form: a graph-theoretic approach Taha Boukhobza, Frédéric Hamelin, Dominique Sauter To cite this version: Taha Boukhobza, Frédéric Hamelin, Dominique
More informationZero controllability in discrete-time structured systems
1 Zero controllability in discrete-time structured systems Jacob van der Woude arxiv:173.8394v1 [math.oc] 24 Mar 217 Abstract In this paper we consider complex dynamical networks modeled by means of state
More informationOn the longest path in a recursively partitionable graph
On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:
More informationFull-order observers for linear systems with unknown inputs
Full-order observers for linear systems with unknown inputs Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu To cite this version: Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu. Full-order observers
More informationOn the fixed controllable subspace in linear structured systems
On the fixed controllable subspace in linear structured systems Christian Commault, Jacob Van Der Woude, Taha Boukhobza To cite this version: Christian Commault, Jacob Van Der Woude, Taha Boukhobza. On
More informationMultiple sensor fault detection in heat exchanger system
Multiple sensor fault detection in heat exchanger system Abdel Aïtouche, Didier Maquin, Frédéric Busson To cite this version: Abdel Aïtouche, Didier Maquin, Frédéric Busson. Multiple sensor fault detection
More informationb-chromatic number of cacti
b-chromatic number of cacti Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva To cite this version: Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva. b-chromatic number
More informationUnbiased minimum variance estimation for systems with unknown exogenous inputs
Unbiased minimum variance estimation for systems with unknown exogenous inputs Mohamed Darouach, Michel Zasadzinski To cite this version: Mohamed Darouach, Michel Zasadzinski. Unbiased minimum variance
More informationOn path partitions of the divisor graph
On path partitions of the divisor graph Paul Melotti, Eric Saias To cite this version: Paul Melotti, Eric Saias On path partitions of the divisor graph 018 HAL Id: hal-0184801 https://halarchives-ouvertesfr/hal-0184801
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 015 HAL Id: hal-0131860
More informationSolution to Sylvester equation associated to linear descriptor systems
Solution to Sylvester equation associated to linear descriptor systems Mohamed Darouach To cite this version: Mohamed Darouach. Solution to Sylvester equation associated to linear descriptor systems. Systems
More informationCutwidth and degeneracy of graphs
Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1
More informationThe Windy Postman Problem on Series-Parallel Graphs
The Windy Postman Problem on Series-Parallel Graphs Francisco Javier Zaragoza Martínez To cite this version: Francisco Javier Zaragoza Martínez. The Windy Postman Problem on Series-Parallel Graphs. Stefan
More informationNorm Inequalities of Positive Semi-Definite Matrices
Norm Inequalities of Positive Semi-Definite Matrices Antoine Mhanna To cite this version: Antoine Mhanna Norm Inequalities of Positive Semi-Definite Matrices 15 HAL Id: hal-11844 https://halinriafr/hal-11844v1
More informationAxiom of infinity and construction of N
Axiom of infinity and construction of N F Portal To cite this version: F Portal. Axiom of infinity and construction of N. 2015. HAL Id: hal-01162075 https://hal.archives-ouvertes.fr/hal-01162075 Submitted
More informationDifferential approximation results for the Steiner tree problem
Differential approximation results for the Steiner tree problem Marc Demange, Jérôme Monnot, Vangelis Paschos To cite this version: Marc Demange, Jérôme Monnot, Vangelis Paschos. Differential approximation
More informationDissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum
Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum Bernard Brogliato To cite this version: Bernard Brogliato. Dissipative Systems Analysis and Control, Theory and Applications:
More informationNotes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Fanny Dufossé, Bora Uçar To cite this version: Fanny Dufossé, Bora Uçar. Notes on Birkhoff-von Neumann decomposition of doubly
More informationA non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices
More informationOn size, radius and minimum degree
On size, radius and minimum degree Simon Mukwembi To cite this version: Simon Mukwembi. On size, radius and minimum degree. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no.
More informationOn infinite permutations
On infinite permutations Dmitri G. Fon-Der-Flaass, Anna E. Frid To cite this version: Dmitri G. Fon-Der-Flaass, Anna E. Frid. On infinite permutations. Stefan Felsner. 2005 European Conference on Combinatorics,
More informationOn the simultaneous stabilization of three or more plants
On the simultaneous stabilization of three or more plants Christophe Fonte, Michel Zasadzinski, Christine Bernier-Kazantsev, Mohamed Darouach To cite this version: Christophe Fonte, Michel Zasadzinski,
More informationHook lengths and shifted parts of partitions
Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690
More informationTropical Graph Signal Processing
Tropical Graph Signal Processing Vincent Gripon To cite this version: Vincent Gripon. Tropical Graph Signal Processing. 2017. HAL Id: hal-01527695 https://hal.archives-ouvertes.fr/hal-01527695v2
More informationWidely Linear Estimation with Complex Data
Widely Linear Estimation with Complex Data Bernard Picinbono, Pascal Chevalier To cite this version: Bernard Picinbono, Pascal Chevalier. Widely Linear Estimation with Complex Data. IEEE Transactions on
More informationA Simple Proof of P versus NP
A Simple Proof of P versus NP Frank Vega To cite this version: Frank Vega. A Simple Proof of P versus NP. 2016. HAL Id: hal-01281254 https://hal.archives-ouvertes.fr/hal-01281254 Submitted
More informationA note on the computation of the fraction of smallest denominator in between two irreducible fractions
A note on the computation of the fraction of smallest denominator in between two irreducible fractions Isabelle Sivignon To cite this version: Isabelle Sivignon. A note on the computation of the fraction
More informationFixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard To cite this version: Adrien Richard. Fixed point theorems for Boolean networks expressed in terms of
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 016 HAL Id: hal-0131860
More informationA Context free language associated with interval maps
A Context free language associated with interval maps M Archana, V Kannan To cite this version: M Archana, V Kannan. A Context free language associated with interval maps. Discrete Mathematics and Theoretical
More informationA new simple recursive algorithm for finding prime numbers using Rosser s theorem
A new simple recursive algorithm for finding prime numbers using Rosser s theorem Rédoane Daoudi To cite this version: Rédoane Daoudi. A new simple recursive algorithm for finding prime numbers using Rosser
More informationCompleteness of the Tree System for Propositional Classical Logic
Completeness of the Tree System for Propositional Classical Logic Shahid Rahman To cite this version: Shahid Rahman. Completeness of the Tree System for Propositional Classical Logic. Licence. France.
More informationConfluence Algebras and Acyclicity of the Koszul Complex
Confluence Algebras and Acyclicity of the Koszul Complex Cyrille Chenavier To cite this version: Cyrille Chenavier. Confluence Algebras and Acyclicity of the Koszul Complex. Algebras and Representation
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationDYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS
DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2
More informationAvalanche Polynomials of some Families of Graphs
Avalanche Polynomials of some Families of Graphs Dominique Rossin, Arnaud Dartois, Robert Cori To cite this version: Dominique Rossin, Arnaud Dartois, Robert Cori. Avalanche Polynomials of some Families
More informationMeasurement partitioning and observational. equivalence in state estimation
Measurement partitioning and observational 1 equivalence in state estimation Mohammadreza Doostmohammadian, Student Member, IEEE, and Usman A. Khan, Senior Member, IEEE arxiv:1412.5111v1 [cs.it] 16 Dec
More informationEaster bracelets for years
Easter bracelets for 5700000 years Denis Roegel To cite this version: Denis Roegel. Easter bracelets for 5700000 years. [Research Report] 2014. HAL Id: hal-01009457 https://hal.inria.fr/hal-01009457
More informationSymmetric Norm Inequalities And Positive Semi-Definite Block-Matrices
Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna Symmetric Norm Inequalities And Positive Semi-Definite lock-matrices 15
More informationA non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices
More informationapproximation results for the Traveling Salesman and related Problems
approximation results for the Traveling Salesman and related Problems Jérôme Monnot To cite this version: Jérôme Monnot. approximation results for the Traveling Salesman and related Problems. Information
More informationNew estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space
New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space Chérif Amrouche, Huy Hoang Nguyen To cite this version: Chérif Amrouche, Huy Hoang Nguyen. New estimates
More informationSelf-dual skew codes and factorization of skew polynomials
Self-dual skew codes and factorization of skew polynomials Delphine Boucher, Félix Ulmer To cite this version: Delphine Boucher, Félix Ulmer. Self-dual skew codes and factorization of skew polynomials.
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry To cite this version: Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks
More informationA note on the acyclic 3-choosability of some planar graphs
A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic
More informationSmart Bolometer: Toward Monolithic Bolometer with Smart Functions
Smart Bolometer: Toward Monolithic Bolometer with Smart Functions Matthieu Denoual, Gilles Allègre, Patrick Attia, Olivier De Sagazan To cite this version: Matthieu Denoual, Gilles Allègre, Patrick Attia,
More informationMethylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma.
Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma. Loïc De Pontual, Delphine Trochet, Franck Bourdeaut, Sophie Thomas, Heather Etchevers, Agnes Chompret, Véronique Minard,
More informationCase report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122,
Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122, 244902 Juan Olives, Zoubida Hammadi, Roger Morin, Laurent Lapena To cite this version: Juan Olives,
More informationA new approach of the concept of prime number
A new approach of the concept of prime number Jamel Ghannouchi To cite this version: Jamel Ghannouchi. A new approach of the concept of prime number. 4 pages. 24. HAL Id: hal-3943 https://hal.archives-ouvertes.fr/hal-3943
More informationA Slice Based 3-D Schur-Cohn Stability Criterion
A Slice Based 3-D Schur-Cohn Stability Criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A Slice Based 3-D Schur-Cohn Stability Criterion. ICASSP 007, Apr 007, Honolulu,
More informationLinear Quadratic Zero-Sum Two-Person Differential Games
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,
More informationExact Comparison of Quadratic Irrationals
Exact Comparison of Quadratic Irrationals Phuc Ngo To cite this version: Phuc Ngo. Exact Comparison of Quadratic Irrationals. [Research Report] LIGM. 20. HAL Id: hal-0069762 https://hal.archives-ouvertes.fr/hal-0069762
More informationA graph-theoretical characterization of power network vulnerabilities
A graph-theoretical characterization of power network vulnerabilities Fabio Pasqualetti, Antonio Bicchi, and Francesco Bullo Abstract This work is concerned with the security of a power network against
More informationSoundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan
Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan Shahid Rahman To cite this version: Shahid Rahman. Soundness of the System of Semantic Trees for Classical Logic
More informationThe core of voting games: a partition approach
The core of voting games: a partition approach Aymeric Lardon To cite this version: Aymeric Lardon. The core of voting games: a partition approach. International Game Theory Review, World Scientific Publishing,
More informationOn the structure at infinity of linear delay systems with application to the disturbance decoupling problem
On the structure at infinity of linear delay systems with application to the disturbance decoupling problem Rabah Rabah, Michel Malabre To cite this version: Rabah Rabah, Michel Malabre On the structure
More informationA proximal approach to the inversion of ill-conditioned matrices
A proximal approach to the inversion of ill-conditioned matrices Pierre Maréchal, Aude Rondepierre To cite this version: Pierre Maréchal, Aude Rondepierre. A proximal approach to the inversion of ill-conditioned
More informationSome Generalized Euclidean and 2-stage Euclidean number fields that are not norm-euclidean
Some Generalized Euclidean and 2-stage Euclidean number fields that are not norm-euclidean Jean-Paul Cerri To cite this version: Jean-Paul Cerri. Some Generalized Euclidean and 2-stage Euclidean number
More informationAnalysis of Boyer and Moore s MJRTY algorithm
Analysis of Boyer and Moore s MJRTY algorithm Laurent Alonso, Edward M. Reingold To cite this version: Laurent Alonso, Edward M. Reingold. Analysis of Boyer and Moore s MJRTY algorithm. Information Processing
More informationBERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES
BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES Antonin Pottier, Rabia Nessah To cite this version: Antonin Pottier, Rabia Nessah. BERGE VAISMAN AND NASH EQUILIBRIA: TRANS- FORMATION OF GAMES.
More informationStickelberger s congruences for absolute norms of relative discriminants
Stickelberger s congruences for absolute norms of relative discriminants Georges Gras To cite this version: Georges Gras. Stickelberger s congruences for absolute norms of relative discriminants. Journal
More informationSubmodular Partition Functions
Submodular Partition Functions Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé To cite this version: Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Submodular Partition Functions.
More informationNegative results on acyclic improper colorings
Negative results on acyclic improper colorings Pascal Ochem To cite this version: Pascal Ochem. Negative results on acyclic improper colorings. Stefan Felsner. 005 European Conference on Combinatorics,
More informationOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
On Newton-Raphson iteration for multiplicative inverses modulo prime powers Jean-Guillaume Dumas To cite this version: Jean-Guillaume Dumas. On Newton-Raphson iteration for multiplicative inverses modulo
More informationOn one class of permutation polynomials over finite fields of characteristic two *
On one class of permutation polynomials over finite fields of characteristic two * Leonid Bassalygo, Victor A. Zinoviev To cite this version: Leonid Bassalygo, Victor A. Zinoviev. On one class of permutation
More informationOn sl3 KZ equations and W3 null-vector equations
On sl3 KZ equations and W3 null-vector equations Sylvain Ribault To cite this version: Sylvain Ribault. On sl3 KZ equations and W3 null-vector equations. Conformal Field Theory, Integrable Models, and
More informationFinding cut-vertices in the square roots of a graph
Finding cut-vertices in the square roots of a graph Guillaume Ducoffe To cite this version: Guillaume Ducoffe. Finding cut-vertices in the square roots of a graph. [Research Report] Université Côte d Azur,
More informationFast Computation of Moore-Penrose Inverse Matrices
Fast Computation of Moore-Penrose Inverse Matrices Pierre Courrieu To cite this version: Pierre Courrieu. Fast Computation of Moore-Penrose Inverse Matrices. Neural Information Processing - Letters and
More informationEfficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based On Block Recombination Murat Cenk, Anwar Hasan, Christophe Negre To cite this version: Murat Cenk, Anwar Hasan, Christophe Negre.
More informationA remark on a theorem of A. E. Ingham.
A remark on a theorem of A. E. Ingham. K G Bhat, K Ramachandra To cite this version: K G Bhat, K Ramachandra. A remark on a theorem of A. E. Ingham.. Hardy-Ramanujan Journal, Hardy-Ramanujan Society, 2006,
More informationHardware Operator for Simultaneous Sine and Cosine Evaluation
Hardware Operator for Simultaneous Sine and Cosine Evaluation Arnaud Tisserand To cite this version: Arnaud Tisserand. Hardware Operator for Simultaneous Sine and Cosine Evaluation. ICASSP 6: International
More informationExogenous input estimation in Electronic Power Steering (EPS) systems
Exogenous input estimation in Electronic Power Steering (EPS) systems Valentina Ciarla, Carlos Canudas de Wit, Franck Quaine, Violaine Cahouet To cite this version: Valentina Ciarla, Carlos Canudas de
More informationOn the Griesmer bound for nonlinear codes
On the Griesmer bound for nonlinear codes Emanuele Bellini, Alessio Meneghetti To cite this version: Emanuele Bellini, Alessio Meneghetti. On the Griesmer bound for nonlinear codes. Pascale Charpin, Nicolas
More informationUnfolding the Skorohod reflection of a semimartingale
Unfolding the Skorohod reflection of a semimartingale Vilmos Prokaj To cite this version: Vilmos Prokaj. Unfolding the Skorohod reflection of a semimartingale. Statistics and Probability Letters, Elsevier,
More informationSparse multivariate factorization by mean of a few bivariate factorizations
Sparse multivariate factorization by mean of a few bivariate factorizations Bernard Parisse To cite this version: Bernard Parisse. Sparse multivariate factorization by mean of a few bivariate factorizations.
More informationCounting extremal lattices.
Counting extremal lattices. Bogdan Chornomaz To cite this version: Bogdan Chornomaz. Counting extremal lattices.. 2015. HAL Id: hal-01175633 https://hal.archives-ouvertes.fr/hal-01175633v2
More informationFlavia Bonomo, Guillermo Duran, Amedeo Napoli, Mario Valencia-Pabon. HAL Id: hal
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs Flavia Bonomo, Guillermo Duran, Amedeo
More informationVibro-acoustic simulation of a car window
Vibro-acoustic simulation of a car window Christophe Barras To cite this version: Christophe Barras. Vibro-acoustic simulation of a car window. Société Française d Acoustique. Acoustics 12, Apr 12, Nantes,
More informationOn additive decompositions of the set of primitive roots modulo p
On additive decompositions of the set of primitive roots modulo p Cécile Dartyge, András Sárközy To cite this version: Cécile Dartyge, András Sárközy. On additive decompositions of the set of primitive
More informationFactorisation of RSA-704 with CADO-NFS
Factorisation of RSA-704 with CADO-NFS Shi Bai, Emmanuel Thomé, Paul Zimmermann To cite this version: Shi Bai, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-704 with CADO-NFS. 2012. HAL Id: hal-00760322
More informationOn Poincare-Wirtinger inequalities in spaces of functions of bounded variation
On Poincare-Wirtinger inequalities in spaces of functions of bounded variation Maïtine Bergounioux To cite this version: Maïtine Bergounioux. On Poincare-Wirtinger inequalities in spaces of functions of
More informationThermodynamic form of the equation of motion for perfect fluids of grade n
Thermodynamic form of the equation of motion for perfect fluids of grade n Henri Gouin To cite this version: Henri Gouin. Thermodynamic form of the equation of motion for perfect fluids of grade n. Comptes
More informationSolving a quartic equation and certain equations with degree n
Solving a quartic equation and certain equations with degree n Abdeljalil Saghe To cite this version: Abdeljalil Saghe. Solving a quartic equation and certain equations with degree n. EUROPEAN JOURNAL
More informationThe FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle
The FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle Nathalie Olivi-Tran, Paul M Gauthier To cite this version:
More informationNumerical Exploration of the Compacted Associated Stirling Numbers
Numerical Exploration of the Compacted Associated Stirling Numbers Khaled Ben Letaïef To cite this version: Khaled Ben Letaïef. Numerical Exploration of the Compacted Associated Stirling Numbers. 2017.
More informationNote on winning positions on pushdown games with omega-regular winning conditions
Note on winning positions on pushdown games with omega-regular winning conditions Olivier Serre To cite this version: Olivier Serre. Note on winning positions on pushdown games with omega-regular winning
More informationExtended-Kalman-Filter-like observers for continuous time systems with discrete time measurements
Extended-Kalman-Filter-lie observers for continuous time systems with discrete time measurements Vincent Andrieu To cite this version: Vincent Andrieu. Extended-Kalman-Filter-lie observers for continuous
More informationCompletely Independent Spanning Trees in Some Regular Graphs
Completely Independent Spanning Trees in Some Regular Graphs Benoit Darties, Nicolas Gastineau, Olivier Togni To cite this version: Benoit Darties, Nicolas Gastineau, Olivier Togni. Completely Independent
More informationChebyshev polynomials, quadratic surds and a variation of Pascal s triangle
Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Roland Bacher To cite this version: Roland Bacher. Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle.
More informationThe Mahler measure of trinomials of height 1
The Mahler measure of trinomials of height 1 Valérie Flammang To cite this version: Valérie Flammang. The Mahler measure of trinomials of height 1. Journal of the Australian Mathematical Society 14 9 pp.1-4.
More informationGaia astrometric accuracy in the past
Gaia astrometric accuracy in the past François Mignard To cite this version: François Mignard. Gaia astrometric accuracy in the past. IMCCE. International Workshop NAROO-GAIA A new reduction of old observations
More informationk-tuple chromatic number of the cartesian product of graphs
k-tuple chromatic number of the cartesian product of graphs Flavia Bonomo, Ivo Koch, Pablo Torres, Mario Valencia-Pabon To cite this version: Flavia Bonomo, Ivo Koch, Pablo Torres, Mario Valencia-Pabon.
More informationOn a series of Ramanujan
On a series of Ramanujan Olivier Oloa To cite this version: Olivier Oloa. On a series of Ramanujan. Gems in Experimental Mathematics, pp.35-3,, . HAL Id: hal-55866 https://hal.archives-ouvertes.fr/hal-55866
More informationClimbing discrepancy search for flowshop and jobshop scheduling with time-lags
Climbing discrepancy search for flowshop and jobshop scheduling with time-lags Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari To cite this version: Wafa Karoui, Marie-José Huguet, Pierre
More informationAbout partial probabilistic information
About partial probabilistic information Alain Chateauneuf, Caroline Ventura To cite this version: Alain Chateauneuf, Caroline Ventura. About partial probabilistic information. Documents de travail du Centre
More informationCan we reduce health inequalities? An analysis of the English strategy ( )
Can we reduce health inequalities? An analysis of the English strategy (1997-2010) Johan P Mackenbach To cite this version: Johan P Mackenbach. Can we reduce health inequalities? An analysis of the English
More informationFinite geometries and diffractive orbits in isospectral billiards
Finite geometries and diffractive orbits in isospectral billiards Olivier Giraud To cite this version: Olivier Giraud. Finite geometries and diffractive orbits in isospectral billiards. Journal of Physics
More informationSome diophantine problems concerning equal sums of integers and their cubes
Some diophantine problems concerning equal sums of integers and their cubes Ajai Choudhry To cite this version: Ajai Choudhry. Some diophantine problems concerning equal sums of integers and their cubes.
More informationFORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM
FORMAL TREATMENT OF RADIATION FIELD FLUCTUATIONS IN VACUUM Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart To cite this version: Frederic Schuller, Renaud Savalle, Michael Neumann-Spallart.
More informationSome tight polynomial-exponential lower bounds for an exponential function
Some tight polynomial-exponential lower bounds for an exponential function Christophe Chesneau To cite this version: Christophe Chesneau. Some tight polynomial-exponential lower bounds for an exponential
More information