c 1998 Society for Industrial and Applied Mathematics

Size: px
Start display at page:

Download "c 1998 Society for Industrial and Applied Mathematics"

Transcription

1 SIAM J MARIX ANAL APPL Vol 20, No 1, pp c 1998 Society for Industrial and Applied Mathematics POSIIVIY OF BLOCK RIDIAGONAL MARICES MARIN BOHNER AND ONDŘEJ DOŠLÝ Abstract his paper relates disconjugacy of linear Hamiltonian difference systems LHdS and hence positive definiteness of certain discrete quadratic functionals to positive definiteness of some bloc tridiagonal matrices associated with these systems and functionals As a special case of a Hamiltonian system, Sturm Liouville difference equations are considered, and analogous results are obtained for these important objects Key words linear Hamiltonian difference system, Sturm Liouville difference equation, bloc tridiagonal matrix, discrete quadratic functional AMS subject classifications 15A09, 15A63, 39A10, 39A12 PII S Introduction he aim of this paper is to relate disconjugacy of linear Hamiltonian difference systems LHdS H x A x +1 + B u, u C x +1 A u and hence positivity of the discrete quadratic functional F Fx, u u B u + x } +1C x +1 0 to positive definiteness of a certain bloc tridiagonal symmetric matrix associated with H and F Here A, B, C are sequences of real n n matrices such that 1 I A are invertible and B,C are symmetric for all N 0 o introduce our problem in more detail, we first recall the relation of disconjugacy of linear Hamiltonian systems both differential and difference to positivity of corresponding quadratic functionals and to solvability of the associated Riccati matrix equation A statement of this ind is usually called a Reid roundabout theorem Proposition 11 [4, 6, 7] Consider the linear Hamiltonian differential system H x Atx + Btu, u Ctx A tu, where A, B, C : I [a, b] R n n are continuous real n n matrix valued functions such that Bt,Ct are symmetric and Bt is positive semidefinite for all t [a, b], and suppose that this system is identically normal in I, ie, the only solution x, u of H for which x 0 on some nondegenerate subinterval of I is the trivial solution x, u 0, 0 hen the following statements are equivalent Received by the editors March 19, 1997; accepted for publication in revised form by U Helme March 9, 1998; published electronically September 23, San Diego State University, Department of Mathematics, 5500 Campanile Dr, San Diego, CA bohner@saturnsdsuedu he research of this author was supported by the Alexander von Humboldt Foundation Masary University, Department of Mathematics, Janáčovo Nám 2A, CZ Brno, Czech Republic dosly@mathmunicz he research of this author was supported by grant 201/96/0401 of the Czech Grant Agency 182

2 BLOCK RIDIAGONAL MARICES 183 i System H is disconjugate in I, ie, the 2n n matrix solution X U of H given by the initial condition Xa 0, Ua I has no focal point in I, ie, det Xt 0in a, b] ii he quadratic functional F b [ Fx, u u tbtut+x tctxt ] dt a is positive for every x, u : I R n satisfying x Atx + Btu, xa 0 xb and x 0 in I iii here exists a symmetric solution Q : I R n n of the Riccati matrix differential equation R Q + A tq + QAt+QBtQ Ct 0 In the last decade, a considerable effort has been made to find a discrete analogue of this statement; see [1] and the references given therein Finally, this problem was resolved in [2] and the discrete Roundabout heorem reads as follows Proposition 12 [1, 2] Assume 1 hen the following statements are equivalent i System H is disconjugate in the discrete interval J : [0,N] N 0, N N, ie, the 2n n matrix solution X U of H given by the initial condition X 0 0, U 0 I has no focal point in J : [0,N +1] N 0, ie, Ker X +1 Ker X and D X X +1 I A 1 B 0 Here Ker and stand for the ernel and the Moore Penrose generalized inverse of the matrix indicated, respectively, and the matrix inequality stands for nonnegative definiteness ii he discrete quadratic functional F is positive for every x, u :J R n satisfying x A x +1 + B u, x and x 0 in J iii here exist symmetric matrices Q : J R n n such that I + BQ are invertible, I + BQ 1 B 0 in J, and solve the discrete Riccati matrix difference equation R Q +1 C +I A Q I + B Q 1 I A 1 he main difference between continuous and discrete functionals F and F is that the space of x, u appearing in the discrete quadratic functional has finite dimension his suggests investigating positivity of F not only via oscillation properties of H and solvability of R as given in the roundabout theorem which are typical methods for an infinite-dimensional treatment, but also via linear algebra and matrix theory he main idea of this approach can be illustrated in the case of the Sturm-Liouville equation 2 r y +p y +1 0 and the corresponding quadratic functional 3 as follows J y r y 2 + p y+1} 2 0

3 184 MARIN BOHNER AND ONDŘEJ DOŠLÝ Expanding the differences in J, for any y y } N+1 0 satisfying 4 y 0 0+1, we have J y r + p y+1 2 2r y y +1 + r y} 2 0 y 1 β 0 r 1 r 1 β 1 rn 1 r N 1 β N 1 where β r + p + r +1 Hence J y > 0 for any nontrivial y R N+2 satisfying 4 iff the matrix L : β 0 r 1 r 1 β 1 rn 1 y 1, r N 1 β N 1 is positive definite From the elementary course of linear algebra it is nown that L is positive definite iff all its principal minors 1 β 0, 2 β 0 β 1 r 2 1,, N det L are positive On the other hand, by i of Proposition 12 we have J y > 0 for any nontrivial y satisfying 4 iff the solution ỹ of 2 given by the initial condition ỹ 0 0,ỹ 1 1 r 0 satisfies 5 ỹ +1 0 and δ : ỹ r ỹ +1 0, 0,,N Using Laplace s rule for computation of determinants, we have the formula 6 β 1 1 r Expanding the forward differences in 2 we have y +2 1 r +1 [β y +1 r y ] his recurrent formula, coupled with 6 and the initial condition ỹ 0 0,ỹ 1 1 r 0, gives ỹ 2 β 0 1, ỹ 3 1 [ β0 β 1 r 2 ] 2 1, r 1 r 0 r 1 r 0 r 2 r 1 r 0 r 2 r 1 r 0 and by induction ỹ +1 1 [ β 1 1 r 2 ] r r 2 r 1 r r r 2 r 1 r 0

4 BLOCK RIDIAGONAL MARICES 185 Consequently, 7 δ ỹ r ỹ +1 1, 0 : 1 Now, by the Jacobi diagonalization method, there exists an N N triangular matrix M such that M LM diagδ 1,,δ N } From the last identity one may easily see why the quantities δ come to play in the definition of disconjugacy of 2 In this paper we establish a similar identity relating the quadratic functional F and the matrices D from Proposition 12 his identity reveals why the matrices D appear in the definition of disconjugacy of H In particular, we find a bloc triangular matrix M such that M LM diagd 1,,D N }, where L in this identity is the matrix representing the functional F see heorem 22 in the next section and D are given in i of Proposition 12 he paper is organized as follows he next section is devoted to preliminary results We recall some basic properties of solutions of H, and we also show the relation between higher order Sturm Liouville difference equations and LHdS H he main results of the paper, the equivalence of positive definiteness of a bloc tridiagonal matrix to nonnegative definiteness of certain matrices constructed via solutions of H which reduce to δ in the scalar case are given in section 3 In the last section we deal with LHdS H which correspond to higher order Sturm Liouville equations; here the results of the previous section are simplified considerably he statements of section 4 complement results of [3, 5] 2 Preliminary results Subject to our general assumption 1 we consider a linear Hamiltonian difference system H and the corresponding discrete quadratic functional F defined by F Here, x x } N0 and u u } N0 are sequences of R n -vectors, and we say that such a pair x, u isadmissible on J provided that x A x +1 + B u for all J holds An x is called admissible on J if there exists u such that the pair x, u is admissible on J he functional F is then said to be positive definite and we write F > 0 whenever Fx, u > 0 for all on J admissible x, u with x and 0 holds hroughout the paper we denote by X, U the principal solution of H at 0, ie, the solution introduced in Proposition 12i Concerning Moore Penrose inverses we will need the following basic lemma which is proved, eg, in [2, Remar 2iii]

5 186 MARIN BOHNER AND ONDŘEJ DOŠLÝ Lemma 21 For any two matrices V and W we have KerV KerW iff W WV V iff W V VW It is the goal of this paper to relate the condition from Proposition 12i to a condition on certain bloc tridiagonal n n matrices of the form 0 S 1 L S 1 1 S 1, N 0, S 1 1 where we put, for N 0, 8 C +I A B I A +B +1 and S B I A Let L L N Our first result then is the following heorem 22 Let x, u be admissible on J with x hen we have Fx, u L Proof Let x, u be admissible on J so that u B u u B B B u x +1I A x B I A x +1 x holds for all J hen, if x ,wehave Fx, u x +1C x +1 + x +1I A x } B I A x +1 x } x +1 B +1 x +1 +2x S x +1 + x B x } x +1 x +1 +2x S x +1 x B x x +1 x +1 +2x } S x +1 x N+1 B N x 0 B 0 x 0 0 N 1 1 x +1 x +1 +2x S x +1 } + x 1 0 L, and hence our desired result is shown

6 BLOCK RIDIAGONAL MARICES 187 By introducing the space A : x x } N0 is admissible on J with x , we can write an immediate consequence of heorem 22 Corollary 23 F > 0 iff L > 0 on A Note that L > 0onA, ie, χ Lχ>0 for all χ A\0}, is equivalent to M LM 0 and KerM LM KerM whenever M is a matrix with ImM A In the next section we will present such a matrix M for the general Hamiltonian case, and in the last section we will give this matrix M and further results for the Sturm Liouville case A Sturm Liouville difference equation n } SL µ r µ µ y +n µ 0, N 0 µ0 with reals r µ,0 µ n, such that rn 0 for all N 0 is a special case of a linear Hamiltonian difference system We define, for all N 0, A 1, B 0, 1 0 r n 9 r 0 r 1 and C r n 1 hen assumption 1 is satisfied and the following result from [3, Lemma 4] holds Lemma 24 Suppose 9 hen x is admissible on J iff there exists a sequence y y } 0 N+n 1 of reals such that x y +n 1 y +n 2 2 y +n 3 n 1 y for all 0 N +1 holds, and in this case the functional defined by F taes the form 10 Fx, u n 0 ν0 r ν ν y +n ν } 2, where u is such that x, u is admissible We conclude this section with two auxiliary results where we use the notation introduced in Proposition 12 Lemma 25 Let à : I A 1 and D X X +1ÃB, N 0

7 188 MARIN BOHNER AND ONDŘEJ DOŠLÝ i Suppose 1 IfKerX +1 KerX, then D is symmetric and KerX +1 KerB Ã ii Suppose 9 hen we have for all 0 n 1 KerX +1 KerX, ranx +1 +1, and D 0 Proof While part i is shown in [2, Remar 2 ii], ii is the contents of [3, Lemma 4] Lemma 26 We have, for all N 0, } 11 X+1 X +1 X U + B X X S X +1 X+1S X Proof he calculation X+1 X +1 + X S X +1 + X+1S X X+1 U+1 I A } U +X+1I A B I A X +1 + X+1B +1 X +1 X B I A X +1 X+1I A B X X+1U +1 X + U B U +X + U B B X + B U +X+1B +1 X +1 X B X + B U X + U B B X } X U + X B X shows that formula 11 holds 3 he linear Hamiltonian difference system In this section we present a matrix M satisfying ImM A We then give a proof of the following crucial result heorem 31 If KerX +1 KerX holds on J, then we have M LM diag D 1,,D N } o further motivate our investigations, first we would lie to briefly consider the case that the matrices 12 B are invertible for all J hen we have A R Nn, and F > 0iffL > 0 hen, if X, U is the principal solution of H at 0 such that X are invertible for all 1 N + 1, and if we put F +1 D 1 S 1 D 2 S 2 D S D 2 S 2 D S 1 1 D S 1 I it is easy to show that, for all 0 N, 13 D 1 +1 S D S, L +1 F +1 D +1 for all 0 N, 0 1 I

8 BLOCK RIDIAGONAL MARICES 189 and 14 L 1 L F +1 D +1 F +1 heorem 32 Assume 12 We put L 0 : I and D 0 : 0 hen we have recursively, for 0, 1, 2,,N, L +1 > 0 L > 0 and D+1 : S D } 1 15 S > 0 Proof Of course 15 is obvious for 0 However, if 15 holds for some 0 N 1, then put R 0 S L R L +1 > 0 L > 0 and R L 1 R > 0 R However, by 14, R L 1 R S D S, where our D here are exactly the D because of 13 and D 0 0 his proves our desired assertion Now we turn our attention to the general case of an LHdS H, where we assume 1 Let us define D ij for 1 i j N matrices by hen we have D ij X i X j D j D ii X i X i D i X i X i X ix i+1ãib i X i X i+1ãib i D i and, by Lemma 21, if KerX j KerX i, D ij X i X j D j X i X j X jx j+1ãjb j X i X j+1ãjb j We now define, for any m J, anmn mn matrix M m by D 11 D 12 D 1m M m 0 D D mm and put M M N heorem 33 If KerX +1 KerX holds on J, then ImM A Proof We assume KerX +1 KerX on J First, let Aand put x n c 0 : 0, c +1 : c X +1ÃB U c u for N 0, where u u } N0 is such that x, u is admissible on J Let d : U c u for N 0 We have X 0 c 0 0x 0, and X c x for some J implies X +1 c +1 X +1 c X +1 X +1ÃB U c u ÃX + ÃB U c ÃB U c u ÃX c + ÃB u Ãx + ÃB u x +1

9 190 MARIN BOHNER AND ONDŘEJ DOŠLÝ because of Lemmas 25i and 21 Hence Next, we have for j J, so that X c x for all 0 N +1 D j d j X j X j+1ãjb j U j c j u j X j c j c j+1 X j c j D ij d j X i X j D jd j X i X j X j c j X i c j for all 0 i j N because of KerX j KerX i and Lemma 21 herefore D ij d j X i ji for all 0 i N so that Conversely, let with hen we have x n N ji c j X i c N+1 c i X i X N+1 X N+1c N+1 + X i c i x i M d 1 d N ImM ImM and put x We pic d 1,,d N R n x i I A 0 x 0 D ij d j for all 1 i N ji I A 0 X 1 X j D N jd j B 0 X j D jd j ImB 0, j1 I A N +1 D NN d N D NNd N ImB N, and, for J \N}, I A x +1 x I A j+1 I A X +1 X } B U N j+1 j1 X +1 X j D jd j j+1 X X j D jd j j X j D jd j D d ImB by Lemma 25i so that x is admissible on J and hence X j D jd j D d x n A

10 BLOCK RIDIAGONAL MARICES 191 Our next result directly yields heorem 31 heorem 34 If KerX +1 KerX holds on J, then M M m+1l m+1 M m+1 m L m M m 0 0 D m+1 Proof Let J and m J \N} We define n n matrices P and R by X 1 0 X 2 P and R 0 X S hen we have the recursions Mm P M m+1 m X m+1 D m+1 0 X m+1 X m+1 D m+1 Lm R and L m+1 m R m m Hence by putting M M 0, M m+1 Mm P m+1 X m+1 D m+1 herefore the matrix M m+1l m+1 M m+1 turns out to be M ml m+1 Mm M m L m+1 P m+1 X m+1 D m+1 D m+1 X m+1 Pm+1L m+1 Mm D m+1 X m+1 Pm+1L m+1 P m+1 X m+1 D m+1 M ml m M m Ω m X m+1 D m+1 D m+1 X m+1 Ω m D m+1 X m+1 Λ m X m+1 D m+1 with Ω m M ml m+1 P m+1 and Λ m P m+1l m+1 P m+1 Hence our result follows directly from ii and iii of the following lemma Lemma 35 If KerX +1 KerX holds on J, then we have, for all J \N}, i Λ X+1 U +1 + B +1 X +1; ii D +1 X +1 Λ X +1 D +1 D +1 ; iii Ω 0 Proof First of all we have, by formula 11 of Lemma 26, Λ 0 X 1 0 X 1 X 1 U 1 + B 1 X 1 and, if Λ 1 X U + B X already holds for some 1,,N 1}, again by applying formula 11 we have Λ P X +1 L R R P X +1 P L P + P R X +1 + X +1R P + X +1 X +1 X +1U +1 + B +1 X +1

11 192 MARIN BOHNER AND ONDŘEJ DOŠLÝ Hence i is shown, and by i, for all J \N}, D +1 X +1 Λ X +1 D +1 D +1 U +1 X +1 D +1 + D +1 B +1 D +1 X +1 X +2Ã+1B +1 U +1 X +1 D +1 + X +1 X +2Ã+1X +1 X +1 D +1 X +1 X +2 X +2X +1 D +1 X +1 X +1 D +1 D +1 taes care of part ii Finally, Ω 0 0, and if Ω 1 0 already holds for some 1,,N 1}, then Ω M 0 L R P R X +1 M L P + R X +1 M 1 0 D X L P P + S X +1 Ω 1 D X Λ 1 + D S X +1 0 D U + B X D B X 0 + B U because of part i Hence iii follows, and all our desired results are shown 4 he Sturm Liouville difference equation In this section we deal with the case where H and F correspond to a higher order Sturm Liouville equation SL and its corresponding quadratic functional 10 he special structure of the matrices A, B, C enables us to simplify the results of the previous section We start with an identity which plays the crucial role in the proof of the main results of this section Lemma 41 Let X, U be the principal solution of LHdS corresponding to SL If X +1 is nonsingular, then } D X X+1ÃB 1 det X diag 0,,0, r n det X +1 Proof Nonsingularity of X +1 implies that Ker X +1 Ker X, hence the matrix D X X+1ÃB 1 is symmetric according to Lemma 25i, and since B diag0,,0, 1/r n }, the only nonzero entry of D is in the right lower corner Using Laplace s rule, we have det X det [I A X +1 B U ] 0 0 det I A X U r n n,1 U r n n,n [ ] n I A X +1 n,ν 1 U n,ν adj [I A X +1 ] ν,n ν1 r n n I A X +1 B U n,ν [I A X +1 ] 1 det [I A X +1 ] ν,n ν1

12 n ν1 BLOCK RIDIAGONAL MARICES 193 X n,ν X+1Ã 1 deti A det X +1 ν,n det X +1 X X 1 +1Ã r n det X +1 D n,n, n,n r n det X +1 X X 1 +1ÃB n,n so the desired result follows In the next statement and its proof we suppose that the matrices X, L, M are the same as in the previous section and that the matrices A, B, C in H are given by 9 heorem 42 Suppose that X n,,x N+1 are nonsingular and denote 16 d : D n,n det X r n det X +1, n,,n hen there exists an nn N n +1 matri such that N LN diagd n,,d N } Proof Observe that the assumption of nonsingularity of X n,,x N+1 corresponds to the assumption Ker X +1 Ker X in heorem 31 because of Lemma 25 ii Denote by M [j] R nn, j 1,,nN, the columns of the matrix M and let N be the nn N n+1 matrix which results from M after omitting all zero columns, ie, N [ M [n2] M [nn+1] M [nn]] Since D 1 D n 1 0 for LHdS corresponding to SL by Lemma 25 ii, we have M LM diag0,,0,d n,,d N } by heorem 31 By Lemma 41, D j diag0,,0,d j }, j n,,n, and the statement follows from the relation between M and N Sturm Liouville equations may be investigated also directly, ie, not as a special case of LHdS Let t 1,,t n be n-dimensional vectors with entries µ 1 t µ ν 1 n ν, µ 1,,n, n ν with the usual convention that n 0if>nor <0, and denote by the n n matrix whose columns are the vectors t ν, ie, [t 1 t n ] Furthermore, let P p i,j bethenn N n + 1 matrix with n-vector entries p i,j R n given by p i,j t n+j i, with the convention that t l 0ifl<1orl>n It follows from Lemma 24 that if H corresponds to a Sturm Liouville equation SL, then x, u satisfying x is admissible iff there exists y y } N n such that x y ḳ y +n 1 ;

13 194 MARIN BOHNER AND ONDŘEJ DOŠLÝ hence x 1,,x N Aiff P y ṇ Consequently, if A, B, C are given by 9,,S by 8, and K : P LP, wehave Fy n 0 ν0 y ṇ r ν ν y +n ν 2 y ṇ P LP x +1 C x +1 + u } B u 0 y ṇ y ṇ K Expanding the differences in 10, it is easy to see that K isa2n + 1-diagonal matrix Our next computations extend the results of the first section by relating the quantities d from 16 in section 1 for n 1 denoted by δ to the principal minors of the matrix K First we loo for a relation between the nn N n+1 matrices P and N and the corresponding representation for x 1,,x N A By the previous considerations and heorem 33, x 1,,x N Aiff there exists c c n,,c N such that N c ṇ c N y ṇ P From the last equality we will find a relation between vectors c c n,,c N and y y n,, Note that these vectors are determined uniquely since the matrices P and N have full ran Denote by d j i the last column of the matrix X ix j D j aing into account the form of the matrices P and N, we get the system of equations t 1 c N d N N, 1 t 1 + t 2 c N 1 d N 1 N 1 + c nd N N 1 17, y n t 1 c n d n c N d N 1 From this system of equations, we see that there exists an upper triangular matrix B B i,j R N n+1 N n+1 such that y Bc and that this is just the matrix which reduces the 2n + 1-diagonal matrix K P LP to the diagonal form Indeed, we have Fy y ṇ c ṇ y ṇ K c ṇ N LN L c N c N

14 BLOCK RIDIAGONAL MARICES 195 y ṇ y ṇ B 1 diagd n,,d N }B 1 for any y y n,, R N n+1 ; hence B KB diagd n,,d N } Observe also that the diagonal entries of the matrix B are B, 1 n 1 d n+ 1, 1,,N n + 1 this follows directly from 17, and that KB j, B K,j diagd n,,d N }B 1,j 0 j 1,, 1, 1 n 1 j Here we used the information about diagonal entries of B he last expression may be regarded as a system of linear equations for B 1,,,B,, and by Cramer s rule we have B, 1 n 1 d n+ 1 1n 1 1 Now we can summarize our previous computations and relate the quantities d from 16, n,,n, to the principal minors of K his statement may be viewed as a direct extension of 7 to higher order Sturm Liouville difference equations Here, similarly as in the previous theorem, X, U is the principal solution of H with A, B, C given by 9, and the assumption of nonsingularity of the matrices X n,,x N+1 has the same meaning as in heorem 42 heorem 43 Suppose X n,,x N+1 are nonsingular and let be the principal minors of the matrix K hen, for all 1 N n +1, d n+ 1 1, 0 : 1 REFERENCES [1] C D Ahlbrandt and A C Peterson, Discrete Hamiltonian Systems: Difference Equations, Continued Fractions, and Riccati Equations, Kluwer Academic Publishers, Boston, MA, 1996 [2] M Bohner, Linear Hamiltonian difference systems: Disconjugacy and Jacobi-type conditions, J Math Anal Appl, , pp [3] M Bohner, On disconjugacy for Sturm-Liouville difference equations, J Difference Equations and Appl, , pp [4] W A Coppel, Disconjugacy, Lecture Notes in Math 220, Springer-Verlag, Berlin, 1971 [5] O Došlý, Factorization of disconjugate higher order Sturm-Liouville difference operators, Comput Math Appl, to appear [6] W Reid, Ordinary Differential Equations, John Wiley, New Yor, 1971 [7] W Reid, Sturmian heory for Ordinary Differential Equations, Springer-Verlag, New Yor, 1980

Trigonometric Recurrence Relations and Tridiagonal Trigonometric Matrices

Trigonometric Recurrence Relations and Tridiagonal Trigonometric Matrices International Journal of Difference Equations. ISSN 0973-6069 Volume 1 Number 1 2006 pp. 19 29 c Research India Publications http://www.ripublication.com/ijde.htm Trigonometric Recurrence Relations and

More information

Spectral theory of difference operators

Spectral theory of difference operators MASARYK UNIVERSITY, FACULTY OF SCIENCE DEPARTMENT OF MATHEMATICS AND STATISTICS Spectral theory of difference operators Ph.D. Thesis BRNO 2010 PETR HASIL Bibliographic entry Author Petr Hasil Title Spectral

More information

Sturm-Liouville Matrix Differential Systems with Singular Leading Coefficients

Sturm-Liouville Matrix Differential Systems with Singular Leading Coefficients Sturm-Liouville Matrix Differential Systems with Singular Leading Coefficients Iva Drimalová, Werner Kratz und Roman Simon Hilscher Preprint Series: 2016-05 Fakultät für Mathematik und Wirtschaftswissenschaften

More information

OSCILLATION AND SPECTRAL THEORY FOR LINEAR HAMILTONIAN SYSTEMS WITH NONLINEAR DEPENDENCE ON THE SPECTRAL PARAMETER

OSCILLATION AND SPECTRAL THEORY FOR LINEAR HAMILTONIAN SYSTEMS WITH NONLINEAR DEPENDENCE ON THE SPECTRAL PARAMETER OSCILLATION AND SPECTRAL THEORY FOR LINEAR HAMILTONIAN SYSTEMS WITH NONLINEAR DEPENDENCE ON THE SPECTRAL PARAMETER Martin Bohner, Werner Kratz und Roman Simon Hilscher Preprint Series: 2011-09 Fakultät

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Research Article Conjugacy of Self-Adjoint Difference Equations of Even Order

Research Article Conjugacy of Self-Adjoint Difference Equations of Even Order Abstract and Applied Analysis Volume 2011, Article ID 814962, 16 pages doi:10.1155/2011/814962 Research Article Conugacy of Self-Adoint Difference Equations of Even Order Petr Hasil Department of Mathematics,

More information

Determinants Chapter 3 of Lay

Determinants Chapter 3 of Lay Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......

More information

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication

More information

ACI-matrices all of whose completions have the same rank

ACI-matrices all of whose completions have the same rank ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices

More information

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

Linear Algebra: Lecture notes from Kolman and Hill 9th edition. Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices

More information

1 Determinants. 1.1 Determinant

1 Determinants. 1.1 Determinant 1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to

More information

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88 Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

Tensor Complementarity Problem and Semi-positive Tensors

Tensor Complementarity Problem and Semi-positive Tensors DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New

More information

Recursion Formulae for the Characteristic Polynomial of Symmetric Banded Matrices

Recursion Formulae for the Characteristic Polynomial of Symmetric Banded Matrices Recursion Formulae for the Characteristic Polynomial of Symmetric Banded Matrices Werner Kratz und Markus Tentler Preprint Series: 2007-15 Fakultät für Mathematik und Wirtschaftswissenschaften UNIVERSITÄT

More information

TOPIC III LINEAR ALGEBRA

TOPIC III LINEAR ALGEBRA [1] Linear Equations TOPIC III LINEAR ALGEBRA (1) Case of Two Endogenous Variables 1) Linear vs. Nonlinear Equations Linear equation: ax + by = c, where a, b and c are constants. 2 Nonlinear equation:

More information

Chapter 2: Linear Independence and Bases

Chapter 2: Linear Independence and Bases MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space

More information

Lectures on Linear Algebra for IT

Lectures on Linear Algebra for IT Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants

More information

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian

More information

Math 240 Calculus III

Math 240 Calculus III The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A

More information

ON THE MATRIX EQUATION XA AX = X P

ON THE MATRIX EQUATION XA AX = X P ON THE MATRIX EQUATION XA AX = X P DIETRICH BURDE Abstract We study the matrix equation XA AX = X p in M n (K) for 1 < p < n It is shown that every matrix solution X is nilpotent and that the generalized

More information

EXPLICIT SOLUTION TO MODULAR OPERATOR EQUATION T XS SX T = A

EXPLICIT SOLUTION TO MODULAR OPERATOR EQUATION T XS SX T = A Kragujevac Journal of Mathematics Volume 4(2) (216), Pages 28 289 EXPLICI SOLUION O MODULAR OPERAOR EQUAION XS SX A M MOHAMMADZADEH KARIZAKI 1, M HASSANI 2, AND S S DRAGOMIR 3 Abstract In this paper, by

More information

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij

More information

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33 Chapter 5: Matrices Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 5: Matrices Semester 1 2018 1 / 33 In this chapter Matrices were first introduced in the Chinese Nine Chapters on the Mathematical

More information

DETERMINANTAL DIVISOR RANK OF AN INTEGRAL MATRIX

DETERMINANTAL DIVISOR RANK OF AN INTEGRAL MATRIX INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 4, Number 1, Pages 8 14 c 2008 Institute for Scientific Computing and Information DETERMINANTAL DIVISOR RANK OF AN INTEGRAL MATRIX RAVI

More information

Block companion matrices, discrete-time block diagonal stability and polynomial matrices

Block companion matrices, discrete-time block diagonal stability and polynomial matrices Block companion matrices, discrete-time block diagonal stability and polynomial matrices Harald K. Wimmer Mathematisches Institut Universität Würzburg D-97074 Würzburg Germany October 25, 2008 Abstract

More information

Positive entries of stable matrices

Positive entries of stable matrices Positive entries of stable matrices Shmuel Friedland Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago Chicago, Illinois 60607-7045, USA Daniel Hershkowitz,

More information

Matrices and systems of linear equations

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

Numerical Linear Algebra Homework Assignment - Week 2

Numerical Linear Algebra Homework Assignment - Week 2 Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.

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

Lecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky

Lecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J Olver 3 Review of Matrix Algebra Vectors and matrices are essential for modern analysis of systems of equations algebrai, differential, functional, etc In this

More information

Math113: Linear Algebra. Beifang Chen

Math113: Linear Algebra. Beifang Chen Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary

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

w T 1 w T 2. w T n 0 if i j 1 if i = j

w T 1 w T 2. w T n 0 if i j 1 if i = j Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -

More information

Intrinsic products and factorizations of matrices

Intrinsic products and factorizations of matrices Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences

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

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates

More information

y" + Q(t)y = o, i e /, (l.i)

y + Q(t)y = o, i e /, (l.i) proceedings of the american mathematical society Volume 82, Number 4, August 1981 ON A CONJECTURE FOR OSCILLATION OF SECOND ORDER ORDINARY DIFFERENTIAL SYSTEMS ANGELO B. MTNGARELLI1 Abstract. We present

More information

a Λ q 1. Introduction

a Λ q 1. Introduction International Journal of Pure and Applied Mathematics Volume 9 No 26, 959-97 ISSN: -88 (printed version); ISSN: -95 (on-line version) url: http://wwwijpameu doi: 272/ijpamv9i7 PAijpameu EXPLICI MOORE-PENROSE

More information

Green s Function for an n-point Right Focal Boundary Value Problem

Green s Function for an n-point Right Focal Boundary Value Problem Green s Function for an n-point Right Focal Boundary Value Problem Doug Anderson Department of Mathematics and Computer Science, Concordia College Moorhead, MN 56562, USA Abstract We determine sufficient

More information

RETRACTED On construction of a complex finite Jacobi matrix from two spectra

RETRACTED On construction of a complex finite Jacobi matrix from two spectra Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 On construction of a complex finite Jacobi matrix from two spectra Gusein Sh. Guseinov guseinov@ati.edu.tr Follow this and additional

More information

LINEAR INTERVAL INEQUALITIES

LINEAR INTERVAL INEQUALITIES LINEAR INTERVAL INEQUALITIES Jiří Rohn, Jana Kreslová Faculty of Mathematics and Physics, Charles University Malostranské nám. 25, 11800 Prague, Czech Republic 1.6.1993 Abstract We prove that a system

More information

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea

More information

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i ) Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical

More information

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0. Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the

More information

ENGR-1100 Introduction to Engineering Analysis. Lecture 21. Lecture outline

ENGR-1100 Introduction to Engineering Analysis. Lecture 21. Lecture outline ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility

More information

Generalized Riccati Equations Arising in Stochastic Games

Generalized Riccati Equations Arising in Stochastic Games Generalized Riccati Equations Arising in Stochastic Games Michael McAsey a a Department of Mathematics Bradley University Peoria IL 61625 USA mcasey@bradley.edu Libin Mou b b Department of Mathematics

More information

Linear Algebra and Matrix Inversion

Linear Algebra and Matrix Inversion Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much

More information

Lecture Notes in Linear Algebra

Lecture Notes in Linear Algebra Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................

More information

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop Fall 2017 Inverse of a matrix Authors: Alexander Knop Institute: UC San Diego Row-Column Rule If the product AB is defined, then the entry in row i and column j of AB is the sum of the products of corresponding

More information

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any

More information

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ Question No: 1 (Marks: 1) If for a linear transformation the equation T(x) =0 has only the trivial solution then T is One-to-one Onto Question

More information

ENGR-1100 Introduction to Engineering Analysis. Lecture 21

ENGR-1100 Introduction to Engineering Analysis. Lecture 21 ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility

More information

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear

More information

MATH 2030: EIGENVALUES AND EIGENVECTORS

MATH 2030: EIGENVALUES AND EIGENVECTORS MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their

More information

Upper triangular matrices and Billiard Arrays

Upper triangular matrices and Billiard Arrays Linear Algebra and its Applications 493 (2016) 508 536 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Upper triangular matrices and Billiard Arrays

More information

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2 The Maximum Dimension of a Subspace of Nilpotent Matrices of Index L G Sweet Department of Mathematics and Statistics, University of Prince Edward Island Charlottetown, PEI C1A4P, Canada sweet@upeica J

More information

Interlacing Inequalities for Totally Nonnegative Matrices

Interlacing Inequalities for Totally Nonnegative Matrices Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are

More information

Here are some additional properties of the determinant function.

Here are some additional properties of the determinant function. List of properties Here are some additional properties of the determinant function. Prop Throughout let A, B M nn. 1 If A = (a ij ) is upper triangular then det(a) = a 11 a 22... a nn. 2 If a row or column

More information

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0 Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =

More information

On an Inverse Problem for a Quadratic Eigenvalue Problem

On an Inverse Problem for a Quadratic Eigenvalue Problem International Journal of Difference Equations ISSN 0973-6069, Volume 12, Number 1, pp. 13 26 (2017) http://campus.mst.edu/ijde On an Inverse Problem for a Quadratic Eigenvalue Problem Ebru Ergun and Adil

More information

Chapter Two Elements of Linear Algebra

Chapter Two Elements of Linear Algebra Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1

More information

A. R. SOLTANI AND Z. SHISHEBOR

A. R. SOLTANI AND Z. SHISHEBOR GEORGIAN MAHEMAICAL JOURNAL: Vol. 6, No. 1, 1999, 91-98 WEAKLY PERIODIC SEQUENCES OF BOUNDED LINEAR RANSFORMAIONS: A SPECRAL CHARACERIZAION A. R. SOLANI AND Z. SHISHEBOR Abstract. Let X and Y be two Hilbert

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

Applied Mathematics Letters

Applied Mathematics Letters Applied Mathematics Letters 24 (211) 219 223 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Laplace transform and fractional differential

More information

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column

More information

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU LU Factorization A m n matri A admits an LU factorization if it can be written in the form of Where, A = LU L : is a m m lower triangular matri with s on the diagonal. The matri L is invertible and is

More information

Discrete Riccati equations and block Toeplitz matrices

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

April 26, Applied mathematics PhD candidate, physics MA UC Berkeley. Lecture 4/26/2013. Jed Duersch. Spd matrices. Cholesky decomposition

April 26, Applied mathematics PhD candidate, physics MA UC Berkeley. Lecture 4/26/2013. Jed Duersch. Spd matrices. Cholesky decomposition Applied mathematics PhD candidate, physics MA UC Berkeley April 26, 2013 UCB 1/19 Symmetric positive-definite I Definition A symmetric matrix A R n n is positive definite iff x T Ax > 0 holds x 0 R n.

More information

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Welsh s problem on the number of bases of matroids

Welsh s problem on the number of bases of matroids Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University

More information

Matrix Arithmetic. j=1

Matrix Arithmetic. j=1 An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column

More information

Determinantal divisor rank of an integral matrix

Determinantal divisor rank of an integral matrix Determinantal divisor rank of an integral matrix R. B. Bapat Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in Abstract: We define the determinantal divisor rank of an integral

More information

Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences

Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences Advances in Dynamical Systems and Applications ISSN 0973-532, Volume 6, Number, pp. 9 09 20 http://campus.mst.edu/adsa Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable

More information

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University

More information

Components and change of basis

Components and change of basis Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition

More information

6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.

6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22. 61 Matrices Definition: A Matrix A is a rectangular array of the form A 11 A 12 A 1n A 21 A 22 A 2n A m1 A m2 A mn The size of A is m n, where m is the number of rows and n is the number of columns The

More information

Determinants. Beifang Chen

Determinants. Beifang Chen Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,

More information

ELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES

ELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham

More information

Memoryless output feedback nullification and canonical forms, for time varying systems

Memoryless output feedback nullification and canonical forms, for time varying systems Memoryless output feedback nullification and canonical forms, for time varying systems Gera Weiss May 19, 2005 Abstract We study the possibility of nullifying time-varying systems with memoryless output

More information

Spectral inequalities and equalities involving products of matrices

Spectral inequalities and equalities involving products of matrices Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department

More information

On the adjacency matrix of a block graph

On the adjacency matrix of a block graph On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit

More information

Efficient algorithms for finding the minimal polynomials and the

Efficient algorithms for finding the minimal polynomials and the Efficient algorithms for finding the minimal polynomials and the inverses of level- FLS r 1 r -circulant matrices Linyi University Department of mathematics Linyi Shandong 76005 China jzh108@sina.com Abstract:

More information

Product distance matrix of a tree with matrix weights

Product distance matrix of a tree with matrix weights Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian

More information

Disconjugate operators and related differential equations

Disconjugate operators and related differential equations Disconjugate operators and related differential equations Mariella Cecchi, Zuzana Došlá and Mauro Marini Dedicated to J. Vosmanský on occasion of his 65 th birthday Abstract: There are studied asymptotic

More information

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT

More information

YONGDO LIM. 1. Introduction

YONGDO LIM. 1. Introduction THE INVERSE MEAN PROBLEM OF GEOMETRIC AND CONTRAHARMONIC MEANS YONGDO LIM Abstract. In this paper we solve the inverse mean problem of contraharmonic and geometric means of positive definite matrices (proposed

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

Oscillation Theorems for Second-Order Nonlinear Dynamic Equation on Time Scales

Oscillation Theorems for Second-Order Nonlinear Dynamic Equation on Time Scales Appl. Math. Inf. Sci. 7, No. 6, 289-293 (203) 289 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/0.2785/amis/070608 Oscillation heorems for Second-Order Nonlinear

More information

Generalized Principal Pivot Transform

Generalized Principal Pivot Transform Generalized Principal Pivot Transform M. Rajesh Kannan and R. B. Bapat Indian Statistical Institute New Delhi, 110016, India Abstract The generalized principal pivot transform is a generalization of the

More information

Linear Algebra Primer

Linear Algebra Primer Introduction Linear Algebra Primer Daniel S. Stutts, Ph.D. Original Edition: 2/99 Current Edition: 4//4 This primer was written to provide a brief overview of the main concepts and methods in elementary

More information

1. Introduction and background. Consider the primal-dual linear programs (LPs)

1. Introduction and background. Consider the primal-dual linear programs (LPs) SIAM J. OPIM. Vol. 9, No. 1, pp. 207 216 c 1998 Society for Industrial and Applied Mathematics ON HE DIMENSION OF HE SE OF RIM PERURBAIONS FOR OPIMAL PARIION INVARIANCE HARVEY J. REENBER, ALLEN. HOLDER,

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

MATH2210 Notebook 2 Spring 2018

MATH2210 Notebook 2 Spring 2018 MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................

More information

A New Algorithm for Solving Cross Coupled Algebraic Riccati Equations of Singularly Perturbed Nash Games

A New Algorithm for Solving Cross Coupled Algebraic Riccati Equations of Singularly Perturbed Nash Games A New Algorithm for Solving Cross Coupled Algebraic Riccati Equations of Singularly Perturbed Nash Games Hiroaki Mukaidani Hua Xu and Koichi Mizukami Faculty of Information Sciences Hiroshima City University

More information

MATRICES. a m,1 a m,n A =

MATRICES. a m,1 a m,n A = MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of

More information