Application of Generalized Polynomials to the Decoupling of Linear Multivariable Systems
|
|
- Alannah Harris
- 5 years ago
- Views:
Transcription
1 Applcaton of Generalzed Polynomals to the Decouplng of Lnear Multvarable Systems,,3 J. Ruz-León and D. Henron. CINVESTAV-IPN, Undad Guadalajara P.O. Box 3-438, Plaza la Luna, 4455 Guadalajara, Jalsco, Mexco. E-mal: LAAS-CNRS 7 Avenue du Colonel Roche 377 Toulouse, France E-mal: henron@laas.fr 3. Insttute of Informaton Theory and Automaton Academy of Scences of the Czech Republc Prague, Czech Republc. Abstract. In ths paper, propertes of generalzed polynomals and generalzed polynomal matrces are appled to the problem of decouplng wth -stablty of lnear square multvarable systems,.e. decouplng of lnear systems wth closedloop poles n a regon of the complex plane. We present frst some extensons of well-known results about generalzed polynomals, whch are bascally defned as ratonal functons wth poles n a symmetrc regon of the extended complex plane. Then, an applcaton of the concepts to the problem of decouplng wth -stablty of lnear square multvarable systems s presented. The condtons for ths problem to have a soluton are stated n terms of the row and global zero structureofthesystemoutoftheregon. Keywords : Generalzed Polynomals, Canoncal Forms, Lnear Systems, Decouplng, Stablty. Introducton Algebrac concepts are fundamental n practcally any branch of engneerng, and control theory s by no means the excepton. The analyss and desgn of dynamc control systems reles to a deep extent on the notons and propertes from algebrac objects. For nstance, polynomals, proper ratonal functons, proper and stable ratonal functons, matrces wth elements from these sets, and canoncal forms related to these matrces are a key tool n system descrpton, analyss and desgn. These ratonal functons can be regarded as partcular cases of what s known as generalzed polynomals. There exst many contrbutons n the lterature about generalzed polynomals and ts applcatons to control theory. The concept of ratonal functons wth poles n a prescrbed regon of the complex plane was orgnally studed n [], where t was shown that ths set s a prncpal deal doman. In [] t s shown that the set IR S of all transfer functons wth denomnators n a prescrbed set S s a prncpal deal doman, and system nvarants under feedback and cascade control are characterzed by the free IR S-module generated by the columns of the system transfer functon. Generalzed polynomals are ntroduced n [3] as ratonal functons wthout poles n a certan regon of the fnte complex plane, and they are used todescrbethesetofalltransfer functons for partcular sgnals usng a set of admssble controllers. In [4] t s shown that the rng of proper and stable ratonal functons s a Eucldean doman, and the Eucldean dvson Correspondng author.
2 process n ths rng s characterzed. The algebra of proper and Ω-stable ratonal functons and matrces s examned n [5], where Ω s a symmetrc regon of the fnte complex plane C, contanng + C := {s C, Re(s) }, and excludng at least one negatve real number. Generalzed polynomals are usually lmted n the prevous references to proper ratonal functons wth poles (or wth no poles) n a regon of the fnte complex plane. We present n ths paper an extenson of ths concept, by ncludng the pont at nfnty, and consderng a regon of the extended complex plane. Algebrac propertes of generalzed polynomals are studed, and extensons of well-known results are presented. Wth a sutable defnton of a degree functon, t s shown that the set of -generalzed polynomals s a Eucldean rng, and canoncal forms for -generalzed polynomal matrces are derved. We consder here only the propertes of generalzed polynomals that are needed to study the problem of decouplng wth -stablty of lnear square multvarable systems. Even though most of the propertes and results presented here about generalzed polynomals and generalzed polynomal matrces can be consdered as extensons of standard results, we beleve our approach s more comprehensve and provdes a nce nterpretaton of concepts and results n terms of poles and zeros of the functons belongng or not to the regon. For nstance, concepts lke the degree of a generalzed polynomal, or the characterzaton of a unt n the rng of generalzed polynomal, have a nce nterpretaton n terms of the zeros of the functon out of the regon. Also, a wder set of ratonal functons lke polynomals and nonproper ratonal functons can be consdered as partcular cases of -generalzed polynomals. Afterwards, we present an applcaton of the notons and propertes of -generalzed polynomals to the problem of decouplng wth -stablty of lnear square multvarable systems,.e. decouplng of lnear systems wth closed-loop poles n a regon of the complex plane. Roughly speakng, decouplng of dynamc systems mples ndependence between the nputs and the outputs of the system, and from the practcal pont of vew t s of nterest to acheve decouplng because t s often desrable to control the outputs of the system ndependently. We are nterested n the rowby-row decouplng of lnear multvarable systems by statc state feedback. Ths problem has been extensvely studed snce the 96 s, and t has been solved for the case of regular state feedback (see for nstance [6,7]), whch s the knd of state feedback that has to be appled to decouple systems wth the same number of nputs and outputs (square systems). The regular decouplng problem wth stablty by statc state feedback has been solved n [8,9]. In ths paper, t s proved that a lnear system s decouplable wth -stablty f and only f the so-defned -stable nteractor of the system s a dagonal matrx, or equvalently, f and only f the row and global zero structure of the system out of the regon concde. The -stable nteractor and the row and global zero structure of the system out of are defned va the column HermteformandtheSmthformofthesystemtransferfunctonovertherngof-generalzed polynomals. If the system s decouplable wth -stablty, a procedure to compute a decouplng state feedback s presented. It s also shown that the condtons for the row-by-row decouplng problem and decouplng wth stablty can be easly obtaned as partcular cases of our soluton. Ths work s organzed as follows. In secton, -generalzed polynomals are ntroduced and some of ther algebrac propertes are consdered. Secton 3 deals wth -generalzed polynomal matrces, and the generalzed Hermte form and the Smth form of a matrx are presented. These canoncal forms can be consdered as the natural extensons of smlar concepts for polynomal matrces. No proofs of the results presented n secton and secton 3 are provded, snce they can be consdered as extensons of well-known results. An applcaton of the propertes of -generalzed polynomals and matrces s presented n secton 4, where we study the problem of decouplng wth -stablty of lnear multvarable systems. Fnally, we end wth some conclusons. -Generalzed polynomals We wll frst ntroduce some notaton. Through ths work, IR wll denote the feld of real numbers, C wll stand for the complex plane and C for the extended complex plane,.e. C = C { }. Also, C wll denote the open left half complex plane, and C ts extended verson,.e. C = C { }. The set of polynomals n the varable s wth coeffcents n IR wll be denoted by IR[s], and the set of ratonal functons over IR wll be denoted by IR(s). The pont s = w C s sad to be a
3 s w s w zero of f(s) f lm f(s) =, and s = w C s sad to be a pole of f(s) f lm f(s) =. Accordngtothsdefnton, f zeros and poles are counted wth ther own multplctes, then any ratonal functon has the same number of poles and zeros snce the pont at nfnty s taken nto account. The ratonal functon f(s) = a(s)/b(s), where a(s) andb(s) are coprme polynomals, s sad to be proper f deg b(s) deg a(s), strctly proper f deg b(s) > deg a(s), and proper and stable f t s proper, and ts poles le n the open left half complex plane C. A symmetrc subset of C s a set C, contanng at least one pont of the real axs, and wth the property that f s = α + jω, thens = α jω. These restrctons on are bascally due to the fact that we are dealng wth ratonal functons wth real coeffcents. As a specal case, we can also defne = { }. The man concept of ths secton s the followng: Gven a symmetrc set C,thesetof -generalzed polynomals, denoted IR (s), s defned as the set of ratonal functons whose poles are n. Example. In ths example we specfy some regons for and fnd ther correspondng set IR (s): If s taken as the extended complex plane C, then IR (s) s the set of ratonal functons IR(s). If s defned as the complex plane C, then IR (s) s the set of proper ratonal functons. In ths case f(s) IR (s) has to have all ts poles n fnte postons wthn the complex plane as the proper ratonal functons do. The set of proper ratonal functons wll be denoted by IR p(s). If = { } then IR (s) s the set of polynomals IR[s]. Ths can also be seen from the fact that any polynomal can be consdered as a ratonal functon f(s) = a(s)/b(s), where b(s) =,.e. a ratonal functon wth no fnte poles. If = C, then IR (s) s the set of stable ratonal functons. If = C, then IR (s) s the set of proper and stable ratonal functons, hereafter denoted IR (s). ps Wth the usual defntons of addton and multplcaton of ratonal functons, t can be seen that IR (s) s a commutatve rng (wth multplcatve unt and addtve unt ), and t s also an ntegral doman. The next step s to show that IR (s) s a Eucldean rng. To ths end, for any nonzero element f(s) IR (s), we defne the functon γ(f), called the degree of f(s) and denoted by deg f(s), as the number of zeros of f(s) lyngoutsdeof. Remark. Observe that the prevous defnton agrees completely wth the defnton of the degree of an element n the rngs IR[s], IR p(s) and IR ps(s), where: If a(s) IR[s] s a polynomal ( = ), then γ(a) =dega(s), whch corresponds to the number of fnte zeros of a(s). If f(s) =a(s)/b(s) IR p(s) s a proper ratonal functon ( = C), then γ(f) =degb(s) deg a(s), whch corresponds to the number of nfnte zeros of f(s). If g(s) IR ps(s) s a proper and stable ratonal functon ( = C ), then γ(g) =numberof unstable + nfnte zeros of g(s),.e. number of zeros of g(s) outsdeofc. Through ths work, the degree of the proper ratonal functon f(s) IR p(s) wll be denoted by degp f(s), and the degree of the proper and stable ratonal functon g(s) IR ps(s) wll be denoted by deg g(s). ps Wth ths defnton of deg f(s), t s evdent that the unts of the rng IR (s) are the nonzero elements f(s) IR (s)suchthatdegf(s) =. From the algebrac pont of vew, the followng s a fundamental property of IR (s). Theorem. Gven a symmetrc set, then IR (s) s a Eucldean rng, wth the degree functon as defned prevously,.e. as the number of zeros of f(s) lyngoutsdeof. 3
4 Some more concepts are further ntroduced next. Lemma. Let h(s), f(s) IR (s). Then h(s) dvdes f(s) (.e. there exsts x(s) IR (s) such that f(s) =h(s)x(s)), denoted h(s) f(s), f and only f each zero of h(s) outsdeof s also a zero of f(s), at least wth the same multplcty. The functon h(s) IR (s) s sad to be a greatest common dvsor (gcd) of f(s) andg(s) IR (s) f h(s) sacommondvsoroff(s) andg(s),.e., h(s) f(s) andh(s) g(s), and any other common dvsor of f(s) andg(s) sadvsorofh(s). A gcd of a set of more than functons can be defned n an analogous manner. Let h(s) IR (s) be a greatest common dvsor of f(s) andg(s) IR (s). Then h (s) :=h(s)u(s) s also a gcd of f(s) andg(s), where u(s) s a unt of IR (s). Thus, a greatest common dvsor of two generalzed polynomals s unque up to multplcaton by unts of the rng IR (s). Remark. The relevant nformaton n determnng the gcd of some functons f (s) sthe set of zeros outsde of whch are common to all these functons. Indeed, let h(s) beagcdofa fnte set of -generalzed polynomals f (s), f (s),..., f k(s). From Lemma. t can be seen that deg h(s) = n, wheren sthenumberofzerosoutsdeof whch are common to these functons f (s), f (s),..., f k(s). Accordng to the prevous remark, a gcd of a set of functons can be obtaned analytcally by nspecton of the zeros of these functons. A gcd can also be obtaned n an algorthmc way. The algorthm to obtan a gcd for polynomals s well known n the lterature (see, for nstance []) and t s based on the prncple of polynomal dvson. The extenson of ths procedure to IR (s), whch s not consdered n ths paper, can be readly obtaned snce Eucldean dvson also apples to -generalzed polynomals. Let h(s) beagcdoff(s) andg(s) IR (s). Then f(s) andg(s) are called coprme f h(s) s a unt of IR (s). The followng result s mmedate from Remark.. Lemma. The -generalzed polynomals f(s) andg(s) IR (s) are coprme f they do not have any common zeros outsde of. 3 -Generalzed polynomal matrces Matrces whose entres are -generalzed polynomals wll be consdered n ths secton. The set of m n matrces of dmensons m n whose entres belong to IR (s) wll be denoted by IR (s). Wth the usual defntons of addton and multplcaton of matrces, the set of square matrces whch m m belong to IR (s) s readly seen to be a non commutatve rng wth respect to these operatons. m m m m A square nonsngular matrx U(s) IR (s) s sad to be a unt of the rng IR (s) f there m m m m exsts V (s) IR (s) such that U(s)V (s) =V (s)u(s) =I m. Unts of IR (s) wll be called m m IR (s)-unmodular matrces. Then, the unts of IR (s) for polynomal, proper, and proper and stable ratonal matrces wll be called, respectvely, IR[s]-unmodular, IR p(s)-unmodular and IR (s)-unmodular matrces. ps m m Lemma 3. A square nonsngular matrx U(s) IR (s) s IR (s)-unmodular f and only f det U(s) s a unt of IR (s),.e. a nonzero ratonal functon whose degree s zero. Next, we wll ntroduce the generalzed Hermte form and the Smth form of a matrx, whch are canoncal forms defned va factorzatons usng IR (s)-unmodular matrces. m n Theorem 3. Let A(s) IR (s), and suppose for smplcty that rank A(s) = m. Then n n m n there exsts a IR (s)-unmodular matrx U(s) IR (s) and a matrx H(s) IR (s), called the 4
5 generalzed (column) Hermte form of A(s) and unque up to unts of IR (s), such that h (s) ()... A(s)U(s) =H(s) =... () (3.) h (s)... h (s). where, for >j, m mm h (s) =, or deg h (s) < deg h (s). (3.) j j Proof. The proof s constructve. The matrx H(s) s obtaned by elementary column operatons on A(s) over IR (s) and usng the dvson algorthm for -generalzed polynomals. The procedure s smlar to the case of the Hermte form of polynomal matrces (see []). It seems msleadng to call H(s) a canoncal form for A(s), when t happens that t s not completely unque but that t s unque up to unts of IR (s). We can overcome ths dffcultybyntroducng theconceptofamonc-generalzed polynomal. Ths noton, however, has to be establshed for every partcular case of -generalzed polynomals. We wll defne t for the rngs we are manly nterested n ths work. Consder the rngs IR[s], IR p(s), and IR ps(s), then: A polynomal wll be taken to be monc as usually understood,.e. a(s) IR[s] s monc f the coeffcent correspondng to ts hghest power s equal to. The proper ratonal functon f(s) IR p(s) wll be called monc f t s of the form f(s) = s n, where n =degp f(s). The proper and stable ratonal functon g(s) IR ps(s)wllbecalledmoncftsofthe ²(s) form g(s) = π where²(s) IR[s] s a monc polynomal wth roots out of the open left half n complex plane C (antstable polynomal), π = s + α wth α C,andn =degps g(s). The basc dea behnd the prevous defnton s that from any -generalzed polynomal, we can obtan the smplest element (a monc one) by extractng unts of IR (s) from t. Regardng Theorem3., fwefurtherspecfythath (s) n(3.) are monc -generalzed polynomals, then H(s) s a unque matrx. We wll consder that ths s the case when speakng about the Hermte form of some matrx. m n m m Theorem 3. Let A(s) IR (s) wth rank A(s) = r mn(m, n). Then, there exst IR (s)- unmodular matrces V (s) IR (s) and V (s) IR n n (s) such that " # r dag{ψ (s)} = V (s)a(s)v (s) =Ψ(s) = (3.3) where ψ (s) dvdes ψ + (s),.e. ψ (s) ψ (s), =,...,r. (3.4) + The -generalzed polynomals ψ (s) are unque up to multplcaton by unts of IR (s). We wll consder them to be monc, and they wll be called the nvarant factors of A(s), where as we stated prevously, the defnton of a monc -generalzed polynomal depends on the rng IR (s). Under ths assumpton the matrx Ψ(s), hereafter called the -generalzed Smth form, or smply the Smth form of A(s), s a canoncal form for A(s). If we defne the determnantal dvsors of A(s) IR m n (s) as (s) := monc gcd of all mnors of A(s), =,...,r, r =ranka(s), (3.5) then t can be seen that where (s) :=. (s) ψ (s) =, =,...,r, (3.6) (s) 5
6 4 Applcaton to decouplng wth -stablty We tackle n ths part of the paper the problem of decouplng wth -stablty of lnear multvarable square systems, whch wll be defned as the problem of decouplng plus the modes of the closedloop system beng located at a specfc symmetrc regon of the complex plane. The problem statement s presented n secton 4.. In secton 4. we defne the -stable nteractor va the column Hermte form of the system transfer functon over the rng IR (s), and show that ths matrx s the part of the system that s nvarant under the acton of a state feedback whch preserves -stablty. The man results and some llustratve examples are presented n secton Problem statement We consder n ths work square lnear multvarable and controllable systems descrbed by ½ ẋ(t) =Ax(t)+Bu(t) (A, B, C) y(t) =Cx(t) n p p where x IR, u IR and y IR are, respectvely, the state, nput and output vectors of the system. The system (A, B, C) s sad to be row-by-row decouplable by statc state feedback f there exsts astatefeedback (F, G) : u(t) =Fx(t)+Gv(t) p n p p where F IR and G IR are constant matrces, wth G nonsngular, and v(t) sanew nput vector, such that the nput v (t) controls the output y (t), =,...,p,wthoutaffectng the other outputs. Let be a symmetrc subset of the complex plane C. The system (A, B, C) ssadtoberow-by-row decouplable wth -stablty by statc state feedback, f t s decouplable and the egenvalues of the matrx (A + BF) arelocatedn. Observethat s taken here as a subset of the complex plane C, and not as a subset of the extended complex plane C as n secton, snce the egenvalues of the matrx (A + BF) areallfnte. From the nput-output pont of vew, the prevous formulaton s equvalent to the exstence of a state feedback (F, G) such that the transfer functon T F,G(s) of the closed loop system (A + BF,BG,C) softheform T (s) =C(sI A BF) BG = dag {w (s),...,w (s)} F,G p and the egenvalues of the matrx (A+BF) arelocatedn, whch mples also that w (s) IR (s), =,...,p. The egenvalues of the matrx (A + BF) are the modes of the closed-loop system (A + BF,BG,C). Thepolesofthesystemareasubsetofthesystemmodes,andbothsetsconcdefthesystem s controllable and observable. The dynamcs of the closed loop system (A + BF,BG,C) depends on the poston of the egenvalues of the matrx (A + BF), thus the mportance of assgnng these egenvalues. Decouplng assures that every nput s controllng every output ndependently; the modes locaton assures requred system dynamcs, for nstance stablty or faster response. We can suppose wthout loss of generalty that the modes of the system (the egenvalues of matrx A), are n,.e. that (A, B, C) s-stable; f not, there always exsts a prelmnary state feedback whch places the modes n, snce we are consderng the system (A, B, C) to be controllable. If the modes of the system are n, then the entres of the system transfer functon T (s) =C(sI A) B are -generalzed polynomals, because they are ratonal functons whose poles are n. Then, T (s) can be consdered as a -generalzed polynomal matrx. Ths consderaton wll be helpful when obtanng the column Hermte form and the Smth form of T (s) over the rng IR (s), and so that the condtons for decouplng wth -stablty can be drectly tested from the transfer functon of the system. 6
7 4. State feedback wth -stablty Let (F, G) be a statc state feedback appled on the -stable system (A, B, C), and such that the closed-loop system (A + BF,BG,C) s also -stable. The closed-loop transfer functon s gven by After some manpulatons we obtan T (s) =C(sI A BF) BG. F,G T F,G(s) =C(sI A) {z B [I F (si A) } {z B] G } T (s) R(s) where T (s) s the transfer functon of the system (A, B, C), and R(s) :=[I F (si A) B] G. Snce the closed-loop system s supposed to be -stable, then R(s) must be clearly a -generalzed polynomal matrx. Further, from R (s) =G [I F (si A) B] = G [det(si A)I F Adj(sI A)B] det(si A) t can be seen that R (s) s also a -generalzed polynomal matrx, snce the roots of det(si A) are n. Then, we have the followng result. Lemma 4. Let T (s) be the transfer functon of a -stablesystem(a, B, C). Then, the effect of a statc state feedback (F, G), G nonsngular, whch preserves -stablty can be represented n transfer functon terms as a IR (s)-unmodular matrx postmultplyng T (s). Ths fact establshes a natural restrcton on the type of feedback we can use whle tryng to acheve decouplng wth -stablty: For our purposes, the state feedback (F, G) wll be sad to be an admssble state feedback f ts effect on the system (A, B, C) can be represented as a IR (s)- unmodular precompensator actng on the system transfer functon T (s). Ths can be consdered as the matrx nterpretaton of the fact that we are nether allowed to ntroduce -unstable poles (poles out of ) nor to cancel out -unstable zeros n order to keep the nternal -stablty of the closed-loop system. At ths stage, t s mportant to consder the structural nformaton of the system (A, B, C) whch remans nvarant under the acton of IR (s)-unmodular compensaton, and consequently, nvarant under the acton of an admssble state feedback. 4.. The -stable nteractor Snce the acton of an admssble state feedback on (A, B, C) can be represented as multplcaton of T (s) on the rght by a IR (s)-unmodular matrx, the nformaton of the system that s nvarant under such a feedback s contaned n the column Hermte form of T (s) overtherngir (s)(see Theorem 3.), presented next. Let T (s) be the transfer functon of (A, B, C). Then, there exsts a IR (s)-unmodular matrx p p p p U(s) IR (s) and a nonsngular lower trangular matrx Φ (s) IR (s), unque up to unts of the rng IR (s), such that ϕ (s) ().. T (s)u(s) =Φ (s) =.., (4.) ϕ p(s)... ϕ pp(s) where the ratonal functons ϕ j(s) IR (s) satsfy, for >j, ϕ (s) =, or deg ϕ (s) < deg ϕ (s), (4.) j j and they are of the form ² (s) ϕ (s) = (4.3) πk 7
8 and for >j ² j(s) ϕ j(s) =, (4.4) πk j where ² (s) s an antstable polynomal, or polynomal wth only -unstable roots (roots out of ), π = s + α s a stable term ( α ), ² j(s) IR[s] s a polynomal, and k, kj are postve ntegers. The matrx U(s) represents elementary column operatons on T (s) overir (s). The ratonal matrx Φ (s), whch s the nverse of Φ (s), wll be called the -stable nteractor of the system, snce ths matrx can be consdered as the extenson of the classc nteractor [] for the set. NotcethatΦ (s) s not unque but t s unque up to unts of the rng IR (s). For a fxed π = s + α, thematrxφ (s) sunque,andhavngthsnmndswhywecalledt the stable nteractor of the system. Actually, the algebrac propertes of Φ (s) do not depend on the choce of π, nor the results stated n the next sectons based on these propertes. The matrx Φ (s) s n general a ratonal matrx havng only -unstable poles. Ths can be seen from the fact that the numerator of the determnant of Φ (s) s the product of the antstable polynomals ² (s), =,...,p.observethatf(a, B, C) hasnofnte zeros out of, thenφ (s) s a polynomal matrx. The -stable nteractor s a state feedback nvarant whch contans the -unstable structural nformaton of the system,.e. zeros out of of the system, ncludng nfnte zeros. 4.. Feedback realzaton of precompensators It was shown before that the effect of an admssble state feedback s equvalent n transfer functon termsasactngair (s)-unmodularprecompensator on the system transfer functon T (s). The converse problem for a proper compensator s the followng: A gven proper compensator P (s) s sad to be feedback realzable on the system (A, B, C) f there exsts a state feedback (F, G) such that P (s) =[I F (si A) B] G. The followng result, used n the proof of Theorem 4., states the condtons for a proper compensator to be realzable. Lemma 4. [3] Let the matrces N (s) andd(s) be a rght coprme matrx fracton descrpton (MFD) of the system (A, B, I n)wthd(s) column reduced, and let P (s) beanonsngular proper compensator. Then P (s) s state feedback realzable on (A, B, I n) f and only f P (s) s bproper, and P (s)d(s) s a polynomal matrx. 4.3 Man results The followng result presents the condtons for decouplng wth -stablty. Theorem 4. The controllable and -stable square system (A, B, C) s decouplable wth - stablty f and only f ts assocated -stable nteractor Φ (s) s a dagonal matrx. Proof. Necessty. Suppose that (A, B, C) s decouplable wth -stablty. Then there exsts a state feedback (F, G) such that T F,G(s) =C(sI A BF) BG = T (s)[i F (si A) B] G = W (s). Snce [I F (si A) B] G s a IR (s)-unmodular matrx, and W (s) =dag{w (s),...,w p(s)}, then t follows that Φ (s) s dagonal. Suffcency. Supposng that Φ (s) s dagonal, we wll prove ths part by showng that the IR (s)- unmodular matrx U(s) appearng n (4.) s feedback realzable. Let N (s) and D(s) be a rght coprmemfdofthesystem(a, B, I n)wthd(s) column reduced. Accordng to Lemma 4., U(s) wll be proved to be feedback realzable f U (s)d(s) s polynomal. From (4.) we have T (s)u(s) =CN (s)d (s)u(s) =Φ (s), 8
9 and from ths, we get Φ (s)cn (s) =U (s)d(s). (4.5) Snce the left hand sde of the last equaton has only poles out of, and the rght hand sde has only poles n, then clearly U (s)d(s) s a polynomal matrx, whch proves the result. Gven that U (s)d(s) s polynomal, then there exsts a constant soluton X, Y wth X no sngular to the polynomal matrx equaton [4] XD(s)+YN (s) =U (s)d(s). (4.6) Then, a state feedback (F, G) suchthatu(s) =[I F (si A) B] G s gven by F = X Y, G = X. (4.7) Ths state feedback decouples the system (A, B, C), preserves nternal -stablty and produces Φ (s) as the transfer functon of the closed-loop system. Remark 4. From the fact that the IR (s)-unmodular matrx U(s) n(4.) s feedback real- zable, then Φ (s) (dagonal or not) can be consdered as the transfer functon of the closed-loop system (A + BF,BG,C), whose -stable nteractor s Φ (s). Thus, the matrx U(s) canbere- garded as the nput-output result of a statc state feedback whch assgns poles of the system at the postons of -stable zeros producng cancellaton, and the remanng poles beng located at s = α. The necessary and suffcent condtons for decouplng wth -stablty, stated n Theorem 4. n terms of the -stable nteractor of the system, can also be expressed n terms of the row and global zero structure of the system out of, whch wll be defned as follows. Let n be the number of zeros out of (-unstable zeros), fnte or nfnte, multplctes n- cluded, of the th row of T (s). The ntegers {n, n,..., n p} wll be called the row zero structure of the system out of. Remark 4. Let Φ (s) be the column Hermte form of T (s) asgvenby(4.). Because of property (4.), and snce U(s) n(4.) s IR (s)-unmodular, t can be seen that f ϕ (s) sthe only entry dfferent from zero of the th row of Φ (s), then n =deg ϕ (s) =k, otherwse n < deg ϕ (s) =k. The global zero structure of the system out of wll be defned va the Smth form of the system transfer functon (see Theorem 3.). Let Ψ(s) be the Smth form of the system transfer functon T (s) overtherngir (s)foragven,.e. there exst IR (s)-unmodular matrces V (s) and V (s) such that p V (s)t (s)v (s) =Ψ(s) =dag{ψ (s)} (4.8) = where the ratonal functons ψ (s) IR (s) satsfy the dvsblty condtons over IR (s), and they are of the form ψ (s) ψ (s), =,...,p, + δ (s) ψ (s) =, =,...,p, π n where δ (s) s a polynomal wth only -unstable roots, π = s + α s a stable term, and n s a postve nteger. The global zero structure of the system out of wll be defned as the set of ntegers {n,n,...,n }, p 9
10 whch correspond to the degree of the ratonal functons ψ (s) n the Smth form of the system transfer functon T (s),.e. n =deg ψ (s), =,...,p. Lemma 4.3 Let Φ of T (s) over IR (s) as gven by (4.) and (4.8). Then (s) and Ψ(s) be, respectvely, the column Hermte form and the Smth form k = n (4.9) = = Proof. From (4.) and (4.8), and due to the fact that the degree of the determnant of a IR (s)- unmodular matrx s zero (see Lemma 3.), t can be seen that Then (4.9) results from the prevous equaton. deg [det Φ (s)] = deg [det Ψ(s)]. Theorem 4. The -stable nteractor of the system (A, B, C) s dagonal (equvalently: the system s decouplable wth -stablty) f and only f the row and global zero structure of the system out of s the same,.e. f and only f n = n. (4.) = = Proof. Necessty. Suppose that Φ (s) s dagonal. Then, from Remark 4. we have that Thus, from Lemma 4.3 we have (4.). n =deg ϕ (s) =k, =,...,p. Suffcency. Suppose that (4.) holds, but that Φ (s) s not dagonal. From Remark 4. we have that n < k for some =,...,p, mplyng also that Followng Lemma 4.3, ths means that n < k. = = contradctng our assumpton. n < n = = The next two examples llustrate the man results. Example 4. Let the system (A, B, C) begvenby A =, B =, 4 3 C =.5.5 whose transfer functon s (s+) T (s) =C(sI A) B =. s (s+) (s+) 4 3
11 Let us suppose that we want to decouple ths system by statc state feedback, such that the closedloop system s nternally stable,.e. such that the egenvalues of the matrx (A + BF) arenthe open left half complex plane C. It can be seen that the -stable nteractor of ths system for = C (IR (s)=ir ps(s)) s not a dagonal matrx, because the entry (, ) of T (s) cannotbe cancelled out by an elementary column operaton over IR (s), thus the system s not decouplable wth stablty. In terms of the row and global zero structure of the system out of = C Theorem 4.), we have that n =, n =, n =, n =3, and (4.) does not hold. The reason for ths s that the row nfnte zeros and the global nfnte zeros concde, but not the row and global unstable zeros, snce s = s an unstable global zero but t s not a row zero of T (s). Snce the row nfnte zeros {, } and the global nfnte zeros {, } concde, ths system s decouplable, but not decouplable wth stablty. Indeed, the decouplng compensator " # P (s) = s+ (s+)(s ) s s feedback realzable, and the state feedback realzng P (s) can be obtaned from a constant solu- ton X, Y wth X nonsngular to the polynomal matrx equaton XD(s)+YN (s) = P (s)d(s), where N (s), D(s) s a rght coprme MFD of (A, B, I n)wthd(s) column reduced. Then the state feedback F =, G = produces the decoupled system (A + BF,BG,C) whose transfer functon s ps (s+) T (s) =C(sI A BF) BG =, F,G (s+) but the closed-loop system s not nternally stable, snce one of the egenvalues of the matrx (A + BF) s equal to. Example 4. Let the system (A, B, C) begvenby 5 6 A = 5 9 6, B =, C = whose transfer functon s (s+) T (s) =C(sI A) B =. s (s+) (s )(s+) (s+) 4 3 Agan, let us suppose that we want to decouple ths system by statc state feedback, such that the closed-loop system s nternally stable. The -stablenteractorofthssystemfor = C (IR (s)=ir ps(s)) s a dagonal matrx " # π π Φ (s) = =, s π π or equvalently, the row and global nfnte and unstable zeros of the system concde, meanng that the system s decouplable wth stablty. s (see
12 From (4.), and wth π = s +,wehavethat " # U(s) = s+. (s+)(s+) s+ Then, from a constant soluton X, Y, wthx nonsngular, to the polynomal matrx equaton XD(s) +YN (s) =U (s)d(s), where N (s), D(s) s a rght coprme MFD of (A, B, I n)wth D(s) column reduced, we obtan the state feedback F =, G = whch produces the decoupled and stable system (A + BF,BG,C) whose transfer functon s (s+) T (s) =C(sI A BF) BG =. F,G s (s+) Actually, ths system can be decoupled wth stablty wth closed-loop transfer functon where α,,3,4 (s+α )(s+α ) T (s) = F,G are arbtrary postve real numbers. s (s+α 3)(s+α 4) Let us suppose now that we want to decouple ths system wth -stablty, where s the re- gon shown n Fg. 4., startng at s = 3, and formng an angle of ±45 wth the negatve real axs. Therowzerostructureofthesystemoutof s and the global zero structure out of s Fg. 4.. Regon n =, n =, n =, n =3. Snce these structures do not concde due to the fact that the global zero at s = snotarow zero of the system, then decouplng wth -stablty by statc state feedback can not be acheved. Ths can also be seen from the fact that the -stable nteractor of ths system s not a dagonal matrx. Notce that the angle of the regon wth respect to the real axs plays a role only f the system has complex fnte zeros wth magnary part dfferent from zero, whch s not the case n ths example. Snce the symmetrc regon of the complex plane can be arbtrarly chosen, t s to be expected that prevous results on decouplng can be deduced from our results. Indeed, the condtons for decouplng of square lnear multvarable systems, and decouplng wth stablty can be easly deduced from our soluton. For these two cases, the condtons of Theorem 4. can be nterpreted as follows:
13 Consder the decouplng problem wth closed-loop modes at any fnte poston. In ths case = C and the regon out of s =. Then the system (A, B, C) s decouplable f and only f the row and global nfntezerostructureofthesystemsthesame[6,7]. In the decouplng problem wth stablty, t s requred that all modes of the closed-loop system are n the left hand complex plane,.e. = C and = C+.Thenthesystem s decouplable n ths case f and only f the row and global zero structure of the system out of s the same,.e. f and only f the row and global nfnte zeros, plus the row and global zeros n C+ are the same [8,9]. 5 Conclusons In ths paper we have examned algebrac propertes of -generalzed polynomals, and appled these propertes to the problem of decouplng wth -stablty of lnear square multvarable systems. The structural necessary and suffcent condtons for ths problem to have a soluton are stated n terms of the -stable nteractor of the system or n terms of the row and global zero structure of the system out of. Summarzng: decouplng as such,.e. each system output beng controlled ndependently by one and only one nput regardless of the poston of the closed-loop modes, can be acheved f and only f the row nfnte zero structure of the system s the same as the global nfnte zero structure. If the system s decouplable, decouplng wth closed-loop modes n a partcular regon of the complex plane can be acheved f and only f the global fnte zeros out of of the system, multplctes ncluded, are also row fnte zeros of the system. Observe that f a system(a, B, C) wth no fnte zeros s decouplable, then t can be decoupled wth closed-loop modes located at any fnte poston of the complex plane. If a decouplable system has fnte zeros, then for the system to be decouplable wth -stablty, the regon must contan every global zero that t s not a row zero of the system. For nstance, n Example 4., the only global fnte zero that t s not a row fnte zero s s = ; then the system can be decoupled wth -stablty f and only f the regon contans ths pont. Theorems 4. and 4. state the necessary and suffcent condtons for decouplng wth -stablty, Theorem 4. n terms of the -stable nteractor of the system, and Theorem 4. n terms of the global and row zero structure of the system out of. From the practcal pont of vew, snce elementary operatons n a partcular rng could be very nvolved, n general s smpler to test the condtons of Theorem 4. than to obtan the -stable nteractor of the system. The row zero structure of the system out of can be obtaned for nstance from a gcd of the -th row of T (s), and the global zero structure of the system out of can be obtaned from the Smth form of T (s) usng the determnantal dvsors of T (s), avodng thus the use of elementary operatons n IR (s). Ths procedure, however, can also be very complcated. If the system (A, B, C) s decouplable wth -stablty, a decouplng state feedback can be computed as ndcated n the proof of Theorem 4.. Observe that the man feature of our extenson to generalzed polynomals as presented n ths paper, namely the ncluson of the pont at nfnty, s not fully exploted n the study of the decouplng problem wth -stablty. Indeed, though generally defned as a subset of the extended complex plane, for the problem of decouplng the regon s taken as a subset of the complex plane, snce the poles of a lnear system (A, B, C) areallfnte. Infnte poles may appear n the study of the so-called sngular systems,.e. systems of the form Eẋ(t) =Ax(t)+Bu(t) y(t) =Cx(t) where E s not square, or s sngular. But even n ths case, snce nfnte pole behavor s undesrable from the practcal pont of vew, control strateges are usually desgned to deal only wth fnte poles. It s then hoped that the concepts of generalzed polynomals wll be appled n a near future to solve n a unfed way other multvarable control problems besdes decouplng. As shown n Theorems 4. and 4., obtanng the Hermte and Smth canoncal forms s a cornerstone of the desgn algorthm to acheve multvarable decouplng. For the same reason as Gaussan elmnaton wthout pvotng can be numercally unstable n the feld of real or complexvalued matrces, t s now recognzed that elementary operatons on polynomal or ratonal objects 3
14 are not numercally sound. An mportant future research topc s therefore the development of numercal stable, effcent algorthms to deal wth -generalzed polynomals. Prelmnary work n ths drecton was descrbed n [5] n the specal case of polynomal matrces. References [] G.D. Forney, Convolutonal codes I: Algebrac structure, IEEE Trans. Inf. Theory, Vol. IT-6, pp , 97. [] A.S. Morse, System nvarants under feedback and cascade control, Proc. Int. Symp., Udne, Italy, pp. 6-74, 975. [3] L. Pernebo, An algebrac theory for the desgn of controllers for lnear multvarable systems, Part I and II, IEEE Trans. on Automat. Control, Vol. AC-6, No., pp. 7-8 and 83-94, 98. [4] M. Vdyasagar, Control system synthess: A factorzaton approach, TheMITPress, Cambrdge, Mass., 985. [5] A.I.G. Vardulaks, Lnear multvarable control, John Wley & Sons, 99. [6] P.L. Falb and W.A. Wolovch, Decouplng n the desgn and synthess of multvarable control systems, IEEE Trans. Automat. Contr., Vol. AC-, No. 6, pp , 967. [7] J.DescusseandJ.M.Don, Onthestructureatnfnty of lnear square decoupled systems, IEEE Trans. Automat. Contr., Vol. AC-7, No. 4, pp , 98. [8] J.C. Martínez G. and M. Malabre, The row by row decouplng problem wth stablty: A structural approach, IEEE Trans. Automat. Contr., Vol. 39, No., pp , 994. [9] J. Ruz-León, P. Zagalak, and V. Eldem, On the problem of decouplng, n Proc. 3rd IFAC Conference on System Structure and Control, pp. 6-66, Nantes, France, 995. [] V. Kučera, Dscrete lnear control: The polynomal equaton approach, John Wley & Sons, Chchester, 979. [] F.R. Gantmacher, Matrx theory, Vol. I, Chelsea Publshng Co., New York, 959. [] W.A. Wolovch and P.L. Falb, Invarants and canoncal forms under dynamc compensaton, SIAM J. Contr. Optmz., Vol. 4, No. 6, pp , 976. [3] M.L.J. Hautus and M. Heymann, Lnear feedback: An algebrac approach, SIAM J. Contr. and Optmz., Vol. 6, No., pp. 83-5, 978. [4] V. Kučera and P. Zagalak, Constant solutons of polynomal equatons, Int. J. Contr., Vol. 53, No., pp , 99. [5] D. Henron, M. Sebek, ˇ Relable numercal methods for polynomal matrx trangularzaton, IEEE Trans. Automat. Contr., Vol. 44, No. 3, pp ,
APPENDIX 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 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 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 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 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 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 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 informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
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 informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More information2.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 informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
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 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 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 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 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 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 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 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 informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
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 informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
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 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 informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
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 informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
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 informationDirichlet s Theorem In Arithmetic Progressions
Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
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 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 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 informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
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 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 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 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 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 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 informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
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 informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
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 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 informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
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 informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
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 informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
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 informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationFrom the Euclidean Algorithm for Solving a Key Equation for Dual Reed Solomon Codes to the Berlekamp-Massey Algorithm
1 / 32 From the Eucldean Algorthm for Solvng a Key Equaton for Dual Reed Solomon Codes to the Berlekamp-Massey Algorthm Mara Bras-Amorós, Mchael E O Sullvan The Claude Shannon Insttute Workshop on Codng
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationSPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION
SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION SERGIO ALBEVERIO 1,2,3,4, VOLODYMYR KOSHMANENKO 5, MYKOLA PRATSIOVYTYI 6, GRYGORIY TORBIN 7 Abstract. We ntroduce the conflct
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
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 information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
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 informationMAE140 - Linear Circuits - Winter 16 Final, March 16, 2016
ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
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 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 informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More information