MAXIMAL INVARIANT SUBSPACES AND OBSERVABILITY OF MULTIDIMENSIONAL SYSTEMS. PART 2: THE ALGORITHM
|
|
- Linette Garrett
- 5 years ago
- Views:
Transcription
1 U.P.B. Sc. Bull., Seres A, Vol. 80, Iss. 1, 2018 ISSN MAXIMAL INVARIANT SUBSPACES AND OBSERVABILITY OF MULTIDIMENSIONAL SYSTEMS. PART 2: THE ALGORITHM Valeru Prepelţă 1, Tberu Vaslache 2 The paper s connected wth the Geometrc Approach, a trend whch enrched the feld of System Theory wth new notons and technques. An algorthm s proposed, whch determnes the maxmal nvarant subspace wth respect to a fnte number of commutng matrces and whch s ncluded n a gven subspace. The complete proof of the algorthm s provded. Ths algorthm can be used n the study of the observablty of multdmensonal (nd) lnear systems and to determne the subspace of the unobservable states. A Matlab program s proposed, whch mplements the algorthm and computes an orthonormal bass of the maxmal nvarant subspace. Keywords: Observablty, maxmal nvarant subspaces, multdmensonal systems, dscretetme systems. MSC2010: prmary 93B07, 93C35; secondary 93C05, 93B25, 93C Introducton The Geometrc Approach s a trend n System and Control Theory whch has provded smpler and elegant solutons for many mportant problems, such as controller synthess, decouplng, pole-assgnment, controllablty, observablty, mnmalty, dualty, etc. The hstory of the Geometrc Approach started wth the papers of Basle and Marro (see [3]) and was developed by Wonham and Morse [10], Slverman, Hautus, Wllems et al. The cornerstone of ths approach s the concept of nvarance of a subspace wth respect to one lnear transformaton. In the past four decades a lot of publshed paper and books have been desgned to the theory of multdmensonal (nd) systems, whch has become a dstnct and mportant branch of the systems theory. The reasons for the ncreasng nterest n ths doman are on one sde the mportant applcaton felds (sgnal processng, mage processng, computer tomography, gravty and magnetc feld mappng, sesmology etc.) and on the other sde the rchness and sgnfcance of the theoretcal approaches, some of them beng dstnct from those concernng the theory of 1D systems. 1 Department of Mathematcs and Informatcs, Faculty of Appled Scences, Unversty Poltehnca of Bucharest, Romana, E-mal: valeru.prepelta@upb.ro 2 Department of Mathematcs and Informatcs, Faculty of Appled Scences, Unversty Poltehnca of Bucharest, Romana, E-mal: tberu.vaslache@gmal.com 13
2 14 Valeru Prepelţă, Tberu Vaslache Varous state space 2D dscrete-tme models have been proposed n lterature by Roesser [9], Fornasn-Marchesn [4], Attas [1] etc. Ths paper extends the Geometrc Approach technques to present an algorthm for determnng the maxmal subspace whch s nvarant wth respect to a fnte number of commutatve matrces and s ncluded n a gven subspace. It completes [8] by provdng the proof of ths algorthm and also by determnng recurrently the maxmal nvarant subspaces w.r.t. the frst one, two etc. matrces. When the matrces represent the drfts of a multdmensonal lnear system and the subspace s the kernel of the output matrx, ths algorthm can be adapted to determne the subspace of unobservable states, wth applcatons n the study of the propertes connected wth the concept of observablty [6]. The dual algorthm whch determnes the mnmal nvarant subspace that ncludes a gven subspace (e.g. the mage of the nput matrx) s descrbed n [7]. Secton 2 gves the descrpton of the maxmal nvarant subspace wth respect to r 2 commutng matrces whch s ncluded n a gven subspace. An algorthm whch calculates ths maxmal subspace s proposed and ts proof s developed. Ths algorthm s a generalzaton of the 1D method of G. Marro (see [5]). It was appled (wthout proof) n [8] to determne the subspace of unobservable states of a multdmensonal (rd) system. Secton 3 provdes a Matlab program that mplements Algorthm 2.1 presented n Secton 2 whch computes an orthonormal bass of the maxmal nvarant subspace. An example llustrates the advantages of the proposed method. In Secton 4 t s shown how Algorthm 2.1 can be appled to problems concernng the concept of observablty of a class of multdmensonal dscrete-tme systems. matrces. 2. Algorthm of maxmal nvarant subspaces Let K be a feld, C a proper subspace of K n and A 1,..., A r K n n commutng Defnton 2.1. A subspace V of K n s sad to be (A 1,..., A r )-nvarant f A v V, v V, {1, 2,..., r}. A subspace V of K n s sad to be (A 1,..., A r ; C)-nvarant f V s (A 1,..., A r )- nvarant and t s ncluded n C. (A 1,..., A r )-nvarant and ncluded n C, Ṽ V. V s called maxmal f, for any subspace Ṽ whch s Let us denote by maxi(a 1,..., A r ; C) the maxmal (A 1,..., A r )-nvarant subspace ncluded n C. V}, A k where ( r For a subspace V of K n, we consder the followng subspaces: A 1 = {v K n A k v V} and ( r =1 A 0 )V = V. If v A =1 A k )V = {v K n ( r =1 Ak = {v K n A v )v V}, k N, V, then A v A () V, {1, 2,..., r}, 1.
3 Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems. Part 2: the Algorthm 15 Proposton 2.1. The maxmal (A 1,..., A r )-nvarant subspace ncluded n C s maxi(a 1,..., A r ; C) = ( A k )C. (1) k r=0 =1 Proof. Let us denote by V 1 the subspace from the rght-hand member of (1). If v V 1 then partcularly v ( r =1 A k )A (k +1) C, hence A v ( r =1 A k )C, k N, {1, 2,..., r}. It follows that A v V 1, {1, 2,..., r}.e. V 1 s (A 1,..., A r )-nvarant. We can wrte by (1) V 1 = C k r =0 ( r =1 A k )C where (k 1,..., k r ) (0,..., 0), hence V 1 s ncluded n C. Now, let V be any (A 1,..., A r )-nvarant subspace ncluded n C. Then, for any v V, ( r =1 Ak )v V C, hence v ( r =1 A k )C, k 0, {1, 2,..., r}, whch mples v V 1. Therefore V V 1,.e. V 1 s the maxmal such subspace. Proposton 2.2. The maxmal (A 1,..., A r )-nvarant subspace ncluded n C s maxi(a 1,..., A r ; C) = n 1 n 1 ( k r =0 =1 A k )C. (2) Proof. Let us denote by V 2 the subspace from the rght-hand member of (2). Obvously, by Proposton 2.1, V 1 V 2, where V 1 = maxi(a 1,..., A r ; C). Now, for any v V 2, ( r =1 Ak )v C, k N, 0 k n 1, {1, 2,..., r}. Let p (s) = det(si A ) = s n +a n 1, s n 1 ++a 1, s+a 0, be the characterstc polynomal of the matrx A, {1, 2,..., r}. By Hamlton-Cayley Theorem, p (A ) = 0 n, hence A n = a n 1, A n 1 a 1, A a 0, I n. (3) n 1 Then, for any vector v V 2, A n v = a l, A l v. Snce A are commutatve matrces, we can premultply ths equalty by ( r =1 A k ) and we obtan ( r hence ( r =1 A k )An v C snce ( r =1 l=0 A k )Al Smlarly, by postmultplyng (3) by ( r =1 v C and fnally that ( r that ( r =1 A k )An+t =1 Ak follows that V 2 V 1, hence V 2 = V 1 = maxi(a 1,..., A r ; C). =1 A k n 1 )An v = a l, ( l=0 =1 v C for 0 l n 1 and C s a subspace. A k )At v, t = 1, 2,..., one obtans recurrently )v C, k 0, hence v V 1. It A k )Al v, Algorthm 2.1. Stage 1. Determne the sequence of subspaces (S 1,0,...,0,0) 0 1 n of the space X = K n : S 0,0,...,0,0 = C; (4) S 1,0,...,0,0 = C A 1 1 S 1 1,0,...,0,0, 1 = 1,..., n; (5)
4 16 Valeru Prepelţă, Tberu Vaslache Stage 2. Determne 0 1, the frst ndex n {0, 1,..., n 1} whch verfes S ,0,...,0,0 = S 0 1,0,...,0,0. (6) % S 0 1,0,...,0,0 s the maxmal A 1 -nvarant subspace whch s ncluded n C. If 0 1 = n 1, then maxi(a 1,..., A r ; C) = {0} K n. STOP If 0 1 < n 1, put := 2 and GO TO Stage 3. Stage 3. Determne by (7) the sequence of subspaces (S 0 1, 0 2,...,0,,0,...,0) 0 n of the space X = K n : for = 1, 2,..., n, % S 0 1, 0 2,...,0,0,0,...,0 s the maxmal (A 1,..., A )-nvarant subspace whch s ncluded n C S 0 1, 0 2,...,0,,0,...,0 = S 0 1, 0 2,...,0,,0,...,0 A 1 S 0 1, 0 2,...,0,,0,...,0. (7) Stage 4. Determne 0, the frst ndex n {0, 1,..., n 1} whch verfes S 0 1, 0 2,...,0,0 +1,0,...,0 = S 0 1, 0 2,...,0,0,0,...,0. (8) If 0 = n 1 then maxi(a 1,..., A r ; C) = {0} K n. STOP If 0 < n 1 then GO TO Stage 5. Stage 5. If < r then put := + 1 and GO TO Stage 3. If = r, then maxi(a 1,..., A r ; C) = S 0 1, 0 2,...,0,0,...,0 r. STOP Proof. We consder the rd chan of subspaces S 1, 2,..., r = 1 2 k 2=0 r k r=0 1 A k2 2 A k r r C, (9) {0, 1,..., n}, {0, 1,..., r}. Obvously, for l, {0, 1,..., r}, S 1, 2,..., r S l1,l 2,...,l r. (10) By (9) and Proposton 2.1 we obtan S 1, 2,..., r maxi(a 1,..., A r ; C), 0, {1, 2,..., r} and t follows from Proposton 2.2 that S n 1,n 1,...,n 1 = maxi(a 1,..., A r ; C). From (4) and (9) one obtans S 0,0,...,0,0 = A 0 1 A 0 2 A 0 r C = C = S 0,0,...,0,0. Let us assume that S 1 1,0,...,0,0 = S 1 1,0,...,0,0 for some 1 {1, 2,..., n}. Applyng (9), (5) and the change of the ndex k 1 1 = k, we get S 1,0,...,0,0 = 1 A k 1 1 C = A 0 1 C A k 1 =1 A (k 1 1) 1 C = C A k=0 A k 1 C = C A 1 1 S 1 1,0,...,0,0 = S 1,0,...,0,0, hence we obtaned by nducton and by (10) the followng relatons: S 1,0,...,0 = S 1,0,...,0, 1 {1, 2,..., n}, (11) S 1,0,...,0 S 1+1,0,...,0, 1 {0, 1,..., n 1}. (12) Usng Hamlton-Cayley Theorem as n the proof of Proposton 2.2, one obtans S n,0,...,0 = S n 1,0,...,0, hence by (11), S n,0,...,0 = S n 1,0,...,0,.e. 0 from (6) verfes 1
5 Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems. Part 2: the Algorthm 17 0 n 1. Let us consder the chan of subspaces K n S 0,0,...,0,0 S 1,0,...,0,0... S 1,0,...,0,0... S n 1,0,...,0,0 = S n,0,...,0,0. Snce S 0,0,...,0,0 = C s a proper subspace of K n, dm S 0,0,...,0,0 n 1. If 0 = n 1 s the frst ndex whch verfes (6), t follows that n 1 dm S 0,0,...,0,0 > dm S 1,0,...,0,0 >... > dm S n 1,0,...,0,0 0, hence dm S n 1,0,...,0,0 = 0 and we have {0} = S n 1,0,...,0,0 = S n 1,0,...,0,0 maxi(a 1,..., A r ; C) {0}. Therefore maxi(a 1,..., A r ; C) = {0}, whch proves the nstructon n Stage 2. If 0 1 < n 1, one obtans by (5) and (6) S ,0,...,0,0 = C A 1 1 S ,0,...,0,0 = C A 1 1 S 0 1,0,...,0,0 = S ,0,...,0,0 = S 0 1,0,...,0,0. Let us assume that S 1,0,...,0,0 = S 0 1,0,...,0,0 for some 1 { ,..., n}. Then, applyng agan (5) and (6), we get S 1 +1,0,...,0,0 = C A 1 1 S 1,0,...,0,0 = C A 1 1 S 0 1,0,...,0,0 = S ,0,...,0,0 = S 0 1,0,...,0,0, hence we proved by nducton that S 1,0,...,0,0 = S 0 1,0,...,0,0, 1 { ,..., n}. Now, let us assume that S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,,0,...,0 for some {2,..., r} and {1,..., n}. k=0 ( Consder some subspaces V k K n, k = 0, 1,...,, N. We have 1 V k = V 0 ( k=1 1 V k ) V = [V 0 ( k=1 1 V k )] [( Therefore, by replacng V k by A k C, we have k =0 k =0 Usng ths equalty and (6), we get k =0 S 0 1,..., 0,,0...,0 = 1 A k k=1 1 C = ( C) ( k = k =0 A k C) ( 1 V k ) V ] = ( k =1 C). 1 A k k =0 k =0 k=0 V k ) ( C = 1 A k k =1 V k ). k=1 A k C), whch becomes by the backward movement of A 1 and the change of the ndex k 1 = k n the last term 0 1 ( 0 k =0 1 A k 1 k =0 0 1 C) A 1 ( 0 k =0 1 A k A (k) k =1 C) =
6 18 Valeru Prepelţă, Tberu Vaslache 0 1 =( 0 k =0 1 A k 1 k =0 0 1 C) A 1 ( 0 k =0 whch s equal by (9), by the nducton assumpton and by (7) to 1 A k S 0 1,..., 0,,0...,0 A 1 S 1v,..., 0,,0...,0 = = S 0 1,..., 0,,0...,0 A 1 S 0 1,...,, 0,0...,0 = S 0 1,..., 0,,0...,0, hence we proved by nducton that therefore {1,..., n} 1 k=0 A k C), S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,,0,...,0, {1,..., r}, {1,..., n}, (13) S 0 1,..., 0,...,0 r = S 0 1,...,0,...,0 r. (14) By (9),(13) and (12),we obtan, for 0 1,..., 0 determned n Stage 4 and S 0 1,..., 0,,0,...,0 = k =0 k =0 1 A k A k C (15) and S 0 1,..., 0,,0,...,0 S 0 1,..., 0,+1,0,...,0. By (15) and by applyng Hamlton-Cayley Theorem to the matrx A, one obtans S 0 1,..., 0,n,0,...,0 = S 0 1,..., 0,n 1,0,...,0. Let us consder the chan of subspaces K n S 0,0,...,0,0 S 0 1,..., 0,0,0,...,0... S 0 1,..., 0,1,0,...,0... S 0 1,..., 0,n 1,0,...,0 = S 0 1,..., 0,n,0,...,0. that If 0 = n 1 s the frst ndex whch verfes (8), snce dm S 0,0,...,0,0 n 1, t follows n 1 dm S 0 1,..., 0,0,0,...,0 > dm S 0 1,..., 0,1,0,...,0 >... > dm S 0 1,..., 0,n 1,0,...,0 0, whch mples dm S 0 1,..., 0,n 1,0,...,0 = 0, hence S 0 1,..., 0,n 1,0,...,0 = {0}. By Proposton 2.2 and (15), maxi(a 1,...,A r ;C) S 0 1,..., 0,n 1,0,...,0, hence maxi(a 1,...,A r ;C)= {0}, whch proves the nstructon from Stage 4. Consder the case 0 < n 1 (condton whch ncludes 0 k < n 1, k {1,..., 1}). We have by (8) S 0 1,..., 0,0 +1,0,...,0 = S 0 1,..., 0,0,0,...,0. Let us assume that S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,0,0,...,0 for some 0. Then S 0 1,..., 0,+1,0,...,0 = S 0 1,..., 0,,0,...,0 A 1 S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,0,0,...,0 A 1 S 0 1,..., 0,0,0,...,0 = S 0 1,..., 0,0 +1,0,...,0 = S 0 1,..., 0,0,0,...,0. We proved by nducton S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,0,0,...,0, { 0 + 1,..., n 1}. (16)
7 Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems. Part 2: the Algorthm 19 By (13) and (16) we obtan S 0 1,..., 0,,0,...,0 = S 0 1,..., 0,0,0,...,0, { 0 + 1,..., n 1}. (17) For = 1 we proved that f 0 1 < n 1, then S 1,0,...,0 = S 0 1,0,...,0, 1 { ,..., n 1}. Usng (11), we get S 1,0,...,0 = S 0 1,0,...,0, 1 { ,..., n}. Let us now assume that S 1,...,,0,0,...,0 = S 0 1,..., 0,0,0,...,0, k { 0 k + 1,..., n 1}, k {1, 2,..., 1},.e. (see (9)) Then k =0 A k 1 1 k =0 k =0 1 A k C = 1 A k C= 0 1 k =0 A k and usng the commutatvty of the matrces A we have 1.e. agan by (9) k =0 k =0 1 A k C= k = A k C. k =0 k =0 S 1,...,,,0,...,0 = S 0 1,..., 0,,0,...,0, and usng (17) we obtan by nducton, for any {1, 2,..., r} 0 k =0 1 A k C 1 A k C S 1,...,,,0,...,0 = S 0 1,..., 0,0,0,...,0, k { 0 k + 1,..., n 1}, k {1, 2,..., }, (18) partcularly S 1,...,,..., r = S 0 1,..., 0,,...,0 r, k { 0 k + 1,..., n 1}, k {1, 2,..., r}. (19) It follows by Proposton 2.2 and (14) that maxi(a 1,..., A r ; C) = S n 1,...,n 1,...,n 1 = S 0 1,..., 0,,...,0 r, (20) whch proves the fnal statement from Stage 5. By (9) and (20) we obtan Proposton 2.3. The maxmal (A 1,..., A r )-nvarant subspace ncluded n C s maxi(a 1,..., A r ; C) = r k r =0 where 0 1,..., 0 r are the numbers determned n stages 2 and 4. 1 A k r r C,
8 20 Valeru Prepelţă, Tberu Vaslache 3. Matlab program The Matlab program presented below and based upon the algorthm above calculates the dmenson and an orthonormal bass of the maxmal nvarant subspace. The nstructons make use of the m-functons nts, nvt and ma ncluded n the Geometrc Approach toolbox publshed by G. Marro and G. Basle at ths GA toolbox works wth Matlab and Control System Toolbox. More precsely, gven the matrces A 1, A 2... A r that commute and the matrx C, the next commands wll compute and dsplay the dmenson of a bass and an orthonormal one n the subspace S = maxi(a 1, A 2,... A r ; C), where C = ImC. The matrces are loaded from the m-fle GetAC.m, where A 1, A 2... A r are stored n an 1 r dmensonal cell array A as A{1},...A{r}. % begn m-fle % nts(x,y)=an orthonormal bass for Im(X) ntersected wth ImYB) % nvt(x,y)=an orthonormal bass for the nverse mage of Y through X % ma(z) = an othhonormal bass n the subspace generated by Z Get_A_C; % A s a 1 x n cell array, contanng A{1},... A{r} [ ~, r] = sze(a); S = ma(c); [n, dmmax] = sze(s); % wll be the dmenson of the maxmal nvarant subspace ndex = zeros(1, r); % the ndex of the calculated subspace for = 1:r % loop for ndex poston for = 1:n-1 % loop for ndex value S = nts(s, nvt(a{},s)); [~, m1] = sze(s); ndex() = ; f (m1 == dmmax) break; else dmmax = m1; end end f ((dmmax == 1) && (norm(s, 2) == 0)) dmmax = 0; break; end end dsp([ The dmenson of the maxmal nvarant subspace s ]) dsp([ num2str(dmmax)]) dsp( and an orthonormal bass of ths subspace s: ) dsp(s) % end m-fle
9 Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems. Part 2: the Algorthm 21 For example, gven the commutng matrces A 1 = , A 2 = A 3 = and C = , the m-fle GetAC could be A = cell(1, 3); A{1} = [1,2,1,3;-2,-2,2,-2;1,2,1,1;2,0,-2,0]; A{2} = [1,2,-1,5;-6,-4,6,-6;-1,2,1,-1;6,0,-6,2]; A{3} = [1,3,3,2;2,-2,-2,0;3,3,1,4;-2,0,2,-2]; C = [ ;0 1 0 ;0 0 1 ; ]; and the above Matlab program wll gve the answers: The dmenson of the maxmal nvarant subspace s 2 and an orthonormal bass of ths subspace s: , 4. Applcaton to the observablty of a class of dscrete-tme rd systems In ths secton we wll show how Algorthm 2.1 can be appled to problems concernng the concept of observablty of a class of multdmensonal systems. We shall use the followng notatons: r := {1, 2,..., r} where r N. A functon x(t 1,..., t r ) s denoted by x(t), where t = (t 1,..., t r ), and varables. t Z + are the dscrete-tme For a subset δ = { 1,..., l } of r, we consder the notatons δ := l, δ := r \ δ and := 0; for r, ĩ := r{}. The notaton δ r means that δ s or δ s a subset of r and δ r. For δ = { 1,..., l }, the shft operator σ δ s defned by σ δ x(t) = x(t + e δ ) where e δ = e e l, e = (0,..., 0, 1, 0,..., 0) Z }{{} r ; when δ = r we denote σ δ = σ, hence σx(t 1, t 2,..., t r ) = x(t 1 + 1, t 2 + 1,..., t r + 1). Defnton 4.1. An rd dscrete-tme lnear system s an ensemble Σ = (A 1,..., A r ; B; C; D) where A, r are commutng n n matrces over a feld K and B, C, D are respectvely
10 22 Valeru Prepelţă, Tberu Vaslache n m, p n and p m matrces over K. The K-spaces X = K n, U = K m, Y = K p are called respectvely the state space, nput space and output space and the tme set s T = N r. The followng equatons are called respectvely the state equaton and the output equaton: σx(t) = δ r ( 1) r δ 1 A σ δ x(t) + Bu(t), (21) δ y(t) = Cx(t) + Du(t), (22) where x(t) = x(t 1,..., t r ) X s the state, u(t) U s the nput and y(t) Y s the output of the system Σ at the moment t T. For any set δ = { 1,..., l } r and for t Z +, δ, we use the notaton x(t δ, 0 δ) := x(0,..., 0, t 1, 0,..., 0, t l, 0,..., 0). Defnton 4.2. The vector x 0 K n s called an ntal state of the system Σ f ( ) x(t δ, t 0 δ) = A x 0 (23) for any δ r; equaltes (23) are called ntal condtons of Σ. δ By [8, Proposton 2.2], we have Theorem 4.1. The output of the system Σ at the moment t, determned by the ntal state x 0 and the output u : T U s (wth l = (l 1,..., l r )): t 1 1 t r 1 y(t) = C x C =1 A t l 1 =0 l r =0 =1 A t l 1 Bu(l) + Du(t). (24) Defnton 4.3. A state x K n s sad to be unobservable f, for any nput u(t), the ntal states x 0 = x and x 0 = 0 produce the same output y(t), t T. Proposton 4.1. The state x K n s unobservable f and only f C =1 A t x = 0, t N, r. (25) Proof. We denote by y x (t) and y 0 (t) the outputs produced by the ntal state x 0 = x and x 0 = 0 respectvely, for an arbtrary nput u(t). We obtan by (24) from y x (t) = y 0 (t) that the state x s unobservable f and only f y x (t) y 0 (t) = 0 t T whch s equvalent to (25).
11 Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems. Part 2: the Algorthm 23 In the sequel we wll consder the system Σ reduced to the ensemble Σ = (A 1,..., A r ; C) whch s nvolved n formulas concernng observablty. Usng Hamlton-Cayley Theorem as n the proof of Proposton 2.2, we deduce from (25) the followng result. Proposton 4.2. The state x K n s unobservable f and only f C =1 A t x = 0, t N, t n 1, r. (26) Let us denote by X uo the set of the unobservable states of Σ and by C the subspace C = KerC. The next theorem gves the geometrc characterzaton of the set of unobservable states of Σ. Theorem 4.2. X uo s the maxmal (A 1,..., A r ; C)-nvarant subspace of K n. Proof. Let x be an unobservable state of Σ. Obvously, one obtans from (25), for t = 0, r, that Cx = 0, hence X uo KerC. For arbtrary r and t N, r one obtans from (25): 0=C( A t )At +1 x= C( =1 A t )A x, hence A x X uo, r,.e. X uo s (A 1,..., A r ; C)-nvarant. Now, consder an arbtrary (A 1,..., A r ; C)-nvarant subspace V of K n and let v be an element of V. Snce V s (A 1,..., A r )-nvarant and t s ncluded n KerC one obtans ( A t )v V and C( A t )v = 0, t 0, r. By (25), v X uo, hence V X uo,.e. =1 =1 X uo s the maxmal such space. =1 Defnton 4.4. The system Σ s sad to be completely observable f there s no unobservable state x 0. Therefore, the system Σ s completely observable f and only f X uo = {0}. From Theorem 4.2 we obtan Theorem 4.3. The system Σ s completely observable f and only f {0} s the maxmal (A 1,..., A r ; C)-nvarant subspace of K n. By Theorem 4.2 we can use Algorthm 2.1 to determne the subspace X uo of the unobservable states of a multdmensonal system Σ. If one gets n Stage 2 the value 0 1 = n 1 or n Stage 4 0 = n 1, t follows that X uo = {0}, hence, by Theorem 4.3, Algorthm 2.1 can be used to check f the system Σ s completely observable.
12 24 Valeru Prepelţă, Tberu Vaslache To ths am we modfy Algorthm 2.1 by replacng C by KerC n Stage 1 (see (4) and (5)) and n Stages 2 and 4. We also replace maxi(a 1,..., A r ; C) by X uo n Stages 2,4 and 5. We wrte The system s completely observable n Stages 2 and 4 and The system s not completely observable n Stage Conclusons An algorthm s proposed and ts proof s gven, n the lnes of the Geometrc Approach. Ths algorthm determnes the maxmal nvarant subspace wth respect to a fnte number of commutng matrces and whch s ncluded n a gven subspace. Ths algorthm can be used n the study of the observablty of multdmensonal (nd) lnear systems, especally to fnd the canoncal form of the unobservable systems and (combned wth the dual algorthm for the controllable subspace), the Kalman canoncal decomposton of a multdmensonal system. R E F E R E N C E S [1] S. Attas, Introducton d une classe de systèmes lnéares reccurents à deux ndces, Comptes Rendus Acad. Sc. Pars sére A, 277 (1973), [2] G. Basle, G. Marro, Controlled and condtoned nvarant subspaces n lnear system theory, J. Optmz. Th. Applc., 3 (1969), No. 5, [3] G. Basle and G. Marro, Controlled and Condtoned Invarants n Lnear System Theory, Upper Saddle Rver, NJy: Prentce-Hall, [4] E. Fornasn, G. Marchesn, State space realzaton theory of two-dmensonal flters, IEEE Trans. Aut. Control, AC-21 (1976), [5] G. Marro, Teora de sstem e del controlo, Zanchell, Bologna, 1989 [6] V. Prepelţă, Observablty of a model of (q,r)-d contnuous-dscrete systems, Proceedngs of the 4th Internatonal Conference on Dynamcal Systems and Control (CONTROL 08), Corfu Island, Greece, October 26-28, (2008), [7] V. Prepelţă, T. Vaslache, Mona Dorofte, Geometrc approach to a class of multdmensonal hybrd systems, Balkan Journal of Geometry and Its Applcatons, 17 (2012), No. 2, [8] V. Prepelţă, T. Vaslache, Maxmal Invarant Subspaces and Observablty of Multdmensonal Systems, U.P.B. Sc. Bull., Seres A, 77 (2015), No. 2, [9] R. P. Roesser, A dscrete state-space model for lnear mage processng, IEEE Trans. Aut. Control, AC-20 (1975), [10] W. M. Wonham, A. S. Morse, Decouplng and pole assgnment n lnear multvarable systems: A geometrc approach, SIAM J. Control, 8 (1970), 1-18.
2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationZeros and Zero Dynamics for Linear, Time-delay System
UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationMEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x
MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationAn explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment
Journal of Control Theory Applcatons () 147 14 An explct soluton to polynomal matrx rght coprme factorzaton wth applcaton n egenstructure assgnment Bn ZHOU Guangren DUAN ( Center for Control Theory Gudance
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationPHYS 705: Classical Mechanics. Canonical Transformation II
1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationh-analogue of Fibonacci Numbers
h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for
More informationarxiv: v1 [quant-ph] 6 Sep 2007
An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationElementary work, Newton law and Euler-Lagrange equations
Elementary work, Newton law and Euler-Lagrange equatons Constantn Udrşte, Oltn Dogaru, Ionel Ţevy, Dumtru Bala Abstract. The am of ths paper s to show a geometrcal connecton between elementary mechancal
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationON THE JACOBIAN CONJECTURE
v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationDECOUPLING OF LINEAR TIME-VARYING SYSTEMS WITH A BOND GRAPH APPROACH
DECOUPLING OF LINEAR IME-VARYING SYSEMS WIH A BOND GRAPH APPROACH Stefan Lchardopol Chrstophe Sueur L.A.G.I.S., UMR 846 CNRS Ecole Centrale de Llle, Cté Scentfque, BP48 5965 Vlleneuve d'ascq Cedex, France
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationGeometric drawings of K n with few crossings
Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More information