Eigenvalue placement for regular matrix pencils with rank one perturbations
|
|
- Shauna Higgins
- 5 years ago
- Views:
Transcription
1 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
2 Model of an electrical network A model for a LC-circuit with simplified transistor behavior is given by the differential-algebraic equation d dt 0 c p g m x(t) = x(t) R p 0 } {{ 0 L p } } {{ 0 0 } =:E =:A the solutions can be described with the eigenvectors and eigenvalues of a matrix pencil A(s) = se A, s C. Problems: E is singular, A non-hermitian
3 Problem statement Given: Network described by the pencil se A, E, A C n n Task: Improve the properties of the network by moving the eigenvalues into a certain region G C How to move: Add step-by-step new elements to network. Example element: A capacity can be described by the pencil C ij (s) := sc ij (e i e j )(e i e j ) T, c ij > 0. New circuit: s(e + c ij (e i e j )(e i e j ) T ) A Difficulty: Number of elements types is restricted, therefore the class of perturbations is restricted. Today: Which eigenvalue sets can be obtained under arbitrary rank one perturbations?
4 Eigenvalues and regularity For fixed λ C observe that A(λ) = λe A is a matrix, so we define the spectrum of A as σ(a) := {λ C 0 is eig.val. of λe A}, σ(a) := {λ C 0 is eig.val. of λe A} { }, A(s) = se A regular : det(se A) 0 for E invertible and for E singular. For A(s) = se A regular the set σ(a) \ { } is the zero set of det(se A). For A(s) = se A singular we have σ(a) = C
5 Eigenvalues and regularity For fixed λ C observe that A(λ) = λe A is a matrix, so we define the spectrum of A as σ(a) := {λ C 0 is eig.val. of λe A}, σ(a) := {λ C 0 is eig.val. of λe A} { }, A(s) = se A regular : det(se A) 0 for E invertible and for E singular. For A(s) = se A regular the set σ(a) \ { } is the zero set of det(se A). For A(s) = se A singular we have σ(a) = C
6 The rank of matrix pencils The rank of A(s) = se A is rk A := max λ C rk (λe A). A is regular if and only if rk A = n Proposition The pencil P(s) = sf G with F, G C n n has rank one if and only if there exists u, v, w C n with w 0 and u 0 or v 0 such that P(s) = (su + v)w T or P(s) = w(su T + v T ).
7 Jordan chains and root subspaces For λ σ(a) \ { } we call {g 0, g 1,..., g m 1 } C n a Jordan chain of length m at λ iff g 0 0 and (A λe)g 0 = 0, (A λe)g 1 = Eg 0,..., (A λe)g m 1 = Eg m 2. We call {g 0, g 1,..., g m 1 } C n a Jordan chain of length m at iff g 0 0 and Eg 0 = 0, Eg 1 = Ag 0,..., Eg m 1 = Ag m 2. Define the (kth) root subspace of A at λ as L k λ (A) := {g i C n g i {g 0,..., g k 1 } is JC of A at λ} L λ (A) := {g C n g i {g 0,..., g m 1 } is JC of A at λ}
8 Jordan chains and root subspaces For λ σ(a) \ { } we call {g 0, g 1,..., g m 1 } C n a Jordan chain of length m at λ iff g 0 0 and (A λe)g 0 = 0, (A λe)g 1 = Eg 0,..., (A λe)g m 1 = Eg m 2. We call {g 0, g 1,..., g m 1 } C n a Jordan chain of length m at iff g 0 0 and Eg 0 = 0, Eg 1 = Ag 0,..., Eg m 1 = Ag m 2. Define the (kth) root subspace of A at λ as L k λ (A) := {g i C n g i {g 0,..., g k 1 } is JC of A at λ} L λ (A) := {g C n g i {g 0,..., g m 1 } is JC of A at λ}
9 Rank one perturbation of root subspaces Lemma 2.1 in Dopico, Moro, De Terán 08 implies the following perturbation result. Theorem (G., Trunk 16; Dopico, Moro, De Terán 08) For A regular and P rank one such that A + P is regular, we have for all λ C and all k N \ {0} dim ker(a + P)(λ) dim ker A(λ) 1, Lk+1 λ (A + P) dim dim Lk+1 λ (A) (A + P) L k λ (A) 1, L k λ dim L k λ (A + P) dim Lk λ (A) k. Similar results by Savchenko 03 for matrices and Behrndt, Leben, Martinez Peria, Trunk 15 for operators
10 Rank one perturbations of root subspaces Denote by m(λ) the length of the longest JC at λ σ(a) and define M(A) := λ σ(a) m(λ) Proposition (G, Trunk 16) Let A be regular and P be of rank one such that A + P is regular, then the following estimates hold: dim L λ (A) m(λ) dim L λ (A + P), dim L λ (A + P) dim L λ (A) + M(A) m(λ), 0 dim L µ (A + P) M(A), µ C\σ(A) for λ σ(a), for λ σ(a),
11 Eigenvalue placement for regular pencils Given regular A(s) = se A with σ(a) = {λ 1,..., λ m } and multiplicities m(λ i ) Given pairwise distinct µ 1,..., µ l C with multiplicities m i > 0 Construct rank one P with σ(a + P) = {µ 1,..., µ l } with multiplicities m i at µ i? Previous Results: Golub 73 for E = I n, A symmetric, Krupnik 92 for E = I n (only inverse problem), Elhay, Golub, Ram 03 for E > 0 and A symmetric
12 Eigenvalue placement for regular pencils Given regular A(s) = se A with σ(a) = {λ 1,..., λ m } and multiplicities m(λ i ) Given pairwise distinct µ 1,..., µ l C with multiplicities m i > 0 Construct rank one P with σ(a + P) = {µ 1,..., µ l } with multiplicities m i at µ i? Previous Results: Golub 73 for E = I n, A symmetric, Krupnik 92 for E = I n (only inverse problem), Elhay, Golub, Ram 03 for E > 0 and A symmetric
13 Eigenvalue placement for regular pencils Given regular A(s) = se A with σ(a) = {λ 1,..., λ m } and multiplicities m(λ i ) Given pairwise distinct µ 1,..., µ l C with multiplicities m i > 0 Construct rank one P with σ(a + P) = {µ 1,..., µ l } with multiplicities m i at µ i? Previous Results: Golub 73 for E = I n, A symmetric, Krupnik 92 for E = I n (only inverse problem), Elhay, Golub, Ram 03 for E > 0 and A symmetric
14 Eigenvalue placement for regular pencils Theorem (G, Trunk 16) Given pairwise distinct µ 1,..., µ l C, with multiplicities m i N \ {0} such that l i=1 m i = M(A), then we find such that P(s) = (αs β)uv T, α, β C u, v C n σ(a + P) = {µ 1,..., µ l } {λ σ(a) dim ker A(λ) 2}. and dim L λ (A + P) is equal to dim L λ (A) m(λ) + m i, for λ = µ i σ(a), dim L λ (A) m(λ), for λ σ(a) \ {µ 1,..., µ l }, m i, for λ = µ i / σ(a), 0, for λ / σ(a) {µ 1,..., µ l }.
15 Remarks on the placement There is only one Jordan chain at each λ σ(a + P) \ σ(a) Similar result for E, A R n n and {µ 1,..., µ l } symmetric w.r.t. the real line, then we can find α, β R and u, v R n. Corollary For A C n n with dim ker(λ A) 1 and µ 1,..., µ l C with multiplicities m i N \ {0} satisfying l i=1 m i = n there exist u, v C n such that σ(a + uv T ) = {µ 1,..., µ l } and { dim L λ (A + uv T m i, if λ = µ i, ) = 0, if λ / {µ 1,..., µ l }.
16 Application: DAEs with feedback Given a single input DAE with state feedback u(t) = f T x(t), f C n E d dt x(t) = Ax(t) + b f T x(t), x(0) = x 0. Solutions are given by the eigenvalues and Jordan chains of (A + P)(s) := se (A + bf T ), P(s) = bf T
17 Application: DAEs with feedback Given a single input DAE with state feedback u(t) = f T x(t), f C n E d dt x(t) = Ax(t) + b f T x(t), x(0) = x 0. Solutions are given by the eigenvalues and Jordan chains of (A + P)(s) := se (A + bf T ), P(s) = bf T Let s compare the rank one perturbations P(s) = (αs β)uv T vs. P(s) = bf T. Here b C n is fixed and this affects the placement.
18 Application: DAEs with feedback Given a single input DAE with state feedback u(t) = f T x(t), f C n E d dt x(t) = Ax(t) + b f T x(t), x(0) = x 0. Solutions are given by the eigenvalues and Jordan chains of (A + P)(s) := se (A + bf T ), P(s) = bf T Let s compare the rank one perturbations P(s) = (αs β)uv T vs. P(s) = bf T. Here b C n is fixed and this affects the placement.
19 Application: DAEs with feedback For simplicity, assume that A(s) = se A, E, A C n n satisfies the Hautus condition rk [λe A, b] = n, for all λ C. (1) This implies dim ker(λe A) 1 for λ C hence M(A) = n. Theorem (Feedback placeability) Let se A be regular satisfying (1) with E singular such that se (A + bf T ) is regular. Given µ 1 = and µ 2,..., µ l C and multiplicities m i N \ {0} with l i=1 m i = M(A) there exists an f C n such that P(s) = bf T satisfies σ(a + P) = {, µ 2,..., µ l } {λ σ(a) : dim ker A(λ) 2}
20 References J. Behrndt, L.Leben, F. Martinez Peria, C. Trunk: The effect of finite rank perturbations on Jordan chains of linear operators, Linear Algebra Appl. 458 (2015), pp T. Berger, A. Ilchmann, S. Trenn: The quasi-weierstraß form for regular matrix pencils, Linear Algebra Appl. 436 (2012), pp F.M. Dopico, J. Moro, F. De Teran: Low rank perturbation of Weierstrass structure, SIAM J. Matrix Anal. Appl. 30 (2008), pp H. Gernandt, C. Trunk: Eigenvalue placement for regular matrix pencils with rank one perturbations, to appear at SIMAX, see also arxiv: M. Krupnik: Changing the spectrum of an operator by perturbation, Linear Algebra Appl. 167 (1992), pp
Key words. regular matrix pencils, rank one perturbations, matrix spectral perturbation theory
EIGENVALUE PLACEMENT FOR REGULAR MATRIX PENCILS WITH RANK ONE PERTURBATIONS HANNES GERNANDT AND CARSTEN TRUNK Abstract. A regular matrix pencil se A and its rank one perturbations are considered. We determine
More informationFINITE RANK PERTURBATIONS OF LINEAR RELATIONS AND SINGULAR MATRIX PENCILS
FINITE RANK PERTURBATIONS OF LINEAR RELATIONS AND SINGULAR MATRIX PENCILS LESLIE LEBEN, FRANCISCO MARTÍNEZ PERÍA, FRIEDRICH PHILIPP, CARSTEN TRUNK, AND HENRIK WINKLER Abstract. We elaborate on the deviation
More informationLinear relations and the Kronecker canonical form
Linear relations and the Kronecker canonical form Thomas Berger Carsten Trunk Henrik Winkler August 5, 215 Abstract We show that the Kronecker canonical form (which is a canonical decomposition for pairs
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 informationEigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations
Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations, VU Amsterdam and North West University, South Africa joint work with: Leonard Batzke, Christian
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 579 586 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Low rank perturbation
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
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 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 informationThe gap distance to the set of singular matrix pencils
The gap distance to the set of singular matrix pencils Thomas Berger Hannes Gernandt Carsten Trunk Henrik Winkler Michał Wojtylak March 6, 28 bstract We study matrix pencils se using the associated linear
More informationInvertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices
Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:
More informationThe Quasi-Weierstraß form for regular matrix pencils
The Quasi-Weierstraß form for regular matrix pencils Thomas Berger Achim Ilchmann Stephan Trenn submitted to Linear Algebra Appl. July 6, 2009 Dedicated to Heinrich Voß on the occasion of his 65 th birthday
More informationControllability of switched differential-algebraic equations
Controllability of switched differential-algebraic equations Ferdinand Küsters Markus G-M Ruppert Stephan Trenn Fachbereich Mathematik Technische Universität Kaiserslautern Postfach 349 67653 Kaiserslautern
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
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 informationPerturbation Theory for Self-Adjoint Operators in Krein spaces
Perturbation Theory for Self-Adjoint Operators in Krein spaces Carsten Trunk Institut für Mathematik, Technische Universität Ilmenau, Postfach 10 05 65, 98684 Ilmenau, Germany E-mail: carsten.trunk@tu-ilmenau.de
More informationThe Quasi-Weierstraß form for regular matrix pencils
The Quasi-Weierstraß form for regular matrix pencils Thomas Berger Achim Ilchmann Stephan Trenn first submission: July 2009; revision: October 2009 Dedicated to Heinrich Voß on the occasion of his 65 th
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 informationImpulse free solutions for switched differential algebraic equations
Impulse free solutions for switched differential algebraic equations Stephan Trenn Institute of Mathematics, Ilmenau University of Technology, Weimerarer Str. 25, 98693 Ilmenau, Germany Abstract Linear
More informationControl Systems Design, SC4026. SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC4026 SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) vs Observability Algebraic Tests (Kalman rank condition & Hautus test) A few
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationSystems and Control Theory Lecture Notes. Laura Giarré
Systems and Control Theory Lecture Notes Laura Giarré L. Giarré 2018-2019 Lesson 14: Rechability Reachability (DT) Reachability theorem (DT) Reachability properties (DT) Reachability gramian (DT) Reachability
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
More informationControl Systems Design, SC4026. SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC4026 SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) and Observability Algebraic Tests (Kalman rank condition & Hautus test) A few
More informationSingular Value Decomposition (SVD) and Polar Form
Chapter 2 Singular Value Decomposition (SVD) and Polar Form 2.1 Polar Form In this chapter, we assume that we are dealing with a real Euclidean space E. Let f: E E be any linear map. In general, it may
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationHamburger Beiträge zur Angewandten Mathematik
Hamburger Beiträge zur Angewandten Mathematik Linear relations and the Kronecker canonical form Thomas Berger, Carsten Trunk, and Henrik Winkler Nr 215-27 July 215 LINEAR RELATIONS AND THE KRONECKER CANONICAL
More informationOn the computation of the Jordan canonical form of regular matrix polynomials
On the computation of the Jordan canonical form of regular matrix polynomials G Kalogeropoulos, P Psarrakos 2 and N Karcanias 3 Dedicated to Professor Peter Lancaster on the occasion of his 75th birthday
More informationThroughout these notes we assume V, W are finite dimensional inner product spaces over C.
Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal
More informationDiscrete Riccati equations and block Toeplitz matrices
Discrete Riccati equations and block Toeplitz matrices André Ran Vrije Universiteit Amsterdam Leonid Lerer Technion-Israel Institute of Technology Haifa André Ran and Leonid Lerer 1 Discrete algebraic
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 informationLow Rank Perturbations of Quaternion Matrices
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 38 2017 Low Rank Perturbations of Quaternion Matrices Christian Mehl TU Berlin, mehl@mathtu-berlinde Andre CM Ran Vrije Universiteit
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More information1.3 Convergence of Regular Markov Chains
Markov Chains and Random Walks on Graphs 3 Applying the same argument to A T, which has the same λ 0 as A, yields the row sum bounds Corollary 0 Let P 0 be the transition matrix of a regular Markov chain
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationA Control Methodology for Constrained Linear Systems Based on Positive Invariance of Polyhedra
A Control Methodology for Constrained Linear Systems Based on Positive Invariance of Polyhedra Jean-Claude HENNET LAAS-CNRS Toulouse, France Co-workers: Marina VASSILAKI University of Patras, GREECE Jean-Paul
More informationThe Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix
The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix Chun-Yueh Chiang Center for General Education, National Formosa University, Huwei 632, Taiwan. Matthew M. Lin 2, Department of
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationBlock companion matrices, discrete-time block diagonal stability and polynomial matrices
Block companion matrices, discrete-time block diagonal stability and polynomial matrices Harald K. Wimmer Mathematisches Institut Universität Würzburg D-97074 Würzburg Germany October 25, 2008 Abstract
More informationThe Jordan canonical form
The Jordan canonical form Francisco Javier Sayas University of Delaware November 22, 213 The contents of these notes have been translated and slightly modified from a previous version in Spanish. Part
More informationDescriptor system techniques in solving H 2 -optimal fault detection problems
Descriptor system techniques in solving H 2 -optimal fault detection problems Andras Varga German Aerospace Center (DLR) DAE 10 Workshop Banff, Canada, October 25-29, 2010 Outline approximate fault detection
More informationSOME REMARKS ON LINEAR SPACES OF NILPOTENT MATRICES
LE MATEMATICHE Vol. LIII (1998) Supplemento, pp. 2332 SOME REMARKS ON LINEAR SPACES OF NILPOTENT MATRICES ANTONIO CAUSA - RICCARDO RE - TITUS TEODORESCU Introduction. In this paper we study linear spaces
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationBackground Mathematics (2/2) 1. David Barber
Background Mathematics (2/2) 1 David Barber University College London Modified by Samson Cheung (sccheung@ieee.org) 1 These slides accompany the book Bayesian Reasoning and Machine Learning. The book and
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationComputation of a canonical form for linear differential-algebraic equations
Computation of a canonical form for linear differential-algebraic equations Markus Gerdin Division of Automatic Control Department of Electrical Engineering Linköpings universitet, SE-581 83 Linköping,
More informationComputational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1
Computational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1 B. N. Datta, IEEE Fellow 2 D. R. Sarkissian 3 Abstract Two new computationally viable algorithms are proposed for
More informationEigenvectors. Prop-Defn
Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.
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 informationTHE STABLE EMBEDDING PROBLEM
THE STABLE EMBEDDING PROBLEM R. Zavala Yoé C. Praagman H.L. Trentelman Department of Econometrics, University of Groningen, P.O. Box 800, 9700 AV Groningen, The Netherlands Research Institute for Mathematics
More informationLecture notes: Applied linear algebra Part 2. Version 1
Lecture notes: Applied linear algebra Part 2. Version 1 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 First, some exercises: xercise 0.1 (2 Points) Another least
More informationModule 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control
Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control Ahmad F. Taha EE 3413: Analysis and Desgin of Control Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/
More informationA normal form for pure differential algebraic systems
A normal form for pure differential algebraic systems Stephan Trenn December 2th 27 Abstract: In this paper linear time-invariant differential algebraic equations (DAEs) are studied; the focus is on pure
More informationA Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay
A Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay Zheng-Jian Bai Mei-Xiang Chen Jin-Ku Yang April 14, 2012 Abstract A hybrid method was given by Ram, Mottershead,
More information18.06SC Final Exam Solutions
18.06SC Final Exam Solutions 1 (4+7=11 pts.) Suppose A is 3 by 4, and Ax = 0 has exactly 2 special solutions: 1 2 x 1 = 1 and x 2 = 1 1 0 0 1 (a) Remembering that A is 3 by 4, find its row reduced echelon
More informationDM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini
DM554 Linear and Integer Programming Lecture 9 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. More on 2. 3. 2 Resume Linear transformations and
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationPRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.
Prof A Suciu MTH U37 LINEAR ALGEBRA Spring 2005 PRACTICE FINAL EXAM Are the following vectors independent or dependent? If they are independent, say why If they are dependent, exhibit a linear dependence
More informationApproximate Low Rank Solution of Generalized Lyapunov Matrix Equations via Proper Orthogonal Decomposition
Applied Mathematical Sciences, Vol. 4, 2010, no. 1, 21-30 Approximate Low Rank Solution of Generalized Lyapunov Matrix Equations via Proper Orthogonal Decomposition Amer Kaabi Department of Basic Science
More informationChapter 4 Euclid Space
Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationNumerical Methods for Solving Large Scale Eigenvalue Problems
Peter Arbenz Computer Science Department, ETH Zürich E-mail: arbenz@inf.ethz.ch arge scale eigenvalue problems, Lecture 2, February 28, 2018 1/46 Numerical Methods for Solving Large Scale Eigenvalue Problems
More informationStability, Pole Placement, Observers and Stabilization
Stability, Pole Placement, Observers and Stabilization 1 1, The Netherlands DISC Course Mathematical Models of Systems Outline 1 Stability of autonomous systems 2 The pole placement problem 3 Stabilization
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 informationSection 8.2 : Homogeneous Linear Systems
Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av
More informationSolution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian Matrices Using Newton s Method
Journal of Mathematics Research; Vol 6, No ; 014 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Solution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
More information9.1 Eigenvectors and Eigenvalues of a Linear Map
Chapter 9 Eigenvectors and Eigenvalues 9.1 Eigenvectors and Eigenvalues of a Linear Map Given a finite-dimensional vector space E, letf : E! E be any linear map. If, by luck, there is a basis (e 1,...,e
More informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More informationNOTES ON LINEAR ODES
NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary
More informationThe Principles of Quantum Mechanics: Pt. 1
The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
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 informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationGeneric rank-k perturbations of structured matrices
Generic rank-k perturbations of structured matrices Leonhard Batzke, Christian Mehl, André C. M. Ran and Leiba Rodman Abstract. This paper deals with the effect of generic but structured low rank perturbations
More informationMath 314H Solutions to Homework # 3
Math 34H Solutions to Homework # 3 Complete the exercises from the second maple assignment which can be downloaded from my linear algebra course web page Attach printouts of your work on this problem to
More information8 Extremal Values & Higher Derivatives
8 Extremal Values & Higher Derivatives Not covered in 2016\17 81 Higher Partial Derivatives For functions of one variable there is a well-known test for the nature of a critical point given by the sign
More informationModel reduction via tangential interpolation
Model reduction via tangential interpolation K. Gallivan, A. Vandendorpe and P. Van Dooren May 14, 2002 1 Introduction Although most of the theory presented in this paper holds for both continuous-time
More informationLINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS
LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts
More informationFurther linear algebra. Chapter IV. Jordan normal form.
Further linear algebra. Chapter IV. Jordan normal form. Andrei Yafaev In what follows V is a vector space of dimension n and B is a basis of V. In this chapter we are concerned with linear maps T : V V.
More informationFACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES
FACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES MARKO HUHTANEN AND ALLAN PERÄMÄKI Abstract A generic matrix A C n n is shown to be the product of circulant and diagonal matrices
More informationLinear algebra properties of dissipative Hamiltonian descriptor systems
Linear algebra properties of dissipative Hamiltonian descriptor systems C. Mehl V. Mehrmann M. Wojtylak January 6, 28 Abstract A wide class of matrix pencils connected with dissipative Hamiltonian descriptor
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
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 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 informationJordan Canonical Form of a Nilpotent Matrix. Math 422
Jordan Canonical Form of a Nilpotent Matrix Math Schur s Triangularization Theorem tells us that every matrix A is unitarily similar to an upper triangular matrix T However, the only thing certain at this
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationModern Control Systems
Modern Control Systems Matthew M. Peet Arizona State University Lecture 09: Observability Observability For Static Full-State Feedback, we assume knowledge of the Full-State. In reality, we only have measurements
More informationPositive Definite Matrix
1/29 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Positive Definite, Negative Definite, Indefinite 2/29 Pure Quadratic Function
More informationMathematical Optimisation, Chpt 2: Linear Equations and inequalities
Mathematical Optimisation, Chpt 2: Linear Equations and inequalities Peter J.C. Dickinson p.j.c.dickinson@utwente.nl http://dickinson.website version: 12/02/18 Monday 5th February 2018 Peter J.C. Dickinson
More informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationA Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources
A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels with Correlated Sources Wei Kang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College
More informationTHE JORDAN-FORM PROOF MADE EASY
THE JORDAN-FORM PROOF MADE EASY LEO LIVSHITS, GORDON MACDONALD, BEN MATHES, AND HEYDAR RADJAVI Abstract A derivation of the Jordan Canonical Form for linear transformations acting on finite dimensional
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationSpring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280
Math 307 Spring 2019 Exam 2 3/27/19 Time Limit: / Name (Print): Problem Points Score 1 15 2 20 3 35 4 30 5 10 6 20 7 20 8 20 9 20 10 20 11 10 12 10 13 10 14 10 15 10 16 10 17 10 Total: 280 Math 307 Exam
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationContour integral solutions of Sylvester-type matrix equations
Contour integral solutions of Sylvester-type matrix equations Harald K. Wimmer Mathematisches Institut, Universität Würzburg, 97074 Würzburg, Germany Abstract The linear matrix equations AXB CXD = E, AX
More information