Eigenvalues of rank one perturbations of matrices
|
|
- Ami Long
- 6 years ago
- Views:
Transcription
1 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 Groenewald, Dawie Janse van Rensburg Rank one perturbations André Ran 1
2 and motivation Single input control system ẋ(t) = Ax(t) + Bu(t) y(t) = Cx(t) + Du(t) A is n n, B is n 1, C is m n, D is m 1. To find: a dynamic controller which stabilizes the system. Well known result: first construct a state observer, then a static feedback based on the observed state. Algorithm: find matrices R and F so that Focus on A + BF here. σ(a RC) C σ(a + BF) C. Rank one perturbations André Ran 2
3 Closed loop system The feedback is then u(t) = Fx(t). Closed loop feedback system: ẋ(t) = (A + BF)x(t) Eigenvalues of closed loop system matrix are σ(a + BF).. Failures in control system: changes in B (actuator failure). Rank one perturbations André Ran 3
4 European Robot Arm Artists impression of the attached to ISS. s elbow joint.
5 European Robot Arm A linearized version of a mathematical model for the movement of the elbow joint in the European Robotic Arm is given by ẋ(t) = x(t) + 4K 0 u(t) K y(t) = x(t) + 0 u(t) K is the motor torque constant of the motor operating the joint. Possible failure: Increase in K with about 1% per second for a short while, starting from K = 0.5. Rank one perturbations André Ran 4
6 Ten seconds failure Placing the eigenvalues of A + BF at 4.5, 5.5, 6.5, 7.5. Graph shows eigenvalues of closed loop system for values of K varying from 0.5 to Figure 3. Instability after 10 seconds. Rank one perturbations André Ran 5
7 Ten seconds failure II Placing the eigenvalues of A + BF at 20, 21, 22, 23, again for values of K varying from 0.5 to 0.55, we see that the system remains stable Figure 4. Stability. Rank one perturbations André Ran 6
8 statement Goal: to find explanation for the phenomenon observed here. Broader goal: A an n n real matrix, study the behaviour of eigenvalues of rank one perturbations A + tuv, where u and v are real n-vectors, and t R. Focus: u and v in R n generic. In other words: what is the generic behaviour of eigenvalues of rank one perturbations of A? Interest in several questions:, asymptotics for small t, asymptotics for large t, generic behaviour. Rank one perturbations André Ran 7
9 Let J n (λ) denote the standard n n upper triangular Jordan block with eigenvalues λ: J n (λ) = λ λ λ Rank one perturbations André Ran 8
10 Let J n (λ) denote the standard n n upper triangular Jordan block with eigenvalues λ: J n (λ) = λ λ λ General Jordan canonical form: Ordering of the sizes A = p j=1 κ j i=1 J n i,j (λ j ) n 1,j n 2,j n κj,j. Rank one perturbations André Ran 8
11 Example matrix with three eigenvalues: 0, 1, 2, with blocks of size 4, 4, 3, 1 corresponding to 0 5, 2 corresponding to 1 2 corresponding to 2 A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) Rank one perturbations André Ran 9
12 Example matrix with three eigenvalues: 0, 1, 2, with blocks of size 4, 4, 3, 1 corresponding to 0 5, 2 corresponding to 1 2 corresponding to 2 A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) What happens to the Jordan form when we apply a rank one perturbation? B(t) = A + tuv, where u, v R 21 and t R. Rank one perturbations André Ran 9
13 Example matrix with three eigenvalues: 0, 1, 2, with blocks of size 4, 4, 3, 1 corresponding to 0 5, 2 corresponding to 1 2 corresponding to 2 A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) What happens to the Jordan form when we apply a rank one perturbation? B(t) = A + tuv, where u, v R 21 and t R. What can we say about the eigenvalues as functions of t? Rank one perturbations André Ran 9
14 :. Beautiful result by L. Hörmander and A. Melin (1994) S.V. Savchenko (2003) F. Dopico and J. Moro (2003) Rank one perturbations André Ran 10
15 :. Beautiful result by L. Hörmander and A. Melin (1994) S.V. Savchenko (2003) F. Dopico and J. Moro (2003) Generically (in an algebraic sense) the of B(t) is as follows: Rank one perturbations André Ran 10
16 :. Beautiful result by L. Hörmander and A. Melin (1994) S.V. Savchenko (2003) F. Dopico and J. Moro (2003) Generically (in an algebraic sense) the of B(t) is as follows: for every eigenvalue of A only the largest Jordan block is lost, Rank one perturbations André Ran 10
17 :. Beautiful result by L. Hörmander and A. Melin (1994) S.V. Savchenko (2003) F. Dopico and J. Moro (2003) Generically (in an algebraic sense) the of B(t) is as follows: for every eigenvalue of A only the largest Jordan block is lost, all other eigenvalues are simple. Rank one perturbations André Ran 10
18 :. Beautiful result by L. Hörmander and A. Melin (1994) S.V. Savchenko (2003) F. Dopico and J. Moro (2003) Generically (in an algebraic sense) the of B(t) is as follows: for every eigenvalue of A only the largest Jordan block is lost, all other eigenvalues are simple. Also results for more general low rank perturbations. Rank one perturbations André Ran 10
19 Example In the example: A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) Rank one perturbations André Ran 11
20 Example In the example: A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) B(t) = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) Rank one perturbations André Ran 11
21 Example In the example: A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) B(t) = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) J 1 (t) J 2 (t) J 3 (t) Rank one perturbations André Ran 11
22 Example In the example: A = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) B(t) = J 4 (0) J 4 (0) J 3 (0) J 1 (0) J 5 (1) J 2 (1) J 2 (2) J 1 (t) J 2 (t) J 3 (t) where J 1 (t), J 2 (t), J 3 (t) are 4 4, 5 5, 2 2 matrices, generically (with respect to u, v and t) diagonalizable with disjoint spectra. Rank one perturbations André Ran 11
23 Comments on a proof A new proof (Mehl, Mehrmann, R., Rodman) uses a concept of systems theory: the Brunovski form. Given A, u and v, there is an invertible S such that S 1 AS is in Jordan canonical form, and simultaneously, v is in a nice form. Example. A = J 4 (0) J 3 (0), v = [ ] B = A + uv = u u u u u u u u u u u u u u Rank one perturbations André Ran 12
24 Example continued Rank one perturbations André Ran 13 B = A + uv = u u u u u u u u u u u u u u Jordan chain of lenght three for eigenvalue zero: B B B
25 : small t asymptotics. B(t) = A + tuv Well-known results for small t asymptotics of eigenvalues V.B. Lidskii (1966), M.I. Vishik and L.A. Lyusternik (1960), see also book T. Kato (Chapter 2). In the example A = J 4 (0) J 3 (0) small t asymptotics, blue t<0, red t> Rank one perturbations André Ran
26 : new eigenvalues The eigenvalues of B(t) = A + tuv which are not eigenvalues of A are nonderogatory for all t 0, and all vectors u and v. That is, corresponding to eigenvalues in σ(b(t)) \ σ(a) there is only one Jordan block. λ 0 σ(b(t)) \ σ(a) for some t 0 and some u and v, n = rank(a λ 0 I) rank (A + tuv λ 0 I) + rank(tuv ) = = rank (B(t) λ 0 I) + 1, So rank(b(t) λ 0 I) n 1, hence dim Ker (B(t) λ 0 I) 1. This says that λ 0 is a nonderogatory eigenvalue of B(t). Rank one perturbations André Ran 15
27 : large t asymptotics Define the polynomial p(λ) by B(t) = A + tuv. p(λ) = v m A (λ)(λ A) 1 u, where m A (λ) denotes the minimal polynomial of A. Let l denote the degree of p. Rank one perturbations André Ran 16
28 : large t asymptotics Define the polynomial p(λ) by B(t) = A + tuv. p(λ) = v m A (λ)(λ A) 1 u, where m A (λ) denotes the minimal polynomial of A. Let l denote the degree of p. Theorem As t ± the eigenvalues of B(t) which are not eigenvalues of A behave as follows as : exactly l 1 of them approximate the roots of p, and one goes to infinity, asymptotically along the ray in the complex plane going from zero through the number v u. Rank one perturbations André Ran 16
29 Example A = J 4 (0) J 3 (0) u and v random vectors in R 7 asymptotics of the eigenvalues in red (t>0) and cyan (t<0), roots of p in blue * Rank one perturbations André Ran 17
30 Example complex A = J 4 (0) J 3 (0) u and v random vectors in C 7 asymptotics of the eigenvalues in red/cyan, roots of p in blue*, asymptotic ray in black Rank one perturbations André Ran 18
31 Useful computation p B(t) (λ) = det(λi (A + tuv )) = det = det(λ A) det(i (λ A) 1 tuv ) = det(λ A)(1 tv (λ A) 1 u) = p A (λ) tv p A (λ)(λ A) 1 u. ( ) (λ A)(I (λ A) 1 tuv ) Rank one perturbations André Ran 19
32 Useful computation p B(t) (λ) = det(λi (A + tuv )) = det = det(λ A) det(i (λ A) 1 tuv ) = det(λ A)(1 tv (λ A) 1 u) = p A (λ) tv p A (λ)(λ A) 1 u. p B(t) and p A have a common divisor ( ) (λ A)(I (λ A) 1 tuv ) q(λ) = Π p i=1 Πk i j=2 (λ λ i) n i,j, we divide through by this expression. This yields p B(t) (λ) q(λ) = m A (λ) tv m A (λ)(λ A) 1 u = m A (λ) tp(λ). Rank one perturbations André Ran 19
33 No intersections Generically the eigenvalue curves do not intersect. Rank one perturbations André Ran 20
34 No intersections Generically the eigenvalue curves do not intersect. What means generically here???? Rank one perturbations André Ran 20
35 No intersections Generically the eigenvalue curves do not intersect. What means generically here???? Generically (in an algebraic sense) there is no triple eigenvalue: λ 0 is a triple eigenvalue if and only if m A (λ 0 ) tp(λ 0 ) = 0 m A(λ 0 ) tp (λ 0 ) = 0 m A(λ 0 ) tp (λ 0 ) = 0 Rank one perturbations André Ran 20
36 No intersections Generically the eigenvalue curves do not intersect. What means generically here???? Generically (in an algebraic sense) there is no triple eigenvalue: λ 0 is a triple eigenvalue if and only if m A (λ 0 ) tp(λ 0 ) = 0 m A(λ 0 ) tp (λ 0 ) = 0 m A(λ 0 ) tp (λ 0 ) = 0 Eliminate t from first equation, insert in second and third: λ 0 is a triple eigenvalue if and only if λ 0 is a common root of two polynomials. Use the resultant to see that generically this does not happen. Rank one perturbations André Ran 20
37 Example of triple crossing A = J 4 (0) J 1 (2) and tuning of u and v produces asymptotics of the eigenvalues in red/cyan, roots of p in blue,bifurcation points in blue Rank one perturbations André Ran 21
38 Double eigenvalues Complex case. Proposition Given A C n n and given u C n the set {v C n t R, z C \ σ(a) : z is a double eigenvalue of A + tuv } has empty interior. Rank one perturbations André Ran 22
39 Double eigenvalues Complex case. Proposition Given A C n n and given u C n the set {v C n t R, z C \ σ(a) : z is a double eigenvalue of A + tuv } has empty interior. So, generically (in a topological sense) there are no double eigenvalues. Rank one perturbations André Ran 22
40 Double eigenvalues Complex case. Proposition Given A C n n and given u C n the set {v C n t R, z C \ σ(a) : z is a double eigenvalue of A + tuv } has empty interior. So, generically (in a topological sense) there are no double eigenvalues. 2 asymptotics of the eigenvalues in red/cyan, roots of p in blue*, asymptotic ray in black Rank one perturbations André Ran 22
41 Double eigenvalues Real case. Proposition Given A R n n and given u R n the set { v R n t R, z C \ (σ(a) R) : z is a double eigenvalue of A + tuv } has empty interior. Rank one perturbations André Ran 23
42 Double eigenvalues Real case. Proposition Given A R n n and given u R n the set { v R n t R, z C \ (σ(a) R) : z is a double eigenvalue of A + tuv } has empty interior. So, generically (in a topological sense) there are no non-real double eigenvalues. Rank one perturbations André Ran 23
43 Double eigenvalues Real case. Proposition Given A R n n and given u R n the set { v R n t R, z C \ (σ(a) R) : z is a double eigenvalue of A + tuv } has empty interior. So, generically (in a topological sense) there are no non-real double eigenvalues. asymptotics of the eigenvalues in red/cyan, roots of p in blue*,bifurcation points in blue o Rank one perturbations André Ran 23
44 The story becomes more interesting when structure comes into play. Rank one perturbations André Ran 24
45 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Rank one perturbations André Ran 24
46 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? Rank one perturbations André Ran 24
47 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. Rank one perturbations André Ran 24
48 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. Rank one perturbations André Ran 24
49 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. In R n let H = H be invertible, let A be real and H-Hamiltonian, that is HA = A H. (MMRR) Rank one perturbations André Ran 24
50 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. In R n let H = H be invertible, let A be real and H-Hamiltonian, that is HA = A H. (MMRR) Surprising extra results! Rank one perturbations André Ran 24
51 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. In R n let H = H be invertible, let A be real and H-Hamiltonian, that is HA = A H. (MMRR) Surprising extra results! Curious? Rank one perturbations André Ran 24
52 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. In R n let H = H be invertible, let A be real and H-Hamiltonian, that is HA = A H. (MMRR) Surprising extra results! Curious? Go and listen to Christian Mehl! Rank one perturbations André Ran 24
53 The story becomes more interesting when structure comes into play. In C n let H = H be invertible, let A be H-selfadjoint. Rank-one perturbations studied by de Snoo, Winkler, Wojtylak in Π 1 case. Curious? See Michał Wojtylak s talk. General case studied by Mehl, Mehrmann, R., Rodman. Also the real case. In R n let H = H be invertible, let A be real and H-Hamiltonian, that is HA = A H. (MMRR) Surprising extra results! Curious? Go and listen to Christian Mehl! Here we discuss the H-positive real case. H = H real and invertible, A real and HA + A T H 0. Rank one perturbations André Ran 24
54 H-positive real matrices H = H, HA + A H 0. Consider rank one perturbations A + tuv, where uv is H-positive real. Joint work with Dawie Janse van Rensburg, Jan Fourie and Gilbert Groenewald. Rank one perturbations André Ran 25
55 H-positive real matrices H = H, HA + A H 0. Consider rank one perturbations A + tuv, where uv is H-positive real. Joint work with Dawie Janse van Rensburg, Jan Fourie and Gilbert Groenewald. Proposition A rank one matrix uv is H-positive real if and only if v = c u H for some c > 0. Rank one perturbations André Ran 25
56 H-positive real matrices H = H, HA + A H 0. Consider rank one perturbations A + tuv, where uv is H-positive real. Joint work with Dawie Janse van Rensburg, Jan Fourie and Gilbert Groenewald. Proposition A rank one matrix uv is H-positive real if and only if v = c u H for some c > 0. H-positive real rank one perturbations of H-positive real matrices. Rank one perturbations André Ran 25
57 H-positive real matrices H = H, HA + A H 0. Consider rank one perturbations A + tuv, where uv is H-positive real. Joint work with Dawie Janse van Rensburg, Jan Fourie and Gilbert Groenewald. Proposition A rank one matrix uv is H-positive real if and only if v = c u H for some c > 0. H-positive real rank one perturbations of H-positive real matrices. Theorem Put B(t) = A + tuu H, with t > 0. Then (σ(b(t)) \ σ(a)) ir =. Rank one perturbations André Ran 25
58 Example Theorem in words: the new eigenvalues of B(t) aren t on the pure imaginary axis. Example: J = γ I γ I 2, γ = 0 0 γ [ ] 0 2, H = I 2 0 I 2 0 I Rank one perturbations André Ran 26
59 Example Theorem in words: the new eigenvalues of B(t) aren t on the pure imaginary axis. Example: J = γ I γ I 2, γ = 0 0 γ 3 [ ] 0 2, H = 2 0 blue is unstructured rank one perturbation, red is positive real perturbation 0 0 I 2 0 I 2 0 I Rank one perturbations André Ran 26
60 Asymptotics But: Rank one perturbations André Ran 27
61 Asymptotics But: asymptotically the eigenvalues may be on the imaginary line. Rank one perturbations André Ran 27
62 Asymptotics But: asymptotically the eigenvalues may be on the imaginary line. asymptotics of the eigenvalues, two blocks size 3, eigenvalue Rank one perturbations André Ran 27
63 Chr. Mehl, V. Mehrmann, A.C.M. Ran, L. Rodman. Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations LAA 2010, to appear. Chr. Mehl, V. Mehrmann, A.C.M. Ran, L. Rodman. Perturbation theory of selfadjoint matrices and sign characteristics under generic structured rank one perturbations LAA 2010, to appear. Works with M. Wojtylak and D.B. Janse van Rensburg, J.H. Fourie and G.J. Groenewald reported on here are in preparation. Rank one perturbations André Ran 28
64 Thompson, Robert C. Invariant factors under rank one perturbations. Canad. J. Math. 32 (1980), no. 1, L. Hörmander, and A. Melin. A remark on perturbations of compact operators. Math. Scand 75 (1994), F. Dopico and J. Moro. Low rank perturbation of, SIAM J. Matrix Anal. Appl., 25, (2003), Savchenko, S. V. On a generic change in the spectral properties under perturbation by an operator of rank one. (Russian) Mat. Zametki 74 (2003), no. 4, ; translation in Math. Notes 74 (2003), no. 3 4, Savchenko, S. V. On the change in the spectral properties of a matrix under a perturbation of a sufficiently low rank. (Russian) Funktsional. Anal. i Prilozhen. 38 (2004), no. 1, 85 88; translation in Funct. Anal. Appl. 38 (2004), no. 1, Rank one perturbations André Ran 29
65 Thank you for your attention! Rank one perturbations André Ran 30
Eigenvalue 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 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 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 informationKey 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 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 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 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 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 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 informationEigenvalue perturbation theory of structured real matrices and their sign characteristics under generic structured rank-one perturbations
Eigenvalue perturbation theory of structured real matrices and their sign characteristics under generic structured rank-one perturbations Christian Mehl Volker Mehrmann André C. M. Ran Leiba Rodman April
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 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 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 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 informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
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 informationELA
RANGES OF SYLVESTER MAPS AND A MNMAL RANK PROBLEM ANDRE CM RAN AND LEBA RODMAN Abstract t is proved that the range of a Sylvester map defined by two matrices of sizes p p and q q, respectively, plus matrices
More informationEL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)
EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the
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 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 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 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 informationMath 121 Practice Final Solutions
Math Practice Final Solutions December 9, 04 Email me at odorney@college.harvard.edu with any typos.. True or False. (a) If B is a 6 6 matrix with characteristic polynomial λ (λ ) (λ + ), then rank(b)
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationN-WEAKLY SUPERCYCLIC MATRICES
N-WEAKLY SUPERCYCLIC MATRICES NATHAN S. FELDMAN Abstract. We define an operator to n-weakly hypercyclic if it has an orbit that has a dense projection onto every n-dimensional subspace. Similarly, an operator
More informationCAAM 335 Matrix Analysis
CAAM 335 Matrix Analysis Solutions to Homework 8 Problem (5+5+5=5 points The partial fraction expansion of the resolvent for the matrix B = is given by (si B = s } {{ } =P + s + } {{ } =P + (s (5 points
More information(VI.D) Generalized Eigenspaces
(VI.D) Generalized Eigenspaces Let T : C n C n be a f ixed linear transformation. For this section and the next, all vector spaces are assumed to be over C ; in particular, we will often write V for C
More informationQuadratic Matrix Polynomials
Research Triangularization Matters of Quadratic Matrix Polynomials February 25, 2009 Nick Françoise Higham Tisseur Director School of of Research Mathematics The University of Manchester School of Mathematics
More informationIdentification Methods for Structural Systems
Prof. Dr. Eleni Chatzi System Stability Fundamentals Overview System Stability Assume given a dynamic system with input u(t) and output x(t). The stability property of a dynamic system can be defined from
More informationOn rank one perturbations of Hamiltonian system with periodic coefficients
On rank one perturbations of Hamiltonian system with periodic coefficients MOUHAMADOU DOSSO Université FHB de Cocody-Abidjan UFR Maths-Info., BP 58 Abidjan, CÔTE D IVOIRE mouhamadou.dosso@univ-fhb.edu.ci
More information22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices
m:33 Notes: 7. Diagonalization of Symmetric Matrices Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman May 3, Symmetric matrices Definition. A symmetric matrix is a matrix
More informationControl for Coordination of Linear Systems
Control for Coordination of Linear Systems André C.M. Ran Department of Mathematics, Vrije Universiteit De Boelelaan 181a, 181 HV Amsterdam, The Netherlands Jan H. van Schuppen CWI, P.O. Box 9479, 19 GB
More informationLinear Algebra 2 More on determinants and Evalues Exercises and Thanksgiving Activities
Linear Algebra 2 More on determinants and Evalues Exercises and Thanksgiving Activities 2. Determinant of a linear transformation, change of basis. In the solution set of Homework 1, New Series, I included
More informationInvariance properties in the root sensitivity of time-delay systems with double imaginary roots
Invariance properties in the root sensitivity of time-delay systems with double imaginary roots Elias Jarlebring, Wim Michiels Department of Computer Science, KU Leuven, Celestijnenlaan A, 31 Heverlee,
More informationDepartment of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections (4.1),
Department of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections (4.1), 4.-4.6 1. Find the polynomial function with zeros: -1 (multiplicity ) and 1 (multiplicity ) whose graph passes
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 information= W z1 + W z2 and W z1 z 2
Math 44 Fall 06 homework page Math 44 Fall 06 Darij Grinberg: homework set 8 due: Wed, 4 Dec 06 [Thanks to Hannah Brand for parts of the solutions] Exercise Recall that we defined the multiplication of
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 informationOperators with numerical range in a closed halfplane
Operators with numerical range in a closed halfplane Wai-Shun Cheung 1 Department of Mathematics, University of Hong Kong, Hong Kong, P. R. China. wshun@graduate.hku.hk Chi-Kwong Li 2 Department of Mathematics,
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationProblem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show
MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationControl Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli
Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)
More informationSquare Roots of Real 3 3 Matrices vs. Quartic Polynomials with Real Zeros
DOI: 10.1515/auom-2017-0034 An. Şt. Univ. Ovidius Constanţa Vol. 25(3),2017, 45 58 Square Roots of Real 3 3 Matrices vs. Quartic Polynomials with Real Zeros Nicolae Anghel Abstract There is an interesting
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationA Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1
International Mathematical Forum, Vol, 06, no 3, 599-63 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/0988/imf0668 A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors Ricardo
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
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 informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationGeometric Control of Patterned Linear Systems
Geometric Control of Patterned Linear Systems Sarah C Hamilton and Mireille E Broucke Abstract We introduce and study a new class of linear control systems called patterned systems Mathematically, this
More informationEE363 homework 7 solutions
EE363 Prof. S. Boyd EE363 homework 7 solutions 1. Gain margin for a linear quadratic regulator. Let K be the optimal state feedback gain for the LQR problem with system ẋ = Ax + Bu, state cost matrix Q,
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions
Linear Algebra (MATH 4) Spring 2 Final Exam Practice Problem Solutions Instructions: Try the following on your own, then use the book and notes where you need help. Afterwards, check your solutions with
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
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 informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More informationAnalytic roots of invertible matrix functions
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 15 2005 Analytic roots of invertible matrix functions Leiba X. Rodman lxrodm@math.wm.edu Ilya M. Spitkovsky Follow this and additional
More informationFinite dimensional indefinite inner product spaces and applications in Numerical Analysis
Finite dimensional indefinite inner product spaces and applications in Numerical Analysis Christian Mehl Technische Universität Berlin, Institut für Mathematik, MA 4-5, 10623 Berlin, Germany, Email: mehl@math.tu-berlin.de
More informationMatrix functions that preserve the strong Perron- Frobenius property
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 18 2015 Matrix functions that preserve the strong Perron- Frobenius property Pietro Paparella University of Washington, pietrop@uw.edu
More informationAfter we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that
7.3 FINDING THE EIGENVECTORS OF A MATRIX After we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that A v = λ v or (λi n A) v = 0 In other words, we have to find
More informationEE263: Introduction to Linear Dynamical Systems Review Session 5
EE263: Introduction to Linear Dynamical Systems Review Session 5 Outline eigenvalues and eigenvectors diagonalization matrix exponential EE263 RS5 1 Eigenvalues and eigenvectors we say that λ C is an eigenvalue
More informationPOLYNOMIAL EQUATIONS OVER MATRICES. Robert Lee Wilson. Here are two well-known facts about polynomial equations over the complex numbers
POLYNOMIAL EQUATIONS OVER MATRICES Robert Lee Wilson Here are two well-known facts about polynomial equations over the complex numbers (C): (I) (Vieta Theorem) For any complex numbers x,..., x n (not necessarily
More information21 Linear State-Space Representations
ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may
More informationDistance bounds for prescribed multiple eigenvalues of matrix polynomials
Distance bounds for prescribed multiple eigenvalues of matrix polynomials Panayiotis J Psarrakos February 5, Abstract In this paper, motivated by a problem posed by Wilkinson, we study the coefficient
More informationLinear Algebra problems
Linear Algebra problems 1. Show that the set F = ({1, 0}, +,.) is a field where + and. are defined as 1+1=0, 0+0=0, 0+1=1+0=1, 0.0=0.1=1.0=0, 1.1=1.. Let X be a non-empty set and F be any field. Let X
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationECE 602 Exam 2 Solutions, 3/23/2011.
NAME: ECE 62 Exam 2 Solutions, 3/23/211. You can use any books or paper notes you wish to bring. No electronic devices of any kind are allowed. You can only use materials that you bring yourself. You are
More informationComputing Unstructured and Structured Polynomial Pseudospectrum Approximations
Computing Unstructured and Structured Polynomial Pseudospectrum Approximations Silvia Noschese 1 and Lothar Reichel 2 1 Dipartimento di Matematica, SAPIENZA Università di Roma, P.le Aldo Moro 5, 185 Roma,
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
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 informationarxiv: v2 [math.oa] 21 Nov 2010
NORMALITY OF ADJOINTABLE MODULE MAPS arxiv:1011.1582v2 [math.oa] 21 Nov 2010 K. SHARIFI Abstract. Normality of bounded and unbounded adjointable operators are discussed. Suppose T is an adjointable operator
More informationMath 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:
Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =
More informationPRODUCT OF OPERATORS AND NUMERICAL RANGE
PRODUCT OF OPERATORS AND NUMERICAL RANGE MAO-TING CHIEN 1, HWA-LONG GAU 2, CHI-KWONG LI 3, MING-CHENG TSAI 4, KUO-ZHONG WANG 5 Abstract. We show that a bounded linear operator A B(H) is a multiple of a
More informationNormality of adjointable module maps
MATHEMATICAL COMMUNICATIONS 187 Math. Commun. 17(2012), 187 193 Normality of adjointable module maps Kamran Sharifi 1, 1 Department of Mathematics, Shahrood University of Technology, P. O. Box 3619995161-316,
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7
Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)
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 informationSYSTEMTEORI - ÖVNING Stability of linear systems Exercise 3.1 (LTI system). Consider the following matrix:
SYSTEMTEORI - ÖVNING 3 1. Stability of linear systems Exercise 3.1 (LTI system. Consider the following matrix: ( A = 2 1 Use the Lyapunov method to determine if A is a stability matrix: a: in continuous
More informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationLinear Algebra. P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015 The objective of this exercise is to assess
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 informationMAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:
MAC Module Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to: Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
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 informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More informationStationary trajectories, singular Hamiltonian systems and ill-posed Interconnection
Stationary trajectories, singular Hamiltonian systems and ill-posed Interconnection S.C. Jugade, Debasattam Pal, Rachel K. Kalaimani and Madhu N. Belur Department of Electrical Engineering Indian Institute
More informationThis is a closed book exam. No notes or calculators are permitted. We will drop your lowest scoring question for you.
Math 54 Fall 2017 Practice Exam 2 Exam date: 10/31/17 Time Limit: 80 Minutes Name: Student ID: GSI or Section: This exam contains 7 pages (including this cover page) and 7 problems. Problems are printed
More informationAN ESTIMATE OF GREEN S FUNCTION OF THE PROBLEM OF BOUNDED SOLUTIONS IN THE CASE OF A TRIANGULAR COEFFICIENT
AN ESTIMATE OF GREEN S FUNCTION OF THE PROBLEM OF BOUNDED SOLUTIONS IN THE CASE OF A TRIANGULAR COEFFICIENT V. G. KURBATOV AND I.V. KURBATOVA arxiv:90.00792v [math.na] 3 Jan 209 Abstract. An estimate of
More informationEigenvalues, Eigenvectors and the Jordan Form
EE/ME 701: Advanced Linear Systems Eigenvalues, Eigenvectors and the Jordan Form Contents 1 Introduction 3 1.1 Review of basic facts about eigenvectors and eigenvalues..... 3 1.1.1 Looking at eigenvalues
More informationMath 4242 Fall 2016 (Darij Grinberg): homework set 8 due: Wed, 14 Dec b a. Here is the algorithm for diagonalizing a matrix we did in class:
Math 4242 Fall 206 homework page Math 4242 Fall 206 Darij Grinberg: homework set 8 due: Wed, 4 Dec 206 Exercise Recall that we defined the multiplication of complex numbers by the rule a, b a 2, b 2 =
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 informationCommuting nilpotent matrices and pairs of partitions
Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and
More informationAUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Introduction to Automatic Control & Linear systems (time domain)
1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Introduction to Automatic Control & Linear systems (time domain) 2 What is automatic control? From Wikipedia Control theory is an interdisciplinary
More informationDecentralized control with input saturation
Decentralized control with input saturation Ciprian Deliu Faculty of Mathematics and Computer Science Technical University Eindhoven Eindhoven, The Netherlands November 2006 Decentralized control with
More informationECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67
1/67 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 6 Mathematical Representation of Physical Systems II State Variable Models for Dynamic Systems u 1 u 2 u ṙ. Internal Variables x 1, x 2 x n y 1 y 2. y m Figure
More informationOn the closures of orbits of fourth order matrix pencils
On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action
More information