Analysis of behavior of a simple eigenvalue of singular system
|
|
- Wilfred Crawford
- 5 years ago
- Views:
Transcription
1 Proceedings of the 213 International onference on Systems, ontrol and Informatics nalysis of behavior of a simple eigenvalue of singular system Maria Isabel García-Planas, Sonia Tarragona Matemàtica plicada I, Universitat Politècnica de atalunya, Minería 1, Esc, 1-3, 838 Barcelona, Spain mariaisabelgarcia@upcedu Departamento de Matemáticas, Universidad de León, ampus de Vegazana s/n, 2471, León, soniatarragona@unileones bstract Small perturbations of simple eigenvalues with a change of parameters is a problem of general interest in applied mathematics The aim of this work is to study the behavior of a simple eigenvalue of singular linear system family Epẋ px + Bpu, y px smoothly dependent on real parameters p p 1,, p n Index Terms Singular linear systems, Eigenvalues, Eigenvectors, Perturbation 1 INTRODUTION Let us consider a finite-dimensional singular linear time-invariant system Eẋt xt + But xt yt xt x, 1 where x is the state vector, u is the input or control vector, E, M n, B M n m, M p n and ẋ dx/dt We will represent the systems as quadruples of matrices E,, B, In the case where E I n the systems are standard and we will denote them, as triples, B, Singular systems are found in engineering systems such as electrical, chemical processing circuit or power systems, aircraft guidance and control, mechanical industrial plants, acoustic noise control, among others, and they have attracted interest in recent years Sometimes it is possible to change the value of some eigenvalues introducing proportional and derivative feedback controls in the system and proportional and derivative output injection The values of the eigenvalues that can not be modified by any feedback proportional or derivative and/or output injection proportional or derivative, correspond to the eigenvalues of the singular pencil se B, that we will simply call eigenvalues of the quadruple E,, B, Perturbation theory of linear systems has been extensively studied over the last years starting from the works of Rayleigh and Schrodinger [6], and more recently different works as [2], [5],[4], can be found This treatment of eigenvalues is a tool for efficiently approximating the influence of small perturbations on different properties of the unperturbed system Small perturbations of simple eigenvalues with a change of parameters is a problem of general interest in applied mathematics and concretely, this study for the kind of systems under consideration have some interest because in the case where m p < n, the most generic types of systems have n m simple eigenvalues The obtained results can be applied to analyze the frequency and damping perturbations in models of flexible structures for example, see [7], [8] In the sequel and without lost of generality, we will consider systems such that matrices B and have full and m p < n 123
2 Proceedings of the 213 International onference on Systems, ontrol and Informatics 2 FEEDBK ND OUTPUT INJETION EQUIVLENE RELTION Definition 21: Two quadruples E,, B, and E,, B, are called equivalent if, and only if, there exist matrices P, Q Gln;, R Glm;, S Glp;, F B, F E B M m n and F, F E M n p such that E QEP + F E P + QBF B E, QP + F P + QBF B, B QBR, SP, 2 ssociated to each eigenvalue there is an eigenvector defined in the following manner: or written in a matrix form Definition 23: i v E B M n 1 is an eigen- vector of this system corresponding to the B eigenvalue λ if and only if, there exist a vector w M m 1 such that Q FE E B P S F B Q F E R λ E + BF B P E B + BF B B v w S F B R, It is easy to check that this relation is an equivalence relation singular system E,, B,, for which there exist matrices FE B and/or F E such that E + BF E B + FE is invertible is called standardizable, and in this case there exist matrices P, Q, FE B, F E such that QEP + QBFE B + F E P I n onsequently the equivalent system is standard Notice that the standardizable character is invariant under the equivalence relation considered In the case where the original system is standard and if we want to preserve this condition under the equivalence relation we restrict the operation to the case where Q P 1, FE B and F E Definition 22: Let E,, B, be a system λ is an eigenvalue of this system if and only if λ E B < λe B We denote by σe,, B, the set of eigenvalues of the quadruple E,, B, and we call it the spectrum of the system The continuous invariants under this equivalence are the eigenvalues of the system that they are defined as follows Proposition 21: Let E,, B, be a system The spectrum of this system is invariant under equivalence relation considered Proof: It suffices to observe that λe B Q λf E F λe B S P λfe B F B R for all FE B, F B ii u M 1 n is a left eigenvector of the system corresponding to the eigenvalue λ if and only if, there exist a vector ω M 1 p such that λ u ω E + FE + F B, for all FE, F Proposition 22: Let λ be an eigenvalue and v an associated eigenvector of the E,, B, Then λ is an eigenvalue and v an associated eigenvector of E + BFE + F E, + BF B + F, B, for all FE B, F E, F B, F Proof: Let w w λ FE B F Bv I λ FE F λ E B I v I λ FE B F B I w I λ FE F λ E B v I λ FE B F Bv + w I λ FE F λ E B v I w I λ FE F I Proposition 23: Let λ be an eigenvalue and u an associated left eigenvector of the E,, B,
3 Proceedings of the 213 International onference on Systems, ontrol and Informatics Then λ is an eigenvalue and u an associated left eigenvector of E + BFE + F E, + BF B + F, B, for all F E B, F E, F B, F Proof: nalogous to the proof of proposition 22, taking ω ω u λ FE F Remark 21: Unlike the case of triples of matrices E,, B see [4] if λ is an eigenvalue of the quadruple E,, B, it is not necessarily a generalized eigenvalue of the pair E, Example 21: Let E,, B, be a system with E I, 1 2, B 3, 1 1 λe B det 3λ + 3 Then, the eigenvalue of the system is λ 1 Observe that v 3, 3 t is an eigenvector associated to λ 1 there exist w 1 But detλe λλ 2, so the eigenvalues of the pair E, are λ 1 and λ 2 2 Definition 24: n eigenvalue λ of the system E,, B, is called simple if and only if verifies the following conditions λ E B i λe B 1, ii and λ E B E λ E B λ E B λe B + Proposition 24: The simple character is invariant under equivalence relation considered Proof: onsidering Q Q λ FE F S FE Q λ FE F S P P λ FE B F B R P FE B λ FE B F B r Therefore, Q λ E B E λ E B λ E B E λ E B P Proposition 25: Let λ be a simple eigenvalue of the standard system, B, Then, there exist an associate eigenvector v and an associate left eigenvector u such that u v 1 Proof: If λ is a simple eigenvalue, the system can be reduced to 1 B, 1, λ 1, λ I with 1 B 1 n 1 1 In this reduced form it is easy to observe that v,,, 1 t is an eigenvector and v,,, 1 is a left eigenvector verifying u v 1 Now, taking into account propositions 22 and 23, we can check easily that P v is an eigenvector of the system, B, and u P 1 is a left eigenvector for some invertible matrix P Remark 22: In general, for singular systems this result fails, as we can see in the following example Example 22: Let E,, B, be a singular system with E,, B and 1 It is easy to observe that λ 3 is a simple eigenvalue of this system and all possible eigenvectors are v α, t with α and all possible left eigenvectors are u, β with β learly u v But, we have the following more general result Proposition 26: Let λ be a simple eigenvalue of the singular system E,, B, with m p 1 λe B and n + 1 Then, there exist an associate eigenvector v and an associate left eigenvector u such that u Ev
4 Proceedings of the 213 International onference on Systems, ontrol and Informatics Proof: If λ is a simple eigenvalue λ E B v w E λ E B v 1 for all v 1 and w 1 So taking v 1 and w 1 we have that Ev Suppose now that u Ev, in this case we have that Ev Ker u ω λ E B Ev Im Then, λ B v1 for some v w 1, w 1 1 v, w because Ev So λ E B v w E λ E B v 1 w 1 w 1 ans λ can not be simple Therefore u Ev 3 NLYSIS OF PERTURBTION OF SIMPLE EIGENVLUES Standard systems We begin studying the case of standard systems in order to make more comprehensive the study So, we consider systems in the form ẋ x + Bu, y x with M n, B M n m and M m n represented as a triple of matrices, B, Let, B, be a linear system and assume that the matrices, B, smoothly depend on the vector p p 1,, p r of real parameters The function p, Bp, p is called a multi-parameter family of linear systems Eigenvalues of linear system functions are continuous functions λp of the vector of parameters In this section, we are going to study the behavior of a simple eigenvalue of the family of linear systems p, Bp, p Let us consider a point p in the parameter space and assume that λp λ is a simple eigenvalue of p, Bp, p, B,, and vp v is an eigenvector, ie there exists w M m 1 such that v B w λ v v Equivalently + B F Bv B w λ v v, F B M m n Now, we are going to review the behavior of a simple eigenvalue λp of the family of standard linear systems The eigenvector vp corresponding to the simple eigenvalue λp determines a one-dimensional nullsubspace of the matrix operator smoothly B dependent on p Hence, the eigenvector vp and corresponding wp can be chosen as a smooth function of the parameters We will try to obtain an approximation by means of their derivatives We write the eigenvalue problem as pvp Bpwp λpvp pvp 3 Taking the derivatives with respect to p i, we have λp p p λpi vp vp + Bp wp Bp wp p vp p vp t the point p, we obtain λp p v + Bp p p i w p λ I vp wp B p p 4 p vp v p p This is a linear equation system for the unknowns λp, vp and wp Lemma 31: Let v and u be an eigenvector and a left eigenvector respectively, corresponding to the 4 126
5 Proceedings of the 213 International onference on Systems, ontrol and Informatics simple eigenvalue λ of the system E,, B, Then, the matrix λ I T B v u + has full Proof: It suffices to consider the system in the reduced form 1 B, 1, λ 1 Proposition 31: The system 4 has a solution if and only if λp p u ω i p Bp v p w 5 where u is a left eigenvector for the simple eigenvalue λ of the system, B, Proof: The system 4 can be rewritten as λp p Bp v p w p vp 6 λ I B wp p We have that 4 has a solution if and only if 6 has a solution Premultiplying both sides of the equation 6, by u, ω u ω λp λp u ω p i I u ω p I p Bp p p v w Bp p We obtain a solution for λp λ ;p λp p u ω p p p Bp p v w v p w v w u v Using the normalization condition, that is to say, taking v such that u v 1, we have: λp p p u ω i Bp v p p w p Knowing λp we can deduce vp p p First of all, we observe that if u v 1, then u vp and we can take vp such that u vp 1 normalization condition, it suffices to take as vp 1 the vector u vp So vp u vp u vp onsequently we can consider the compatible equivalent system: λp p p Bp λ I + v u B p v w vp wp p 7 In our particular case where m p, the system has a unique solution vp wp p T 1 λp p Bp p p v Taking the partial derivative 2 / p j on both sides of both equations in the eigenvalue problem 3, we can obtain a second order approximation for eigenvalues B Singular systems Now we consider singular systems as in 1 written as quadruple of matrices E,, B, In this case the eigenvalue problem is written as pvp Bpwp λpepvp pvp 8 Taking the derivatives with respect to p i, we have λp Ep + λp Ep p p λpep vp t the point p, we obtain vp + Bp wp Bp wp p vp p vp w 5 127
6 Proceedings of the 213 International onference on Systems, ontrol and Informatics λp λp E + λ Ep p p v + Bp p w λ E vp p B wp p p p v vp p 9 This is a linear equation system for the unknowns, vp and wp Suppose now, systems E,, B, with m λe B p 1 and n + 1 Lemma 32: Let v and u be an eigenvector and a left eigenvector respectively, corresponding to the simple eigenvalue λ of the system E,, B, Then, the matrix T λ E B + E v u E has full Proof: First of all we proof that E v u E λ u ω E + E v u E B v w E u ω v u E v w u E v 2, so, E v u E In the other hand v / Ker E v u E, because u E v 2 u E v u E v Suppose now, that λ E + E v u E B v w for some vectors v and w Then λ u ω E + E v u E B v w E u ω v u E v u w E v u E v Taking into account that u E v we have that u E v, so E v u E v, then v is an eigenvector of the system corresponding to the eigenvalue λ linearly independent of v, but λ is simple Proposition 32: The system 9 has a solution if and only if λp E p u ω i E + λ p Bp v w p 1 where u is a left eigenvector for the simple eigenvalue λ of the system E,, B, Proof: nalogously to the proof of proposition 31 we observe that proposition 26 permits to clear the unknown λp from equation 1 On the other hand, taking into account that u E v, we have that u Epvp in vp a neighborhood of the origin So, u E p Lemma 32 permits to obtain vp and wp Example 31: onsider now, the following two-parameter differentiable family of systems Ep, p, Bp, p with Bp Ep I, p p1, p p1 + p 2, p 1 + p p 1, 1 + p 2 1 t p, we have that λ 1 is a simple eigenvalue, v 3 3 t a right eigenvalue with w 1 and u, 1 with ω 1 a left eigenvector Then λ 1 1 p t , λ 1 1 p t ONLUSION In this work families of singular systems in the form Epẋ px + Bpu, y px smoothly dependent on a vector of real parameters p p 1,, p n have been considered study of the behavior of a simple eigenvalue of this family of singular linear system is analyzed and a description of a first approximation of the eigenvalues and corresponding eigenvectors have been obtained p 6 128
7 Proceedings of the 213 International onference on Systems, ontrol and Informatics REFERENES [1] ndrew, L, hu, KWE, Lancaster, P 1993 Derivatives of eigenvalues and eigenvectors of matrix functions, SIM J Matrix nal ppl, 14, 4, pp [2] Benner, P, Mehrmann, V, Xu, H 22 Perturbation nalysis for the Eigenvalue Problem of a Formal Product of Matrices, BIT, Numer nal, 42, pp 1-43 [3] E King-Wah hu, EKW 24 Perturbation of eigenvalues for matrix polynomials via the Bauer-Fike Theorems, SIM J Matrix nal ppl, 252, pp [4] García-Planas, MI, Tarragona, S 212 nalysis of behavior of the eigenvalues and eigenvectors of singular linear systems, Wseas Transactions on Mathematics, 11, 11, pp [5] García-Planas, MI, Tarragona, S 211 Perturbation analysis of simple eigenvalues of polynomial matrices smoothly depending on parameters, Recent Researches in Systems Science pp 1-13 [6] Kato, T 198 Perturbation Theory for Linear Operators, Springer-Verlag, Berlin [7] Mediano, B 211 nálisis y simulación del comportamiento de una tubería mediante MEF Master Thesis UP [8] Smith RS, 1995 Eigenvalue perturbation models for robust control IEEE Transactions on utomatic ontrol, 4, 6, pp
Consensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems
Consensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems M. ISABEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3,
More informationObtaining Consensus of Multi-agent Linear Dynamic Systems
Obtaining Consensus of Multi-agent Linear Dynamic Systems M I GRCÍ-PLNS Universitat Politècnica de Catalunya Departament de Matemàtica plicada Mineria 1, 08038 arcelona SPIN mariaisabelgarcia@upcedu bstract:
More informationExact Consensus Controllability of Multi-agent Linear Systems
Exact Consensus Controllability of Multi-agent Linear Systems M. ISAEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3, 08038 arcelona SPAIN maria.isabel.garcia@upc.edu
More informationStructural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems
Structural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems M. ISAL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, sc. C, 1-3, 08038 arcelona
More informationVERSAL DEFORMATIONS OF BILINEAR SYSTEMS UNDER OUTPUT-INJECTION EQUIVALENCE
PHYSCON 2013 San Luis Potosí México August 26 August 29 2013 VERSAL DEFORMATIONS OF BILINEAR SYSTEMS UNDER OUTPUT-INJECTION EQUIVALENCE M Isabel García-Planas Departamento de Matemàtica Aplicada I Universitat
More informationSufficient Conditions for Controllability and Observability of Serial and Parallel Concatenated Linear Systems
Sufficient Conditions for Controllability and Observability of Serial and Parallel Concatenated Linear Systems M. I. García-Planas J. L. Domínguez-García and L. E. Um Abstract This paper deals with the
More informationANALYSIS OF SUPPORT STRUCTURE OF WIND TURBINE TOWER
HYSCON 3, San Luis otosí, México, 6 9th August, 3 ANALYSIS OF SUORT STRUCTURE OF WIND TURBINE TOWER Begoña Mediano-Valiente Departament de Matemàtica Aplicada I Universitat olitècnica de Catalunya Spain
More informationOUTPUT CONTROLLABILITY AND STEADY-OUTPUT CONTROLLABILITY ANALYSIS OF FIXED SPEED WIND TURBINE
PHYSCON 2011, León, Spain, September, 5 September, 8 2011 OUTPUT CONTROLLABILITY AND STEADY-OUTPUT CONTROLLABILITY ANALYSIS OF FIXED SPEED WIND TURBINE J.L. Domínguez-García Electrical Engineering Area
More informationDecomposition of Linear Port-Hamiltonian Systems
American ontrol onference on O'Farrell Street, San Francisco, A, USA June 9 - July, Decomposition of Linear Port-Hamiltonian Systems K. Höffner and M. Guay Abstract It is well known that the power conserving
More informationANALYSIS OF CONTROL PROPERTIES OF CONCATENATED CONVOLUTIONAL CODES
CYBERNETICS AND PHYSICS, VOL 1, NO 4, 2012, 252 257 ANALYSIS OF CONTROL PROPERTIES OF CONCATENATED CONVOLUTIONAL CODES M I García-Planas Matemàtica Aplicada I Universitat Politècnica de Catalunya Spain
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationThe Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications
MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department
More informationConvolutional codes under linear systems point of view. Analysis of output-controllability
Convolutional codes under linear systems point of view Analysis of output-controllability M I GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matemàtica Aplicada Mineria 838 Barcelona
More informationPerturbations preserving conditioned invariant subspaces
Perturbations preserving conditioned invariant subspaces Albert ompta, Josep Ferrer and Marta Peña Departament de Matemàtica Aplicada I. E.T.S. Enginyeria Industrial de Barcelona. UP Diagonal 647. 0808
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k of the form
LINEARIZATIONS OF SINGULAR MATRIX POLYNOMIALS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M. DOPICO, AND D. STEVEN MACKEY Abstract. A standard way of dealing with a regular matrix polynomial
More informationLinearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition
Linearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition Kyle Curlett Maribel Bueno Cachadina, Advisor March, 2012 Department of Mathematics Abstract Strong linearizations of a matrix
More informationZeros and zero dynamics
CHAPTER 4 Zeros and zero dynamics 41 Zero dynamics for SISO systems Consider a linear system defined by a strictly proper scalar transfer function that does not have any common zero and pole: g(s) =α p(s)
More informationHopf bifurcation in coupled cell networks with abelian symmetry 1
Hopf bifurcation in coupled cell networks with abelian symmetry 1 Ana Paula S. Dias e Rui C. Paiva CMUP Departamento de Matemática Universidade do Porto CMUP Instituto Politécnico de Leiria Abstract We
More informationBASIC MATRIX PERTURBATION THEORY
BASIC MATRIX PERTURBATION THEORY BENJAMIN TEXIER Abstract. In this expository note, we give the proofs of several results in finitedimensional matrix perturbation theory: continuity of the spectrum, regularity
More informationLecture 11: Eigenvalues and Eigenvectors
Lecture : Eigenvalues and Eigenvectors De nition.. Let A be a square matrix (or linear transformation). A number λ is called an eigenvalue of A if there exists a non-zero vector u such that A u λ u. ()
More informationApplied Mathematics Letters. Complements to full order observer design for linear systems with unknown inputs
pplied Mathematics Letters 22 (29) 117 1111 ontents lists available at ScienceDirect pplied Mathematics Letters journal homepage: www.elsevier.com/locate/aml omplements to full order observer design for
More informationPerturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop
Perturbation theory for eigenvalues of Hermitian pencils Christian Mehl Institut für Mathematik TU Berlin, Germany 9th Elgersburg Workshop Elgersburg, March 3, 2014 joint work with Shreemayee Bora, Michael
More informationUNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if
UNDERSTANDING THE DIAGONALIZATION PROBLEM Roy Skjelnes Abstract These notes are additional material to the course B107, given fall 200 The style may appear a bit coarse and consequently the student is
More informationStabilization and Passivity-Based Control
DISC Systems and Control Theory of Nonlinear Systems, 2010 1 Stabilization and Passivity-Based Control Lecture 8 Nonlinear Dynamical Control Systems, Chapter 10, plus handout from R. Sepulchre, Constructive
More informationControl, Stabilization and Numerics for Partial Differential Equations
Paris-Sud, Orsay, December 06 Control, Stabilization and Numerics for Partial Differential Equations Enrique Zuazua Universidad Autónoma 28049 Madrid, Spain enrique.zuazua@uam.es http://www.uam.es/enrique.zuazua
More informationEigenvalues of rank one perturbations of matrices
Eigenvalues of rank one perturbations of matrices André Ran VU University Amsterdam Joint work in various combinations with: Christian Mehl, Volker Mehrmann, Leiba Rodman, Michał Wojtylak Jan Fourie, Gilbert
More informationStructural Properties of LTI Singular Systems under Output Feedback
Structural Properties of LTI Singular Systems under Output Feedback Runyi Yu Dept. of Electrical and Electronic Eng. Eastern Mediterranean University Gazimagusa, Mersin 10, Turkey runyi.yu@emu.edu.tr Dianhui
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationA Scalable Robust Stability Criterion for Systems with Heterogeneous LTI Components
9 merican ontrol onference Hyatt Regency Riverfront St. Louis MO US June - 9 ThB9. Scalable Robust Stability riterion for Systems with Heterogeneous LTI omponents U. T. Jönsson Royal Institute of Technology
More informationA new method to obtain ultimate bounds and convergence rates for perturbed time-delay systems
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR ONTROL Int. J. Robust. Nonlinear ontrol 212; 22:187 188 ublished online 21 September 211 in Wiley Online Library (wileyonlinelibrary.com)..179 SHORT OMMUNIATION
More informationMATRIX LIE GROUPS AND LIE GROUPS
MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either
More informationPARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT
PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT Hans Norlander Systems and Control, Department of Information Technology Uppsala University P O Box 337 SE 75105 UPPSALA, Sweden HansNorlander@ituuse
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationDiagonalization. P. Danziger. u B = A 1. B u S.
7., 8., 8.2 Diagonalization P. Danziger Change of Basis Given a basis of R n, B {v,..., v n }, we have seen that the matrix whose columns consist of these vectors can be thought of as a change of basis
More informationProblem 2 (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations:
EEE58 Exam, Fall 6 AA Rodriguez Rules: Closed notes/books, No calculators permitted, open minds GWC 35, 965-37 Problem (Dynamic Augmentation: State Space Representation) Consider a dynamical system consisting
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationDesign of a full order H filter using a polynomial approach
American ontrol onference Marriott Waterfront, Baltimore, M, USA June -July, WeA7. esign of a full order H filter using a polynomial approach M. Ezzine, H. Souley Ali, M. arouach and H. Messaoud Abstract
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More informationClosed-form Solutions to the Matrix Equation AX EXF = BY with F in Companion Form
International Journal of Automation and Computing 62), May 2009, 204-209 DOI: 101007/s11633-009-0204-6 Closed-form Solutions to the Matrix Equation AX EX BY with in Companion orm Bin Zhou Guang-Ren Duan
More informationM 340L CS Homework Set 12 Solutions. Note: Scale all eigenvectors so the largest component is +1.
M 34L CS Homework Set 2 Solutions Note: Scale all eigenvectors so the largest component is +.. For each of these matrices, find the characteristic polynomial p( ) det( A I). factor it to get the eigenvalues:,
More informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationRobust Anti-Windup Controller Synthesis: A Mixed H 2 /H Setting
Robust Anti-Windup Controller Synthesis: A Mixed H /H Setting ADDISON RIOS-BOLIVAR Departamento de Sistemas de Control Universidad de Los Andes Av. ulio Febres, Mérida 511 VENEZUELA SOLBEN GODOY Postgrado
More informationThe generalized Schur complement in group inverses and (k + 1)-potent matrices
The generalized Schur complement in group inverses and (k + 1)-potent matrices Julio Benítez Néstor Thome Abstract In this paper, two facts related to the generalized Schur complement are studied. The
More informationNonlinear palindromic eigenvalue problems and their numerical solution
Nonlinear palindromic eigenvalue problems and their numerical solution TU Berlin DFG Research Center Institut für Mathematik MATHEON IN MEMORIAM RALPH BYERS Polynomial eigenvalue problems k P(λ) x = (
More informationA note on linear differential equations with periodic coefficients.
A note on linear differential equations with periodic coefficients. Maite Grau (1) and Daniel Peralta-Salas (2) (1) Departament de Matemàtica. Universitat de Lleida. Avda. Jaume II, 69. 251 Lleida, Spain.
More informationKrylov Techniques for Model Reduction of Second-Order Systems
Krylov Techniques for Model Reduction of Second-Order Systems A Vandendorpe and P Van Dooren February 4, 2004 Abstract The purpose of this paper is to present a Krylov technique for model reduction of
More informationDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
Journal of Mathematical Modeling Vol. 3, No. 1, 2015, pp. 91-101 JMM Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form Kamele Nassiri Pirbazari
More informationThe disturbance decoupling problem (DDP)
CHAPTER 3 The disturbance decoupling problem (DDP) Consider the system 3.1. Geometric formulation { ẋ = Ax + Bu + Ew y = Cx. Problem 3.1 (Disturbance decoupling). Find a state feedback u = Fx+ v such that
More informationCheck that your exam contains 30 multiple-choice questions, numbered sequentially.
MATH EXAM SPRING VERSION A NAME STUDENT NUMBER INSTRUCTOR SECTION NUMBER On your scantron, write and bubble your PSU ID, Section Number, and Test Version. Failure to correctly code these items may result
More informationSection 4.4 Reduction to Symmetric Tridiagonal Form
Section 4.4 Reduction to Symmetric Tridiagonal Form Key terms Symmetric matrix conditioning Tridiagonal matrix Similarity transformation Orthogonal matrix Orthogonal similarity transformation properties
More informationNumerical Computation of Structured Complex Stability Radii of Large-Scale Matrices and Pencils
51st IEEE onference on Decision and ontrol December 10-13, 01. Maui, Hawaii, USA Numerical omputation of Structured omplex Stability Radii of Large-Scale Matrices and Pencils Peter Benner and Matthias
More information1 Review of simple harmonic oscillator
MATHEMATICS 7302 (Analytical Dynamics YEAR 2017 2018, TERM 2 HANDOUT #8: COUPLED OSCILLATIONS AND NORMAL MODES 1 Review of simple harmonic oscillator In MATH 1301/1302 you studied the simple harmonic oscillator:
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
More information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
More informationEigenvalue placement for regular matrix pencils with rank one perturbations
Eigenvalue placement for regular matrix pencils with rank one perturbations Hannes Gernandt (joint work with Carsten Trunk) TU Ilmenau Annual meeting of GAMM and DMV Braunschweig 2016 Model of an electrical
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationCyclic reduction and index reduction/shifting for a second-order probabilistic problem
Cyclic reduction and index reduction/shifting for a second-order probabilistic problem Federico Poloni 1 Joint work with Giang T. Nguyen 2 1 U Pisa, Computer Science Dept. 2 U Adelaide, School of Math.
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
More informationModeling and Simulation with ODE for MSE
Zentrum Mathematik Technische Universität München Prof. Dr. Massimo Fornasier WS 6/7 Dr. Markus Hansen Sheet 7 Modeling and Simulation with ODE for MSE The exercises can be handed in until Wed, 4..6,.
More informationAPPROXIMATE GREATEST COMMON DIVISOR OF POLYNOMIALS AND THE STRUCTURED SINGULAR VALUE
PPROXIMTE GRETEST OMMON DIVISOR OF POLYNOMILS ND THE STRUTURED SINGULR VLUE G Halikias, S Fatouros N Karcanias ontrol Engineering Research entre, School of Engineering Mathematical Sciences, ity University,
More information1. Find the solution of the following uncontrolled linear system. 2 α 1 1
Appendix B Revision Problems 1. Find the solution of the following uncontrolled linear system 0 1 1 ẋ = x, x(0) =. 2 3 1 Class test, August 1998 2. Given the linear system described by 2 α 1 1 ẋ = x +
More informationEE5120 Linear Algebra: Tutorial 6, July-Dec Covers sec 4.2, 5.1, 5.2 of GS
EE0 Linear Algebra: Tutorial 6, July-Dec 07-8 Covers sec 4.,.,. of GS. State True or False with proper explanation: (a) All vectors are eigenvectors of the Identity matrix. (b) Any matrix can be diagonalized.
More informationLINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE
LINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE TIMO REIS AND MATTHIAS VOIGT, Abstract. In this work we revisit the linear-quadratic
More information3. Mathematical Properties of MDOF Systems
3. Mathematical Properties of MDOF Systems 3.1 The Generalized Eigenvalue Problem Recall that the natural frequencies ω and modes a are found from [ - ω 2 M + K ] a = 0 or K a = ω 2 M a Where M and K are
More informationMatrix stabilization using differential equations.
Matrix stabilization using differential equations. Nicola Guglielmi Universitá dell Aquila and Gran Sasso Science Institute, Italia NUMOC-2017 Roma, 19 23 June, 2017 Inspired by a joint work with Christian
More informationEE221A Linear System Theory Final Exam
EE221A Linear System Theory Final Exam Professor C. Tomlin Department of Electrical Engineering and Computer Sciences, UC Berkeley Fall 2016 12/16/16, 8-11am Your answers must be supported by analysis,
More informationTotal 170. Name. Final Examination M340L-CS
1 10 2 10 3 15 4 5 5 10 6 10 7 20 8 10 9 20 10 25 11 10 12 10 13 15 Total 170 Final Examination Name M340L-CS 1. Use extra paper to determine your solutions then neatly transcribe them onto these sheets.
More informationUnit 5: Matrix diagonalization
Unit 5: Matrix diagonalization Juan Luis Melero and Eduardo Eyras October 2018 1 Contents 1 Matrix diagonalization 3 1.1 Definitions............................. 3 1.1.1 Similar matrix.......................
More informationA Note on Simple Nonzero Finite Generalized Singular Values
A Note on Simple Nonzero Finite Generalized Singular Values Wei Ma Zheng-Jian Bai December 21 212 Abstract In this paper we study the sensitivity and second order perturbation expansions of simple nonzero
More informationTOEPLITZ OPERATORS. Toeplitz studied infinite matrices with NW-SE diagonals constant. f e C :
TOEPLITZ OPERATORS EFTON PARK 1. Introduction to Toeplitz Operators Otto Toeplitz lived from 1881-1940 in Goettingen, and it was pretty rough there, so he eventually went to Palestine and eventually contracted
More informationEigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.
Eigenspaces 1. (a) Find all eigenvalues and eigenvectors of A = (b) Find the corresponding eigenspaces. [ ] 1 1 1 Definition. If A is an n n matrix and λ is a scalar, the λ-eigenspace of A (usually denoted
More informationElectronic version of an article published as [Automatica, 2004, vol. 40, No. 8, p ] [DOI:
Electronic version of an article published as [Automatica, 2004, vol. 40, No. 8, p. 1423-1428] [DOI: http://dx.doi.org/10.1016/j.automatica.2004.03.009] [copyright Elsevier] Feedback passivity of nonlinear
More informationarxiv: v1 [math.pr] 1 May 2014
Robustness of Cucker-Smale flocking model arxiv:45.37v [math.pr] May 24 Eduardo Canale Federico Dalmao Ernesto Mordecki Max O. Souza October 24, 28 bstract Consider a system of autonomous interacting agents
More informationThe Complete Set of PID Controllers with Guaranteed Gain and Phase Margins
Proceedings of the th IEEE onference on Decision and ontrol, and the European ontrol onference 5 Seville, Spain, December -5, 5 ThA7.5 The omplete Set of PID ontrollers with Guaranteed Gain and Phase Margins
More informationNOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
NOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS MARK WILDON Contents 1. Definition of polynomial representations 1 2. Weight spaces 3 3. Definition of the Schur functor 7 4. Appendix: some
More informationLMIs for Observability and Observer Design
LMIs for Observability and Observer Design Matthew M. Peet Arizona State University Lecture 06: LMIs for Observability and Observer Design Observability Consider a system with no input: ẋ(t) = Ax(t), x(0)
More informationLecture 12: Diagonalization
Lecture : Diagonalization A square matrix D is called diagonal if all but diagonal entries are zero: a a D a n 5 n n. () Diagonal matrices are the simplest matrices that are basically equivalent to vectors
More informationPOLYNOMIAL EMBEDDING ALGORITHMS FOR CONTROLLERS IN A BEHAVIORAL FRAMEWORK
1 POLYNOMIAL EMBEDDING ALGORITHMS FOR CONTROLLERS IN A BEHAVIORAL FRAMEWORK H.L. Trentelman, Member, IEEE, R. Zavala Yoe, and C. Praagman Abstract In this paper we will establish polynomial algorithms
More informationA Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case
A Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case ATARU KASE Osaka Institute of Technology Department of
More informationRepresentations. 1 Basic definitions
Representations 1 Basic definitions If V is a k-vector space, we denote by Aut V the group of k-linear isomorphisms F : V V and by End V the k-vector space of k-linear maps F : V V. Thus, if V = k n, then
More informationRobust exact pole placement via an LMI-based algorithm
Proceedings of the 44th EEE Conference on Decision and Control, and the European Control Conference 25 Seville, Spain, December 12-15, 25 ThC5.2 Robust exact pole placement via an LM-based algorithm M.
More informationSolving Polynomial Eigenproblems by Linearization
Solving Polynomial Eigenproblems by Linearization Nick Higham School of Mathematics University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with D. Steven Mackey and Françoise
More informationUnit 5. Matrix diagonaliza1on
Unit 5. Matrix diagonaliza1on Linear Algebra and Op1miza1on Msc Bioinforma1cs for Health Sciences Eduardo Eyras Pompeu Fabra University 218-219 hlp://comprna.upf.edu/courses/master_mat/ We have seen before
More informationA Novel PCA-Based Bayes Classifier and Face Analysis
A Novel PCA-Based Bayes Classifier and Face Analysis Zhong Jin 1,2, Franck Davoine 3,ZhenLou 2, and Jingyu Yang 2 1 Centre de Visió per Computador, Universitat Autònoma de Barcelona, Barcelona, Spain zhong.in@cvc.uab.es
More informationRobust Control 2 Controllability, Observability & Transfer Functions
Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable
More informationAn efficient algorithm to compute the real perturbation values of a matrix
An efficient algorithm to compute the real perturbation values of a matrix Simon Lam and Edward J. Davison 1 Abstract In this paper, an efficient algorithm is presented for solving the nonlinear 1-D optimization
More informationMath Abstract Linear Algebra Fall 2011, section E1 Practice Final. This is a (long) practice exam. The real exam will consist of 6 problems.
Math 416 - Abstract Linear Algebra Fall 2011, section E1 Practice Final Name: This is a (long) practice exam. The real exam will consist of 6 problems. In the real exam, no calculators, electronic devices,
More informationNonlinear Observers. Jaime A. Moreno. Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México
Nonlinear Observers Jaime A. Moreno JMorenoP@ii.unam.mx Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México XVI Congreso Latinoamericano de Control Automático October
More informationDESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES
DESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES by HEONJONG YOO A thesis submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey In partial fulfillment of the
More informationMASLOV INDEX. Contents. Drawing from [1]. 1. Outline
MASLOV INDEX J-HOLOMORPHIC CURVE SEMINAR MARCH 2, 2015 MORGAN WEILER 1. Outline 1 Motivation 1 Definition of the Maslov Index 2 Questions Demanding Answers 2 2. The Path of an Orbit 3 Obtaining A 3 Independence
More informationGeometric Control Theory
1 Geometric Control Theory Lecture notes by Xiaoming Hu and Anders Lindquist in collaboration with Jorge Mari and Janne Sand 2012 Optimization and Systems Theory Royal institute of technology SE-100 44
More informationSolution to Sylvester equation associated to linear descriptor systems
Solution to Sylvester equation associated to linear descriptor systems Mohamed Darouach To cite this version: Mohamed Darouach. Solution to Sylvester equation associated to linear descriptor systems. Systems
More informationMin-Max Output Integral Sliding Mode Control for Multiplant Linear Uncertain Systems
Proceedings of the 27 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July -3, 27 FrC.4 Min-Max Output Integral Sliding Mode Control for Multiplant Linear Uncertain
More informationIMPLICATIONS OF DISSIPATIVITY AND PASSIVITY IN THE DISCRETE-TIME SETTING. E.M. Navarro-López D. Cortés E. Fossas-Colet
IMPLICATIONS OF DISSIPATIVITY AND PASSIVITY IN THE DISCRETE-TIME SETTING E.M. Navarro-López D. Cortés E. Fossas-Colet Universitat Politècnica de Catalunya, Institut d Organització i Control, Avda. Diagonal
More information