On rank one perturbations of Hamiltonian system with periodic coefficients

Size: px
Start display at page:

Download "On rank one perturbations of Hamiltonian system with periodic coefficients"

Transcription

1 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 AROUNA G. Y. TRAORE Université FHB de Cocody-Abidjan UFR Maths-Info. BP 58 Abidjan, CÔTE D IVOIRE traorearounagogbeyves@yahoo.ca JEAN-CLAUDE KOUA BROU Université FHB de Cocody-Abidjan UFR Maths-Info. BP 58 Abidjan, CÔTE D IVOIRE k brou@hotmail.com Abstract: From a theory developed by C. Mehl, et al., a theory of the rank one perturbation of Hamiltonian systems with periodic coefficients is proposed. It is shown that the rank one perturbation of the fundamental solution of Hamiltonian system with periodic coefficients is solution of its rank one perturbation. Some results on the consequences of the strong stability of these types of systems on their rank one perturbation is proposed. Two numerical examples are given to illustrate this theory. Key Words: Eigenvalue, symplectic matrix, Hamiltonian system, Fundamental solutions, Perturbation. Introduction Let J, W R N N be two matrices such that J is nonsingular and skew-symmetric matrix. We say that the matrix W is J-symplectic (or J-orthogonal if W T JW = J. These types of matrices (socalled structured usually appear in control theory [,,, 5]: more precisely in optimal control [] and in the parametric resonance theory [, 5]. In these areas, these types of matrices are obtained as solutions of Hamiltonian systems with periodic coefficients. About these systems, that are differential equations with P -periodic coefficients of the below form J dx(t = H(tX(t, t R ( where J T = J, (H(t T = H(t = H(t + P. The fundamental solution X(t of ( i.e. the matrix function satisfying J dx(t = H(tX(t, t R + ( X( = I N is J-symplectic [,, 7, 5] and satisfies the relationship X(t + np = X(tX n (P, t R and n N. The solution of the system evaluated at the period is called the monodromy matrix of the system. The eigenvalues of this monodromy matrix are called the multipliers of system (. The following definition permits to classify the multiplies of Hamiltonian system Definition Let ρ be a semi-simple multiplier of ( lying on the unit circle. Then ρ is called a multiplier of the first (second kind if the quadratic form (ijx, x is positive (negative on the eigenspace associated with ρ. When (Jx, x =, then ρ is of mixed kind. In this definition, the notation (ijx, x stands for the Euclidean scalar product and i =. This other definition proposed by S. K. Godunov [, 5, 8, 9] gives another classification of the multipliers of ( Definition Let ρ be a semi-simple multiplier of ( lying on the unit circle. We say that ρ is of the red (green color or in short r-multiplier ( g- multiplier if (S x, x > (respectively (S x, x < on the eigenspace associated with ρ where S = (/ ( (JX(P T + (JX(P. If (S x, x =, we say that ρ is of mixed color. E-ISSN: Volume 5, 6

2 From Definition, Dosso and Sadkane obtained a result of strong stability of symplectic matrix (see [,, 6] Theorem A symplectic matrix is strong stability if and only if. all eigenvalues are on the unit circle ;. the eigenvalues are either red color or green color ;. the subspaces associated with these deux groups of the eigenvalues are well separated. Denote by P r and P g the spectral projectors associated with the r eigenvalues and g eigenvalues of the monodromy matrix X(P of ( and let us put and where S r := P T r S P r = S T r S g := P T g S P g = S T g S = (/ ( (X(P J + (X(P J T. We give the following theorem which gathers all assertions on the strong stability of Hamiltonian systems with periodic coefficients [, 6, 5]. Theorem Hamiltonian system ( is strongly stable if one of the following conditions is satisfied :. If there exists ϵ > such that any Hamiltonian system with P -periodic coefficients of the form J dx(t = H(tX(t and satisfying H H is stable. T H(t H(t < ϵ. The monodromy matrix W = X(P of system ( is strongly stable. (KGL criterion the multipliers of system ( are either of the first kind and either of second kind. The multipliers of the first kind and second kind of the monodromy matrix should be well separated i.e. the quantity { δ KGL (X(P = min e iθ k e iθ l e iθ k, e iθ l are multipliers of ( of different kinds } ( should not be close to zero.. the multipliers of system ( are either of the red color and either of the green color. The r- multipliers and g-multipliers of the monodromy matrix should be well separated i.e. the quantity { δ S (X(P = min e iθ k e iθ l e iθ k, e iθ l are r multpliers and g multipliers of (} ( should not be close to zero. 5. S r, S g and S r S g > 6. P r + P g = I and P T r S P g =. The paper is organized as follows. In Section we give some preliminaries and useful results to introduce the rank one perturbations of Hamiltonian systems with periodic coefficients. More specifically, this section explains what led us to rank one perturbations of Hamiltonian system with periodic coefficients. Section explains the concept of rank one perturbation of Hamiltonian systems with coefficients. In Section we analyze the consequences of strongly stable of Hamiltonian systems with periodic coefficients on its rank on perturbation. Section 5 is devoted to numerical tests. Finally some concluding remarks are summarized in Section 6 Throughout this paper, we denoted the identity and zero matrices of order k by I k and k respectively or just I and whenever it is clear from the context. The -norm of a matrix A is denoted by A. The transpose of a matrix (or vector U is denoted by U T. Rank one perturbation of symplectic matrices depending on a parameter Let W R N N be a J-symplectic matrix where J R N N is skew-symmetric matrix (i.e. J T = J[, ]. Definition 5 We call a rank one perturbation of the symplectic matrix W any matrix of the form W = (I + uu T JW where u is a non zero vector of R N. We recall in the following proposition some properties of rank one perturbations of symplectic matrices (see [6]. Proposition 6 Let W be a J-symplectic matrix.. Any rank one perturbation of W is J-symplectic.. The invertible of a rank one perturbation I + uu T J of identity matrix I is the matrix I uu T J. E-ISSN: Volume 5, 6

3 Proof: See [, 6] for the proof. Let u be a non zero vector of R N. Consider the following lemma Lemma 7 Consider the rank one perturbations W = (I+uu T JW of the J-symplectic matrix W. Then for any y R N, the quadratic form (S y, y is defined by (S y, y = ( S y, y φ(y (5 where and φ(y = S = ((J W + (J W T ( ((Juu T JW + (Juu T JW T y, y. Proof: Developing S, we have S = we deduct ( (JW + (JW T + [ (Juu T JW + (Juu T JW T ]. ( S y, y = (S y, y+ ([ (Juu T JW + (Juu T JW T ] y, y } {{} φ(y = (S y, y + φ(y Corollary 8 Let ρ be an eigenvalue of W of modulus and y an eigenvector associated with ρ. Then ρ is an eigenvalue of red color (respectively ( eigenvalue of green color if and only if S y, y > φ(y ( (respectively S y, y < φ(y. ( However if S y, y = φ(y, then ρ is of mixed color. Proof: According to lemma 7, we get (S y, y = ( S y, y φ(y From Definition, we have if ρ is an eigenvalue of red color, (S y, y > = ( S y, y > φ(y ; if ρ is an eigenvalue of green color, (S y, y < = ( S y, y < φ(y ; if ρ is an eigenvalue of mixed color, (S y, y = = ( S y, y = φ(y. We consider the following rank one perturbation of the fundamental solution X(t of ( X(t = (I + uu T X(t (6 then we have the following lemma Lemma 9 If X(t is a J-symplectic matrix function such that rank( X(t X(t =, t >, then there is a vector function u(t C N t > such that X(t = (I + u(tu(t T JX(t, t R Conversely, for any vector u(t C N, the matrix function X(t is J-symplectic. Proof: According to Lemma 7. of [, Section 7,p. 8], for all t >, there exists a vector u(t C N such that X(t = (I + u(tu(t T JX(t. Moreover, if X(t is J-symplectic, X(t is also J- symplectic. This Lemma leads us to introduce the concept of rank one perturbation of Hamiltonian systems with periodic coefficients. Now consider that the vector function is a vector constant. We give the following theorem which extend Theorem 7. of [, Section 7, p. 9] to matrizant of system (. Theorem Let J C N N be skew-symmetric and nonsingular matrix, (X(t t> fundamental solution of system ( and λ(t C an eigenvalue of X(t for all t >. Assume that X(t has the Jordan canonical form l j= J n (λ(t l j= J n (λ(t l m(t J nm(t (λ(t J (t, j= where n > > n m(t with m : R N a function of index such that the algebraic multiplicities is a(t = l n + + l m(t n m(t and J (t with σ(j (t C \ {λ(t} contains all Jordan blocks associated with eigenvalues different from λ(t. Furthermore, let u C N and B(t = uu T JX(t. E-ISSN: Volume 5, 6

4 ( If t >, λ(t {, }, then generically with respect to the components of u, the matrix X(t+ B(t has the Jordan canonical form l l J n (λ(t J n (λ(t j= j= l m(t J nm(t (λ(t J (t, j= (7 where J (t contains all the Jordan blocks of X(t + B(t associated with eigenvalues different from λ(t. ( If t >, verifying λ(t {+, }, we have (a if n is even, then generically with respect to the components of u, the matrix X(t + B(t has the Jordan canonical form l l J n (λ(t J n (λ(t j= j= l m(t J nm(t (λ(t J (t, j= where J (t contains all the Jordan of X(t + B(t associated with eigenvalues different from λ(t. (b if n is odd, then l is even and generically with respect to the components of u, the matrix X(t + B(t has the Jordan canonical form l J n+(λ(t J n (λ(t j= l m(t J nm(t (λ(t J (t, j= where J (t contains all the blocks of X(t + B(t associated with eigenvalues different from λ(t. Proof: For all t >, if λ(t {, }, we have decomposition (7 according to [, Theorem 7.]. Other hand, the number of Jordan blocks depend on the variation of t. Thus, this number is a function of index m : R + N. For the other two points (a and (b, we show in the same way that items ( and ( of Theorem 7. of [, Theorem 7.] since X(t + B(t is a constant matrix. In fact, the integers l,..., l m (t and indexes n,..., n m (t are not constant when t varies. The number of Jordan blocks and their sizes can vary in function of the variation of t. In Theorem, we consider the constant integers l k and n k k {,..., m(t} for an index m(t given. When t =, λ( = with m( = N and l k =, k. All Jordan blocks are reduced to. Rank one perturbations of Hamiltonian system with periodic coefficients Let u be a non zero and constant vector of R N. (X(t t the fundamental solution of system. We have the following proposition Proposition Consider the perturbed Hamiltonian system where J d X(t = [H(t + E(t] X(t (8 E(t = (Juu T H(t T + Juu T H(t +(uu T J T H(t(uu T J. Then X(t = (I + uu T JX(t is a solution of system (8. Proof: By derivation of X(t, we obtain : J d X(t = J(I + uu T JJ J dx(t =J(I + uu T JJ H(tX(t, according from system ( =[H(t + Juu T H(t]X(t =[H(t + Juu T H(t](I + uu T J X(t =[H(t + Juu T H(t](I uu T J X(t because (I + uu T J = (I uu T J (see [6] = [ H(t H(tuu T J + Juu T H(t = Juu T H(tuu T J ] X(t H(t + (JuuT H(t T + Juu T H(t + (uu T J T H(t(uu T J }{{} X(t E(t E-ISSN: Volume 5, 6

5 Hence the perturbed Hamiltonian equation (8 follows where E(t =(Juu T H(t T + Juu T H(t+ (uu T J T H(t(uu T J (9 We note that E(t is symmetric and P -periodic i.e. E(t T = E(t and E(t + P = E(t for all t. The following corollary gives us a simplified form of system (8 Corollary System (8 can be put at the form J d X(t = (I uu T J T H(t(I uu T J X(t, X( = I + uu T J ( Proof: Indeed, developing (I uu T J T H(t(I uu T J, we get (I uu T J T H(t(I uu T J = H(t + (J T uu T H(t T +J T uu T H(t+(uu T J T H(t(uu T J }{{} E(t and X( = (I + uu T JX( = I + uu T J. We give the following corollary Corollary Let (X(t t be the fundamental solution of system (. All solution X(t of perturbed system ( of system (, is of the form X(t = (I + uu T JX(t. Proof: From Proposition 8 if X(t is a solution of (, the perturbed matrix W (t = (I + uu T JX(t is a solution of (. Reciprocally, for any solution X(t de (, Let us put X(t = (I uu T J X(t where u is the vector defined in system (. Since (I + uu T J is inverse of the matrix (I uu T J (see [6], it holds that X(t = (I + uu T JX(t By replacing the expression of X(t in (, we obtain J(I + uu T J d X(t = (I uut J T H(tX(t J(I + uu T J d X(t = (I uut J T H(tX(t (I uu T J T J(I + uu T J d X(t =H(tX(t (I + uu T J T J(I + uu T J }{{} =J d X(t =H(tX(t J d X(t =H(tX(t and X( = (I uu T J X( = (I uu T J(I + uu T J = I. Consequently, X(t is the solution of (. From the foregoing, we give the following definition: Definition We call rank one perturbations of Hamiltonian system with periodic coefficients, any perturbation of the form ( of (. Consider the following canonical perturbed system taking I N at t =. J d W (t = (I uu T J T H(t(I uu T J W (t, W ( = I ( Consequence of the strong stability on rank one perturbations We give the following proposition which is a consequent of Corollary 8 Proposition 5 If a symplectic matrix W is strongly stable, then there exists a positif constant δ such that any vector ( u R N verifying uu T JW < δ, we have S y, y φ(y for any eigenvector y of W where S ( = (/ (J W + (J W with W = (I + uu T W. Proof: The strong stability of symplectic matrix W implies that the eigenvalues of W are either of red color or either of green color i.e. for any eigenvector y of W, we have (S y, y = ( S y, y φ(y using Corollary 8. This following Proposition gives us another consequence of the strong stability of W under small perturbation that preserve symplecticity. Proposition 6 If a symplectic matrix W is strongly stable, then there exists a positif constant δ such that any vector u R N verifies uu T JW < δ, we have W = (I + uu t JW is stable. Proof: If W is strongly stable, then there exists a positif constant δ such that any small perturbation W of W preserving its symplecticity verifying W W δ, is stable. In particulary, if the perturbation is a rank one perturbation with W of the form E-ISSN: Volume 5, 6

6 W + uu T JW, any vector u verifying uu T JW δ gives W stable. Hence we have this following result on the strong stability of the Hamiltonian systems with periodic coefficients Proposition 7 If Hamiltonian system with periodic coefficients ( is strongly stable, then there exists ε > such that for any vector u verifying E(t ε where E(t is defined in (9, rank one perturbation Hamiltonian system ( associated is stable. Proof: This proposition is a consequence of Theorem using system (8 of Proposition. On the other hand, if the unperturbed system is unstable, there exits a neighborhood in which any rank one perturbation of system ( remains unstable. Remark 8 The stability of any small rank one perturbation of a Hamiltonian system with periodic coefficients doesn t imply its strong stability because we are in a particular case of the perturbation of the system. However it can permit to study the behavior of multipliers of Hamiltonian systems with periodic coefficients. 5 Numerical examples Example 9 Consider the Mathieu equation J d y(t = (a + b sin(ty(t ( where a, b R (see [5, vol., p. ],[]. and Putting x(t = ( y dy H(t =, J = ( ( b sin t + a, we obtain the following canonical Hamiltonian Equation J dx(t = H(tX(t, t R, ( X( = I, where the matrix H(t is Hamiltonian and π-periodic. Let u R N N be a random vector in a neighborhood of the zero vector. Consider perturbed system ( of (. We show that the rank one perturbation of the fundamental solution is a solution of perturbed system (. Consider = X (t X (t, t where X (t = (I uu T JX(t and ( X (t t is the solution of system (. We show by numerical examples that (.5, t [, π]. For ( a = 7 and b =, consider the vector u =.89. In Figure, we consider a random.76 vector u which permits to perturb system ( by the vectors u, u, u and u. In this first figure, we note that.5. This shows that X (t = X (t for all t [, π] i.e. the rank one perturbation ( X (t t [,π] of the fundamental solution of system ( is equal to the solution ( X (t t [,π] of rank one perturbation system (. x a=7 and b= with u y=.5 x a=7 and b= with u y=.5 x a=7 and b= with u y=.5 x a=7 and b= with u y=.5 Figure : Comparison of two solutions However, unperturbed system ( is strongly stable. We remark that the rank one perturbed systems ( of ( is strongly stable for any vector belonging to { u, u, u, u }. Therefore they are stable. This justifies Proposition (7 For a = ( and b = 5,.565 consider the vector u =. In this.85 another example illustrated by Figure, we consider a random vector u which permits to perturb system ( by the vectors u, u, u and u. In figure, we note that.5. This shows that X (t = X (t for all t [, π]. E-ISSN: Volume 5, 6

7 x a= and b=5 with u y=.5 x a= and b=5 with u y=.5 x a= and b=5 with u y=.5 x a= and b=5 with u y=.5 Figure : Comparison of two solutions In this example, the unperturbed system being unstable, the rank one perturbation of the system { is unstable for any vector belonging to u, u, u, u }. This justifies the existence of a neighborhood of the unperturbed system in which any rank one perturbation of the system is unstable. Example Consider the system of differential equations ( see [9] and [5, Vil., p. ] q d η + p η + [aη cos γt + (b cos γt + c sin γtη ] = q d η + p η + gη sin 5γt =, d η q + p η + [(b cos γt + c sin γtη + gη sin 5γt] =, ( which can be reduced on the following canonical Hamiltonian system where x = J dx(t η dη ( I J = I = H(t, X( = I 6 (5, η = η q η q eta q, ( P (t, H(t = I, with P (t = p + a cos γt q b cos γγt+c sin γt q q p b cos γγt+c sin γt q q g sin 5γt q q q g sin 5γt p q q q. Let u R N be a random vector in a neighborhood of the zero vector. Consider perturbed system ( of (5. We show that the rank one perturbation of the fundamental solution of (5 is a solution of the rank one perturbation of the system. Consider = X (t X (t, t R where X (t = (I uu T JX(t and ( X (t t R is the solution of the rank one perturbation Hamiltonian system ( of (5. Figures and represent the norm of the difference between X et X. for ϵ = 5.5 and δ =, Let s take 5 u = Figure is obtained { for values of any vector taken in u, u, u, u }. In figure, we note that 5. This shows that X (t = X (t for all t [, π] i.e. the rank one perturbation ( X (t t [,π] of the fundamental solution of system (5 is equal to the solution ( X (t t [,π] of the rank one perturbation system of (5. x ε=5.5 and δ= with u 5 x ε=5.5 and δ= with u y=5 5 y=.5 y=.5 x ε=5.5 and δ= with u 5 x ε=5.5 and δ= with u y=.5 Figure : Comparison of two solutions However, unperturbed system (5 is strongly stable. We also note that the rank one perturbed systems ( of (5 is strongly stable for any vector belonging to { u, u, u, u }. Therefore they are stable. This justifies Proposition (7 E-ISSN: Volume 5, 6

8 ϵ = 5 and δ =, Let s take u = The following figures is obtained for any vector belonging to { u, u, u, u }. In figure, we also note that. This shows that X (t = X (t for all t [, π]. x ε=5 and δ= with u y= x ε=5 and δ= with u y= x ε=5 and δ= with u y= x ε=5 and δ= with u y= Figure : Comparisons of two solutions In this latter example, the unperturbed system is unstable and the rank one perturbation systems remain unstable for any vector belonging to { u, u, u, u }. This justifies the existence of a neighborhood of the unperturbed system in which any rank one perturbation of the system is unstable. 6 Conclusion From a theory developed by C. Mehl, et al., on the rank one perturbation of symplectic matrices (see [], we defined the rank one perturbation of Hamiltonian system of periodic coefficients. After an adaptation of some results of [] on symplectic matrices when they depend on a time parameter, we show that the rank one perturbation of the fundamental solution of a Hamiltonian system with periodic coefficients is solution of the rank one perturbation of the system. As result of this theory, we give a consequence of the strong stability on a small rank one perturbation of these Hamiltonian systems. Two numerical examples are given to illustrate this theory. In future work, we will study how to use the rank one perturbation of Hamiltonian system with periodic coefficients to analyze the behavior of their multipliers and also how this theory can analyze their strong stability? References: [] C. Brezinski, Computational Aspercts of Linear Control, Kluwer Academic Publishers,. [] M. Dosso, Sur quelques algorithms d analyse de stabilitĺę forte de matrices symplectiques, PHD Thesis (September 6, Universitĺę de Bretagne Occidentale. Ecole Doctorale SMIS, Laboratoire de Mathĺęmatiques, UFR Sciences et Techniques. [] M. Dosso, N. Coulibaly, An Analysis of the Behavior of Mulpliers of Hamiltonian System with periodic. Far East Journal of Mathematical Sciences. Vol. 99, Number, 6,. [] M. Dosso, N. Coulibaly, Symplectic matrices and strong stability of Hamiltonian systems with periodic coefficients. Journal of Mathematical Sciences : Advances and Applications. Vol. 8,, Pages 5 8. [5] M. Dosso, N. Coulibaly and L. Samassi, Strong stability of symplectic matrices using a spectral dichotomy method. Far East Journal of Applied Mathematics. Vol. 79, Number,, pp. 7. [6] M. Dosso and M. Sadkane. On the strong stability of symplectic matrices. Numerical Linear Algebra with Applications, ( (, 9. [7] M. Dosso, M. Sadkane, A spectral trichotomy method for symplectic matrices, Numer Algor. 5(9, 87 [8] S. K. Godunov, Verification of boundedness for the powers of symplectic matrices with the help of averaging, Siber. Math. J.,(99, [9] S. K. Godunov, M. Sadkane, Numerical determination of a canonical form of a symplectic matrix, Siberian Math. J. (, [] S. K. Godunov, M. Sadkane, Spectral analysis of symplectic matrices with application to the theory of parametric resonance, SIAM J. Matrix Anal. Appl. 8(6, [] B. Hassibi, A. H. Sayed, T. Kailath, Indefinite- Quadratic Estimation and Control, SIAM, Philadelphia, PA, 999. [] P. Lancaster, L. Rodman, Algebraic Riccati Equations, Clarendon Press, 995. [] C. Mehl, V. Mehrmann, A.C.M. Ran, and L. Rodman. Eigenvalue perturbation theory under generic rank one perturbations: Symplectic, orthogonal, and unitary matrices. BIT, 5(, E-ISSN: Volume 5, 6

9 [] C. Mehl, V. Mehrmann, A.C.M. Ran and L. Rodman. Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations. Linear Algebra Appl., 5(, [5] V. A. Yakubovich, V. M. Starzhinskii, Linear differential equations with periodic coefficients, Vol. &., Wiley, New York (975 [6] Qing-you Yan, The properties of a kind of random symplectic matrices. Applied mathematics and Mechanics, Vol, No 5, May. E-ISSN: Volume 5, 6

arxiv: v1 [math.na] 10 Dec 2017

arxiv: v1 [math.na] 10 Dec 2017 On a perturbation theory of Hamitonian systems with periodic coefficients Traoré G. Y. Arouna, Mouhamadou Dosso, Jean-Caude Koua Brou arxiv:7.v [math.na] Dec 7 Abstract A theory of rank k perturbation

More information

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 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 information

Definite 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 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 information

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Chapter 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 information

Generic rank-k perturbations of structured matrices

Generic 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 information

Perturbation 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 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 information

The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications

The 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 information

Linear Algebra: Matrix Eigenvalue Problems

Linear Algebra: Matrix Eigenvalue Problems CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given

More information

Finite dimensional indefinite inner product spaces and applications in Numerical Analysis

Finite 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 information

An SVD-Like Matrix Decomposition and Its Applications

An SVD-Like Matrix Decomposition and Its Applications An SVD-Like Matrix Decomposition and Its Applications Hongguo Xu Abstract [ A matrix S C m m is symplectic if SJS = J, where J = I m I m. Symplectic matrices play an important role in the analysis and

More information

Eigenvalue 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 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 information

On the Hermitian solutions of the

On the Hermitian solutions of the Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation

More information

1 Last time: least-squares problems

1 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 information

Chapter 3 Transformations

Chapter 3 Transformations Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases

More information

Extending Results from Orthogonal Matrices to the Class of P -orthogonal Matrices

Extending Results from Orthogonal Matrices to the Class of P -orthogonal Matrices Extending Results from Orthogonal Matrices to the Class of P -orthogonal Matrices João R. Cardoso Instituto Superior de Engenharia de Coimbra Quinta da Nora 3040-228 Coimbra Portugal jocar@isec.pt F. Silva

More information

Matrix functions that preserve the strong Perron- Frobenius property

Matrix 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 information

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

More information

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications

Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications L. Faybusovich T. Mouktonglang Department of Mathematics, University of Notre Dame, Notre Dame, IN

More information

Iyad T. Abu-Jeib and Thomas S. Shores

Iyad T. Abu-Jeib and Thomas S. Shores NEW ZEALAND JOURNAL OF MATHEMATICS Volume 3 (003, 9 ON PROPERTIES OF MATRIX I ( OF SINC METHODS Iyad T. Abu-Jeib and Thomas S. Shores (Received February 00 Abstract. In this paper, we study the determinant

More information

A note on the product of two skew-hamiltonian matrices

A note on the product of two skew-hamiltonian matrices A note on the product of two skew-hamiltonian matrices H. Faßbender and Kh. D. Ikramov October 13, 2007 Abstract: We show that the product C of two skew-hamiltonian matrices obeys the Stenzel conditions.

More information

A Note on Simple Nonzero Finite Generalized Singular Values

A 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 information

MASLOV INDEX. Contents. Drawing from [1]. 1. Outline

MASLOV 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 information

A 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 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 information

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system

Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Advances in Computational Mathematics 7 (1997) 295 31 295 Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Mihail Konstantinov a and Vera

More information

Positive definite preserving linear transformations on symmetric matrix spaces

Positive definite preserving linear transformations on symmetric matrix spaces Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,

More information

Linear Algebra using Dirac Notation: Pt. 2

Linear Algebra using Dirac Notation: Pt. 2 Linear Algebra using Dirac Notation: Pt. 2 PHYS 476Q - Southern Illinois University February 6, 2018 PHYS 476Q - Southern Illinois University Linear Algebra using Dirac Notation: Pt. 2 February 6, 2018

More information

Math 1553, Introduction to Linear Algebra

Math 1553, Introduction to Linear Algebra Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level

More information

The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix

The 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 information

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation

More information

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO 1 Adjoint of a linear operator Note: In these notes, V will denote a n-dimensional euclidean vector

More information

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,

More information

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation Zheng-jian Bai Abstract In this paper, we first consider the inverse

More information

A note on linear differential equations with periodic coefficients.

A 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 information

12x + 18y = 30? ax + by = m

12x + 18y = 30? ax + by = m Math 2201, Further Linear Algebra: a practical summary. February, 2009 There are just a few themes that were covered in the course. I. Algebra of integers and polynomials. II. Structure theory of one endomorphism.

More information

Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control

Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control Electronic Journal of Linear Algebra Volume 34 Volume 34 08) Article 39 08 Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control Christian Mehl Technische Universitaet

More information

Convergence Rate of Nonlinear Switched Systems

Convergence Rate of Nonlinear Switched Systems Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the

More information

Geometric control and dynamical systems

Geometric control and dynamical systems Université de Nice - Sophia Antipolis & Institut Universitaire de France 9th AIMS International Conference on Dynamical Systems, Differential Equations and Applications Control of an inverted pendulum

More information

Tutorials in Optimization. Richard Socher

Tutorials in Optimization. Richard Socher Tutorials in Optimization Richard Socher July 20, 2008 CONTENTS 1 Contents 1 Linear Algebra: Bilinear Form - A Simple Optimization Problem 2 1.1 Definitions........................................ 2 1.2

More information

The symmetric linear matrix equation

The symmetric linear matrix equation Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 8 00 The symmetric linear matrix equation Andre CM Ran Martine CB Reurings mcreurin@csvunl Follow this and additional works at: http://repositoryuwyoedu/ela

More information

Higher rank numerical ranges of rectangular matrix polynomials

Higher rank numerical ranges of rectangular matrix polynomials Journal of Linear and Topological Algebra Vol. 03, No. 03, 2014, 173-184 Higher rank numerical ranges of rectangular matrix polynomials Gh. Aghamollaei a, M. Zahraei b a Department of Mathematics, Shahid

More information

L<MON P QSRTP U V!WYX7ZP U

L<MON P QSRTP U V!WYX7ZP U ! "$# %'&'(*) +,+.-*)%0/21 3 %4/5)6#7#78 9*+287:;)

More information

ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION

ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION ISOLATED SEMIDEFINITE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATION Harald K. Wimmer 1 The set of all negative-semidefinite solutions of the CARE A X + XA + XBB X C C = 0 is homeomorphic

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

There are six more problems on the next two pages

There are six more problems on the next two pages Math 435 bg & bu: Topics in linear algebra Summer 25 Final exam Wed., 8/3/5. Justify all your work to receive full credit. Name:. Let A 3 2 5 Find a permutation matrix P, a lower triangular matrix L with

More information

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices Linear maps preserving rank of tensor products of matrices Journal: Manuscript ID: GLMA-0-0 Manuscript Type: Original Article Date Submitted by the Author: -Aug-0 Complete List of Authors: Zheng, Baodong;

More information

ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES

ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES HENDRA GUNAWAN AND OKI NESWAN Abstract. We discuss the notion of angles between two subspaces of an inner product space, as introduced by Risteski and

More information

8 Periodic Linear Di erential Equations - Floquet Theory

8 Periodic Linear Di erential Equations - Floquet Theory 8 Periodic Linear Di erential Equations - Floquet Theory The general theory of time varying linear di erential equations _x(t) = A(t)x(t) is still amazingly incomplete. Only for certain classes of functions

More information

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 Name: Exam Rules: This is a closed book exam. Once the exam

More information

Multiplicative Perturbation Bounds of the Group Inverse and Oblique Projection

Multiplicative Perturbation Bounds of the Group Inverse and Oblique Projection Filomat 30: 06, 37 375 DOI 0.98/FIL67M Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Multiplicative Perturbation Bounds of the Group

More information

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this

More information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018 MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S

More information

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1

More information

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom

Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear 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 information

A Brief Outline of Math 355

A 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 information

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ

More information

Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems

Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems Journal of Informatics Mathematical Sciences Volume 1 (2009), Numbers 2 & 3, pp. 91 97 RGN Publications (Invited paper) Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems

More information

Nonlinear palindromic eigenvalue problems and their numerical solution

Nonlinear 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 information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear 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 information

Examples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling

Examples 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 information

An Iterative Procedure for Solving the Riccati Equation A 2 R RA 1 = A 3 + RA 4 R. M.THAMBAN NAIR (I.I.T. Madras)

An Iterative Procedure for Solving the Riccati Equation A 2 R RA 1 = A 3 + RA 4 R. M.THAMBAN NAIR (I.I.T. Madras) An Iterative Procedure for Solving the Riccati Equation A 2 R RA 1 = A 3 + RA 4 R M.THAMBAN NAIR (I.I.T. Madras) Abstract Let X 1 and X 2 be complex Banach spaces, and let A 1 BL(X 1 ), A 2 BL(X 2 ), A

More information

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N. Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class

More information

Stability and Inertia Theorems for Generalized Lyapunov Equations

Stability and Inertia Theorems for Generalized Lyapunov Equations Published in Linear Algebra and its Applications, 355(1-3, 2002, pp. 297-314. Stability and Inertia Theorems for Generalized Lyapunov Equations Tatjana Stykel Abstract We study generalized Lyapunov equations

More information

Linear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011

Linear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011 Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the

More information

section it will become clear the strong connection between orthogonal solutions of the Moser-Veselov equation (1 and symmetric solutions of a particul

section it will become clear the strong connection between orthogonal solutions of the Moser-Veselov equation (1 and symmetric solutions of a particul The Moser-Veselov Equation J. R. Cardoso Λ Instituto Superior de Engenharia de Coimbra Quinta da Nora 3030 Coimbra Portugal jocar@sun.isec.pt F. Silva Leite y Departamento de Matemática Universidade de

More information

We describe the generalization of Hazan s algorithm for symmetric programming

We describe the generalization of Hazan s algorithm for symmetric programming ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,

More information

p q m p q p q m p q p Σ q 0 I p Σ 0 0, n 2p q

p q m p q p q m p q p Σ q 0 I p Σ 0 0, n 2p q A NUMERICAL METHOD FOR COMPUTING AN SVD-LIKE DECOMPOSITION HONGGUO XU Abstract We present a numerical method to compute the SVD-like decomposition B = QDS 1 where Q is orthogonal S is symplectic and D

More information

Improved Newton s method with exact line searches to solve quadratic matrix equation

Improved Newton s method with exact line searches to solve quadratic matrix equation Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan

More information

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p Math Bootcamp 2012 1 Review of matrix algebra 1.1 Vectors and rules of operations An p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the

More information

Definition (T -invariant subspace) Example. Example

Definition (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 information

Real Symmetric Matrices and Semidefinite Programming

Real Symmetric Matrices and Semidefinite Programming Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many

More information

CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS

CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS CHI-KWONG LI AND NUNG-SING SZE Abstract. Results on matrix canonical forms are used to give a complete description

More information

Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis

Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide

More information

Moore Penrose inverses and commuting elements of C -algebras

Moore Penrose inverses and commuting elements of C -algebras Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We

More information

LinGloss. A glossary of linear algebra

LinGloss. A glossary of linear algebra LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal

More information

University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm

University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions

More information

Periodic Linear Systems

Periodic Linear Systems Periodic Linear Systems Lecture 17 Math 634 10/8/99 We now consider ẋ = A(t)x (1) when A is a continuous periodic n n matrix function of t; i.e., when there is a constant T>0 such that A(t + T )=A(t) for

More information

Low Rank Perturbations of Quaternion Matrices

Low 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 information

Review of some mathematical tools

Review of some mathematical tools MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical

More information

16. Local theory of regular singular points and applications

16. Local theory of regular singular points and applications 16. Local theory of regular singular points and applications 265 16. Local theory of regular singular points and applications In this section we consider linear systems defined by the germs of meromorphic

More information

Exercise Set 7.2. Skills

Exercise Set 7.2. Skills Orthogonally diagonalizable matrix Spectral decomposition (or eigenvalue decomposition) Schur decomposition Subdiagonal Upper Hessenburg form Upper Hessenburg decomposition Skills Be able to recognize

More information

CONTROL SYSTEMS, ROBOTICS AND AUTOMATION - Vol. VII - System Characteristics: Stability, Controllability, Observability - Jerzy Klamka

CONTROL SYSTEMS, ROBOTICS AND AUTOMATION - Vol. VII - System Characteristics: Stability, Controllability, Observability - Jerzy Klamka SYSTEM CHARACTERISTICS: STABILITY, CONTROLLABILITY, OBSERVABILITY Jerzy Klamka Institute of Automatic Control, Technical University, Gliwice, Poland Keywords: stability, controllability, observability,

More information

A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem

A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Suares Problem Hongguo Xu Dedicated to Professor Erxiong Jiang on the occasion of his 7th birthday. Abstract We present

More information

MOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE

MOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE J. Appl. Math. & Computing Vol. 19(2005), No. 1-2, pp. 297-310 MOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE K. KAMARAJ AND K. C. SIVAKUMAR Abstract. The concept of the Moore-Penrose inverse

More information

ETNA Kent State University

ETNA Kent State University Electronic Transactions on Numerical Analysis Volume 38, pp 75-30, 011 Copyright 011, ISSN 1068-9613 ETNA PERTURBATION ANALYSIS FOR COMPLEX SYMMETRIC, SKEW SYMMETRIC, EVEN AND ODD MATRIX POLYNOMIALS SK

More information

Eigenvalues of rank one perturbations of matrices

Eigenvalues 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 information

arxiv: v1 [math.na] 1 Sep 2018

arxiv: v1 [math.na] 1 Sep 2018 On the perturbation of an L -orthogonal projection Xuefeng Xu arxiv:18090000v1 [mathna] 1 Sep 018 September 5 018 Abstract The L -orthogonal projection is an important mathematical tool in scientific computing

More information

Chap 3. Linear Algebra

Chap 3. Linear Algebra Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions

More information

Chap. 3. Controlled Systems, Controllability

Chap. 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 information

HW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.

HW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name. HW2 - Due 0/30 Each answer must be mathematically justified. Don t forget your name. Problem. Use the row reduction algorithm to find the inverse of the matrix 0 0, 2 3 5 if it exists. Double check your

More information

Lecture notes: Applied linear algebra Part 1. Version 2

Lecture notes: Applied linear algebra Part 1. Version 2 Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and

More information

c 2005 Society for Industrial and Applied Mathematics

c 2005 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. 27, No. 2, pp. 305 32 c 2005 Society for Industrial and Applied Mathematics JORDAN CANONICAL FORM OF THE GOOGLE MATRIX: A POTENTIAL CONTRIBUTION TO THE PAGERANK COMPUTATION

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA 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 information

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

1. 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 information

6 Linear Equation. 6.1 Equation with constant coefficients

6 Linear Equation. 6.1 Equation with constant coefficients 6 Linear Equation 6.1 Equation with constant coefficients Consider the equation ẋ = Ax, x R n. This equating has n independent solutions. If the eigenvalues are distinct then the solutions are c k e λ

More information

EIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..

EIGENVALUE 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 information

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017 Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

More information

On Solving Large Algebraic. Riccati Matrix Equations

On Solving Large Algebraic. Riccati Matrix Equations International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University

More information

Lecture Notes for Math 524

Lecture Notes for Math 524 Lecture Notes for Math 524 Dr Michael Y Li October 19, 2009 These notes are based on the lecture notes of Professor James S Muldowney, the books of Hale, Copple, Coddington and Levinson, and Perko They

More information

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP) MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m

More information