ON THE EIGENVALUE OF INFINITE MATRICES WITH NONNEGATIVE OFF-DIAGONAL ELEMENTS
|
|
- Darlene Lawrence
- 5 years ago
- Views:
Transcription
1 ON THE EIGENVALUE OF INFINITE MATRICES WITH NONNEGATIVE OFF-DIAGONAL ELEMENTS N. APREUTESEI AND V. VOLPERT The paper is devoted to infinite-dimensional difference operators. Some spectral properties of such operators are studied. Under some assumptions on the essential spectrum, it is shown that a real eigenvalue with a positive eigenvector is simple and that the real parts of all other eigenvalues are less than for this one. It is a generalization of the Perron- Frobenius theorem for infinite matrices. Copyright 2006 N. Apreutesei and V. Volpert. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction Consider the Banach spaces E of infinite sequences u = (...,u 1,u 0,u 1,...) with the norm and the operator L acting in E, u = sup u j (1.1) j (Lu) j = a j mu j m + + a j 0u j + + a j mu j+m, j = 0,±1,±2,..., (1.2) where m is a positive integer and a j k R, m k m are given coefficients. We assume that there exist the limits Consider the limiting operators L ±, a ± k = lim aj k, k = 0,±1,...,±m. (1.3) j ± ( L ± u ) j = a± mu j m + + a ± 0 u j + + a ± mu j+m, j = 0,±1,±2,... (1.4) Hindawi Publishing Corporation Proceedingsof the Conference on Differential & Difference Equationsand Applications,pp.81 89
2 82 On the eigenvalue of infinite matrices Let and suppose that the equations a ± m 0, a ± m 0, (1.5) L ± u λu = 0 (1.6) do not have nonzero bounded solutions for any real λ 0. We will call it Condition NS(λ). Recall that a linear operator L : E E is normally solvable if its image ImL is closed. If L is normally solvable with a finite-dimensional kernel and the codimension of its image is also finite, then L is called Fredholm operator. Denoting by α(l) andβ(l) the dimension of kerl and the codimension of ImL, respectively, we can define the index κ(l) of the operator L as κ(l) = α(l) β(l). In [1], the following result is proved (Theorem 4.10). Theorem 1.1. If Condition NS(λ) is satisfied, then L is a Fredholm operator with the zero index. Consider the polynomials P ± λ (σ) = a± mσ 2m + + a ± 1 σ m+1 + ( a ± 0 λ) σ m + a ± 1σ m a ± m. (1.7) Lemma 2.1 in [2]for L λi leads to the following conclusion. Theorem 1.2. Condition NS(λ) is satisfied if and only if the polynomials P λ ± (σ) do not have roots σ with σ =1. As a consequence, we can obtain the following corollary. Corollary 1.3. If Condition NS(λ) is satisfied, then a ± m + + a ± m < 0, (1.8) that is, L ± q<0,whereq isasequencewithallelementsequal1. Proof. Suppose that the assertion of the corollary does not hold. Then P 0 ± (1) 0. On the other hand, for λ sufficiently large, P λ ± (1) < 0. Therefore for some λ, P± λ (1) = 0. We obtain a contradiction with Theorem 1.2, so the conclusion is proved. We recall that the formally adjoint operator L is defined by the equality (Lu,v) = ( u,l v ). (1.9) If we consider L as an infinite matrix, then L is the adjoint matrix. Let α(l )bethe dimension of kerl and let f ={f j } j= E be fixed. The below solvability conditions are established in [2].
3 Theorem 1.4. The equation Lu = f is solvable if and only if j= N. Apreutesei and V. Volpert 83 f j v l j = 0, l = 1,...,α ( L ), (1.10) where v l ={v l j} j= are linearly independent solutions of the equation L v = 0. In what follows, we say that u is positive (nonnegative) if all elements of this sequence are positive (nonnegative). From now on, we suppose that a j k > 0, k =±1,±2,...,±m, j = 0,±1,±2,..., (1.11) and that there existsa positive solutionw of the equation Lu = 0. (1.12) This means that L has a zero eigenvalue. The goal of this paper is to show that it is simple and all other eigenvalues lie in the left half-plane. Moreover, the adjoint operator L has a positive solution, which is unique up to a constant factor. It is a generalization of the Perron-Frobenius theorem for infinite matrices. The method of the proof follows the method developed for elliptic problems, in unbounded domains [3, 4]. Similarly to elliptic problems, it is assumed that the essential spectrum lies to the left of the eigenvalue with a positive eigenvector. We note that the operator L can be considered as infinite-dimensional (2m + 1)-diagonal matrix with positive elements in all nonzero diagonals except for the main diagonal where the signs of the elements are not prescribed. In Section 2, we present some auxiliary results. The main result is proved in Section Auxiliary results Supposethatconditions(1.3), (1.5), (1.11) are satisfied. In order to prove our main result, we first present some auxiliary results. We begin with the positiveness of the solution of equation Lu = f for f 0. We will use the notations U (N) = ( u N m,...,u N 1 ), U+ (N) = ( u N+1,...,u N+m ). (2.1) Lemma 2.1. Let Lu = f,where f 0, u 0, u 0. Then u>0. Proof. Suppose that u j = 0forsomej. Sinceu 0, there exists i such that u i = 0, and either u i+1 0oru i 1 0. The equation (Lu) i = f i gives a contradiction in signs. The lemma is proved. Lemma 2.2. If the initial condition u 0 of the problem du dt = Lu, u(0) = u0 (2.2) is nonnegative, then the solution u(t) is also nonnegative for all t (0, ).
4 84 On the eigenvalue of infinite matrices Proof. Consider the approximate problem du i dt = (Lu) i, N i N, t 0, U ( N) = 0, U + (N) = 0, t 0, (2.3) u(0) = u 0, where the unknown function is u = (u N,u N+1,...u 0,...,u N 1,u N ). Since u 0 0andLu has nonnegative off-diagonal coefficients, it follows that the solution u N = (u N N,u N N+1,...u N 0,...,u N N 1,u N N) of the above problem is nonnegative. If we compare the solution u N at the interval [ N,N] and the solution u N+1 at the interval [ N 1,N +1],wefindu N+1 u N. Indeed, the difference u N+1 u N verifies a problem similar to the above one, but with a nonnegative initial condition and with zero boundary conditions. The solution of this problem is nonnegative, that is, u N+1 u N.So the sequence is monotonically increasing with respect to N. The sequence is also bounded with respect to N: u N (t) M,forallN and t [0,T], where T is any positive number, M>0dependsonu 0 and on the coefficients a i k of L, which are bounded. Being bounded and monotone, it follows that u N is convergent as N in C([0,T];E), say u N u.by the equations, we have also u N u in C 1 ([0,T];E). Then u verifies the problem (2.2)and u 0 (because u N 0), as claimed. Corollary 2.3 (comparison theorem). Let u 1 (t) and u 2 (t) be solutions of the equation du = Lu, (2.4) dt with the initial conditions u 1 (0) and u 2 (0),respectively.Ifu 1 (0) u 2 (0), then u 1 (t) u 2 (t) for t 0. Lemma 2.4. If the initial condition u 0 of the problem du dt = L+ u, u(0) = u 0 (2.5) is constant (independent of j), then the solution u(t) is also constant. For any bounded initial condition, the solution of problem (2.5)convergestothetrivialsolutionu = 0. The proof of this lemma follows from Corollaries 1.3 and 2.3. Lemma 2.5. If u is a solution of the problem Lu = f, j N, U (N) 0, (2.6) where f 0, u j 0 as j,andn is sufficiently large, then u j 0 for j N. Proof. By virtue of Corollary 1.3, there exists a constant ɛ > 0suchthatL + q< ɛ.letus take N large enough such that (( L L +) q ) j ɛ, j N. (2.7) 2
5 N. Apreutesei and V. Volpert 85 Suppose that u j < 0forsomej>N.Bytheassumptionu j 0asj,wecanchoose τ>0suchthatv j = u j + τq j 0forallj N, and there exists i>nsuch that v i = 0. Since V (N) > 0andv j > 0forallj sufficiently large, there exists k>n such that v k = 0and either v k+1 0orv k 1 0 (i.e., v k+1 > 0orv k 1 > 0). We have Lv = Lu + τl + q + τ ( L L +) q = f + τl + q + τ ( L L +) q. (2.8) In view of (2.7), L + q< ɛ and f 0, the right-hand side of this equality is less than or equal to 0 for j N.AsintheproofofLemma 2.1, we obtain a contradiction in signs in the equation corresponding to k. The lemma is proved. Remark 2.6. The assertion of the lemma remains true if we replace (2.6)by Lu αu, j N, U (N) 0, (2.9) for some positive α. Indeed, one obtains Lv αu + τl + q + τ(l L + )q instead of (2.8), where (Lv) k > 0andαu k + τl + q k + τ(l L + )q k <αu k ɛτ/2 = τ(α + ɛ/2) < 0, because v k = The main result In this section, we present the main result of this work and study some spectral properties of infinite-dimensionalmatrices with nonnegativeoff-diagonal elements. Theorem 3.1. Let (1.12) have a positive boundedsolution w. Then, the following hold. (i) The equation Lu = λu (3.1) does not have nonzero bounded solutions for Reλ 0, λ 0. (ii) Each solution of (1.12)hastheformu = kw,wherek is a constant. (iii) The equation has a positive solution unique up to a constant factor. L u = 0 (3.2) Proof. (1) In order to prove the first assertion, we analyze two cases. Case 1. We consider first the case where in (3.1) λ = α + iβ, α 0, β 0. Suppose by contradiction that there exists a bounded nonzero solution u = u 1 + iu 2 of this equation. Then Lu 1 = αu 1 βu 2 and Lu 2 = βu 1 + αu 2. Consider the equation Its solution is dv dt = Lv αv, v(0) = u1. (3.3) v(t) = u 1 cosβt u 2 sinβt. (3.4)
6 86 On the eigenvalue of infinite matrices For the sequence u ={u j }={u 1 j + iu 2 j }, we denote û ={ u j }. Let us take the value of N as in Lemma 2.5 and choose τ>0suchthat û j τw j, where at least for one j 0 with j 0 N, we have the equality For j N, consider the problem j N, (3.5) û j0 = τw j0. (3.6) dy = Ly αy, dt y N k (t) = û N k, k = 1,...,m, y (t) = 0, (3.7) and the corresponding stationary problem y(0) = û, (3.8) Lȳ αȳ = 0, ȳ N k = û N k, k = 1,...,m, ȳ = 0. (3.9) The operator corresponding to problem (3.9) satisfies the Fredholm property (see [2]). The corresponding homogeneous problem has only the zero solution. (For L + instead of L, it follows from the explicit form of the solution, see [1]; for N big enough, L and L + are close.) Therefore, problem (3.9) is uniquely solvable. We show that the solution y(t)ofproblem(3.7)-(3.8)convergestoȳ as t. For this, we consider the solution y (t) ofproblem(3.7) with the initial condition y (0) = ρq, where ρ is such that ρq j û j, j N. (3.10) By Corollary 1.3,wehaveL ± q<0. Since L + is close to L for j N,withN large enough, it follows that (Lq) j < 0, j N. Theny (t) monotonically decreases in t for each j N fixed. From the positiveness and the decreasing monotonicity of y,wededucethaty (t) converges as t to some x = lim t y (t) 0. It satisfies the equation Lx αx = 0. Taking the limit also in the boundary conditions, one obtains that x N+k = û N+k,fork = 1,...,m and x = 0, so x is a solution of problem (3.9). By the uniqueness, we get x = y, that is, there exists the limit lim t y (t) = ȳ. On the other hand, let y be the solution of (3.7) with the initial condition y (0) = 0. It can be shown that y increases in time and it has an upper bound. As above, we can deduce that y converges to ȳ. Therefore, lim t y (t) = lim t y (t) = ȳ. (3.11) By virtue of the comparison theorem applicable in this case (because 0 û j ρq j, j N), we have y (t) y(t) y (t), j N. (3.12)
7 N. Apreutesei and V. Volpert 87 Hence lim y j(t) = ȳ j, j N. (3.13) t One can easily verify that Then it follows from the comparison theorem that v j (t) û j j Z. (3.14) v j (t) y j (t), j N, t 0. (3.15) From this, we have ( v j (t) = v j t + 2πn ) ( y j t + 2πn ). (3.16) β β Passing to the limit as n,weobtain v j (t) ȳ j, j N, t 0. (3.17) Observe that L(τw y) α(τw y), j N, andτw N y N 0. We can apply Remark 2.6 to τw ȳ. Therefore, Hence, ȳ j τw j, j N. (3.18) v j (t) τw j (3.19) for j N, t 0. The similar estimate can be obtained for j N. Together with (3.5), these prove (3.19)forallj Z. The sequence z(t) = τw v(t) is a solution of the equation dz = Lz αz + ατw. (3.20) dt Since z(t) 0(via(3.19) forallj Z), z is not identically zero, and is periodic in t, it follows that z j (t) > 0forallj and t 0. Indeed, suppose that for some t = t 1 and j = j 1, z j1 (t 1 ) = 0. Consider first the case where α>0. Since (dz j1 /dt)(t 1 ) 0andw j1 > 0, we obtain a contradiction in signs in the equation for z j1.ifα = 0, then the equation becomes dz = Lz. (3.21) dt Assuming that z(t) is not strictly positive, we easily obtain that it is identically zero for all j. Wehave(dz j1 /dt)(t 1 ) 0and(Lz) j1 (t 1 ) 0. Then (Lz) j1 (t 1 ) = 0, so all z j (t 1 ) = 0. Since z j1 verifies dz j1 /dt = (Lz) j1, z j1 (t 1 ) = 0, by the uniqueness we find z j1 (t) = 0, t t 1. Combining this with z j (t 1 ) = 0, ( )j Z,wegetz j (t) = 0, ( )j Z,( )t (0, ).
8 88 On the eigenvalue of infinite matrices Thus in both cases, z j (t) is positive for all j and t.wetaket 0suchthat e iβt = u j 0 u j0, (3.22) with j 0 from (3.6), that is, cosβt = u 1 j 0 / u j0 and sinβt = u 2 j 0 / u j0.then,v j0 (t) = u 1 j 0 cosβt u 2 j 0 sin βt = u j0, hence with the aid of (3.6) we obtain the contradiction The first assertion of the theorem is proved for nonreal λ. z j0 (t) = τw j0 u j0 = 0. (3.23) Case 2. Assume now that λ 0 is real and that u is a nonzero bounded solution of (3.1). We suppose that at least one of the elements of the sequence {u j } is negative. Otherwise, we could change the sign of u.weconsiderthesequencev = u + τw,whereτ>0 is chosen such that v 0for j N,butv j0 = 0forsomej 0, j 0 N.Wehave Lv = λv λτw, (3.24) and therefore v j 0forallj by virtue of Lemma 2.5. Indeed, for j N, the inequality holds because of the way we have chosen τ.forj N,oneappliesLemma 2.5 for (3.24) writtenintheform(l λi)v = λτw, j N, withv N 0. If j N, the reasoning is similar. If λ>0, then the equation for v j0 leads to a contradiction in signs. Thus, (3.1) cannot have different-from-zero solutions for real positive λ. (2) If λ = 0, then we define v = u + τw as in Case 2 above. Here u is the solution of (3.1) with λ = 0, that is, Lu = 0. Using the above reasoning for λ 0, we have v j 0, ( )j Z, but it is not strictly positive (at least v j0 = 0). In addition, v satisfies the equation Lv = 0. It follows from Lemma 2.1 that v 0. This implies that u j = τw j,( )j Z. (3) The limiting operators L ± are operators with constant coefficients. The corresponding matrices are (2m + 1)-diagonal matrices with constant elements along each diagonal. The matrices associated to the limiting operators L +, L of L are the transposed matrices, which are composed by the same diagonals reflected symmetrically with respect to the main diagonal. Therefore, the polynomials (P λ )± (σ) fortheoperatorl will be the same as for the operator L.ByvirtueofTheorem 1.2,theoperatorL satisfies the Fredholm property and it has the zero index. We note first of all that (3.2) has a nonzero bounded solution v. Indeed, if such solution does not exist, then by virtue of the solvability conditions, the equation Lu = f (3.25) is solvable for any f. This implies that ImL = E, and hence codim(iml) = 0. Since the index of L is zero, it follows that dim(kerl) = 0. But by part two of the theorem, we get dim(kerl) = 1. This contradictionshows thata nonzeroboundedsolutionv of (3.2) exists and it is exponentially decreasing at infinity (see [2, Theorem 3.2]).
9 We recall next (see Theorem 1.4)that(3.25) is solvable if and only if N. Apreutesei and V. Volpert 89 ( f,v) = 0. (3.26) Case 1. If v 0, then from Lemma 2.1 for equation L v = 0, it follows that v is strictly positive, as claimed. Case 2. If we assume that a nonnegative solution of (3.2) does not exist, then it has an alternating sign. Then we can find a bounded sequence f<0suchthat(3.26)issatisfied. Let u be the corresponding solution of (3.25). There exists a τ (not necessarily positive), such that ũ = u + τw 0for j N, but not strictly positive. Since Lũ = f and f<0, ũ N 0, and ũ j 0asj,byvirtueofLemma 2.5,onefindsũ 0forallj.But for those j where ũ vanish, this leads to a contradiction in signs in the equation. Therefore ũ>0. The theorem is proved. References [1] N. Apreutesei and V. Volpert, Some properties of infinite dimensional discrete operators, Topological Methods in Nonlinear Analysis 24 (2004), no. 1, [2], Solvability conditions for some difference operators, Advances in Difference Equations 2005 (2005), no. 1, [3] A. I. Volpert and V. Volpert, Spectrum of elliptic operators and stability of travelling waves, Asymptotic Analysis 23 (2000), no. 2, [4] A. I. Volpert, V. Volpert, and V. Volpert, Traveling Wave Solutions of Parabolic Systems, Translations of Mathematical Monographs, vol. 140, American Mathematical Society, Rhode Island, N. Apreutesei: Department of Mathematics, Gh. Asachi Technical University of Iaşi, Iaşi, Romania address: napreut@math.tuiasi.ro V. Volpert: Camille Jordan Institute of Mathematics, UMR 5208 CNRS, University Lyon 1, Villeurbanne, France address: volpert@math.univ-lyon1.fr
Existence of Pulses for Local and Nonlocal Reaction-Diffusion Equations
Existence of Pulses for Local and Nonlocal Reaction-Diffusion Equations Nathalie Eymard, Vitaly Volpert, Vitali Vougalter To cite this version: Nathalie Eymard, Vitaly Volpert, Vitali Vougalter. Existence
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationResearch Article Almost Periodic Viscosity Solutions of Nonlinear Parabolic Equations
Hindawi Publishing Corporation Boundary Value Problems Volume 29, Article ID 873526, 15 pages doi:1.1155/29/873526 Research Article Almost Periodic Viscosity Solutions of Nonlinear Parabolic Equations
More informationMATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.
MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:
More informationKrein-Rutman Theorem and the Principal Eigenvalue
Chapter 1 Krein-Rutman Theorem and the Principal Eigenvalue The Krein-Rutman theorem plays a very important role in nonlinear partial differential equations, as it provides the abstract basis for the proof
More informationNOTES ON LINEAR ODES
NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary
More informationResearch Article Almost Periodic Solutions of Prey-Predator Discrete Models with Delay
Hindawi Publishing Corporation Advances in Difference Equations Volume 009, Article ID 976865, 19 pages doi:10.1155/009/976865 Research Article Almost Periodic Solutions of Prey-Predator Discrete Models
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationResearch Article Existence and Uniqueness of Smooth Positive Solutions to a Class of Singular m-point Boundary Value Problems
Hindawi Publishing Corporation Boundary Value Problems Volume 29, Article ID 9627, 3 pages doi:.55/29/9627 Research Article Existence and Uniqueness of Smooth Positive Solutions to a Class of Singular
More informationA brief introduction to ordinary differential equations
Chapter 1 A brief introduction to ordinary differential equations 1.1 Introduction An ordinary differential equation (ode) is an equation that relates a function of one variable, y(t), with its derivative(s)
More informationCompetition of Species with Intra-Specific Competition
Math. Model. Nat. Phenom. Vol. 3, No. 4, 2008, pp. 1-27 Competition of Species with Intra-Specific Competition N. Apreutesei a1, A. Ducrot b and V. Volpert c a Department of Mathematics, Technical University
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationSection 8.2 : Homogeneous Linear Systems
Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av
More informationOn the Solvability Conditions for a Linearized Cahn-Hilliard Equation
Rend. Istit. Mat. Univ. Trieste Volume 43 (2011), 1 9 On the Solvability Conditions for a Linearized Cahn-Hilliard Equation Vitaly Volpert and Vitali Vougalter Abstract. We derive solvability conditions
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
More informationA Perron-type theorem on the principal eigenvalue of nonsymmetric elliptic operators
A Perron-type theorem on the principal eigenvalue of nonsymmetric elliptic operators Lei Ni And I cherish more than anything else the Analogies, my most trustworthy masters. They know all the secrets of
More informationResearch Article Global Dynamics of a Competitive System of Rational Difference Equations in the Plane
Hindawi Publishing Corporation Advances in Difference Equations Volume 009 Article ID 1380 30 pages doi:101155/009/1380 Research Article Global Dynamics of a Competitive System of Rational Difference Equations
More informationCOMPACT OPERATORS. 1. Definitions
COMPACT OPERATORS. Definitions S:defi An operator M : X Y, X, Y Banach, is compact if M(B X (0, )) is relatively compact, i.e. it has compact closure. We denote { E:kk (.) K(X, Y ) = M L(X, Y ), M compact
More informationGiven the vectors u, v, w and real numbers α, β, γ. Calculate vector a, which is equal to the linear combination α u + β v + γ w.
Selected problems from the tetbook J. Neustupa, S. Kračmar: Sbírka příkladů z Matematiky I Problems in Mathematics I I. LINEAR ALGEBRA I.. Vectors, vector spaces Given the vectors u, v, w and real numbers
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationResearch Article The Solution by Iteration of a Composed K-Positive Definite Operator Equation in a Banach Space
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2010, Article ID 376852, 7 pages doi:10.1155/2010/376852 Research Article The Solution by Iteration
More informationGeneralized Eigenvectors and Jordan Form
Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least
More informationResearch Article Frequent Oscillatory Behavior of Delay Partial Difference Equations with Positive and Negative Coefficients
Hindawi Publishing Corporation Advances in Difference Equations Volume 2010, Article ID 606149, 15 pages doi:10.1155/2010/606149 Research Article Frequent Oscillatory Behavior of Delay Partial Difference
More informationStabilization of Distributed Parameter Systems by State Feedback with Positivity Constraints
Stabilization of Distributed Parameter Systems by State Feedback with Positivity Constraints Joseph Winkin Namur Center of Complex Systems (naxys) and Dept. of Mathematics, University of Namur, Belgium
More informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More informationEigenvalue Comparisons for Boundary Value Problems of the Discrete Beam Equation
Kennesaw State University DigitalCommons@Kennesaw State University Faculty Publications 2006 Eigenvalue Comparisons for Boundary Value Problems of the Discrete Beam Equation Jun Ji Kennesaw State University,
More informationComplex Analytic Functions and Differential Operators. Robert Carlson
Complex Analytic Functions and Differential Operators Robert Carlson Some motivation Suppose L is a differential expression (formal operator) N L = p k (z)d k, k=0 D = d dz (0.1) with p k (z) = j=0 b jz
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationResearch Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive and Negative Coefficients
Abstract and Applied Analysis Volume 2010, Article ID 564068, 11 pages doi:10.1155/2010/564068 Research Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationCHAPTER 3. Gauss map. In this chapter we will study the Gauss map of surfaces in R 3.
CHAPTER 3 Gauss map In this chapter we will study the Gauss map of surfaces in R 3. 3.1. Surfaces in R 3 Let S R 3 be a submanifold of dimension 2. Let {U i, ϕ i } be a DS on S. For any p U i we have a
More informationMath 240 Calculus III
Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationPositive Stabilization of Infinite-Dimensional Linear Systems
Positive Stabilization of Infinite-Dimensional Linear Systems Joseph Winkin Namur Center of Complex Systems (NaXys) and Department of Mathematics, University of Namur, Belgium Joint work with Bouchra Abouzaid
More informationLINEAR 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 informationLinear Algebra Lecture Notes-II
Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationODEs Cathal Ormond 1
ODEs Cathal Ormond 2 1. Separable ODEs Contents 2. First Order ODEs 3. Linear ODEs 4. 5. 6. Chapter 1 Separable ODEs 1.1 Definition: An ODE An Ordinary Differential Equation (an ODE) is an equation whose
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationPUTNAM PROBLEMS DIFFERENTIAL EQUATIONS. First Order Equations. p(x)dx)) = q(x) exp(
PUTNAM PROBLEMS DIFFERENTIAL EQUATIONS First Order Equations 1. Linear y + p(x)y = q(x) Muliply through by the integrating factor exp( p(x)) to obtain (y exp( p(x))) = q(x) exp( p(x)). 2. Separation of
More informationThe Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces
Applied Mathematical Sciences, Vol. 11, 2017, no. 12, 549-560 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.718 The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationChap 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 informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationChapter III. Stability of Linear Systems
1 Chapter III Stability of Linear Systems 1. Stability and state transition matrix 2. Time-varying (non-autonomous) systems 3. Time-invariant systems 1 STABILITY AND STATE TRANSITION MATRIX 2 In this chapter,
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationConvergence 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 informationResearch Article On the Blow-Up Set for Non-Newtonian Equation with a Nonlinear Boundary Condition
Hindawi Publishing Corporation Abstract and Applied Analysis Volume 21, Article ID 68572, 12 pages doi:1.1155/21/68572 Research Article On the Blow-Up Set for Non-Newtonian Equation with a Nonlinear Boundary
More informationLinear 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 informationMATH 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 informationConstant coefficients systems
5.3. 2 2 Constant coefficients systems Section Objective(s): Diagonalizable systems. Real Distinct Eigenvalues. Complex Eigenvalues. Non-Diagonalizable systems. 5.3.. Diagonalizable Systems. Remark: We
More informationEigenvalues in Applications
Eigenvalues in Applications Abstract We look at the role of eigenvalues and eigenvectors in various applications. Specifically, we consider differential equations, Markov chains, population growth, and
More informationFunctional Analysis. James Emery. Edit: 8/7/15
Functional Analysis James Emery Edit: 8/7/15 Contents 0.1 Green s functions in Ordinary Differential Equations...... 2 0.2 Integral Equations........................ 2 0.2.1 Fredholm Equations...................
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationA NICE PROOF OF FARKAS LEMMA
A NICE PROOF OF FARKAS LEMMA DANIEL VICTOR TAUSK Abstract. The goal of this short note is to present a nice proof of Farkas Lemma which states that if C is the convex cone spanned by a finite set and if
More informationNonlinear Analysis 71 (2009) Contents lists available at ScienceDirect. Nonlinear Analysis. journal homepage:
Nonlinear Analysis 71 2009 2744 2752 Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na A nonlinear inequality and applications N.S. Hoang A.G. Ramm
More information642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004
642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004 Introduction Square matrices whose entries are all nonnegative have special properties. This was mentioned briefly in Section
More informationResearch Article Solvability of a Class of Integral Inclusions
Abstract and Applied Analysis Volume 212, Article ID 21327, 12 pages doi:1.1155/212/21327 Research Article Solvability of a Class of Integral Inclusions Ying Chen and Shihuang Hong Institute of Applied
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationNOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES
NOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES MIKE BOYLE. Introduction By a nonnegative matrix we mean a matrix whose entries are nonnegative real numbers. By positive matrix we mean a matrix
More informationHonors Differential Equations
MIT OpenCourseWare http://ocw.mit.edu 18.034 Honors Differential Equations Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. UNIT III: HIGHER-ORDER
More informationOrdinary Differential Equation Theory
Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit
More informationSome recent results on controllability of coupled parabolic systems: Towards a Kalman condition
Some recent results on controllability of coupled parabolic systems: Towards a Kalman condition F. Ammar Khodja Clermont-Ferrand, June 2011 GOAL: 1 Show the important differences between scalar and non
More information0.1 Diagonalization and its Applications
.. DIAGONALIZATION AND ITS APPLICATIONS. Diagonalization and its Applications Exercise.. Let A be a -matrix whose characteristic polynomial is A (t) = t t + t +. a) Express A in term of powers A, A, and
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationREGULAR LAGRANGE MULTIPLIERS FOR CONTROL PROBLEMS WITH MIXED POINTWISE CONTROL-STATE CONSTRAINTS
REGULAR LAGRANGE MULTIPLIERS FOR CONTROL PROBLEMS WITH MIXED POINTWISE CONTROL-STATE CONSTRAINTS fredi tröltzsch 1 Abstract. A class of quadratic optimization problems in Hilbert spaces is considered,
More informationResearch Article Convergence Theorems for Common Fixed Points of Nonself Asymptotically Quasi-Non-Expansive Mappings
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2008, Article ID 428241, 11 pages doi:10.1155/2008/428241 Research Article Convergence Theorems for Common Fixed Points of Nonself
More informationCambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information
Introduction Consider a linear system y = Φx where Φ can be taken as an m n matrix acting on Euclidean space or more generally, a linear operator on a Hilbert space. We call the vector x a signal or input,
More informationPutzer s Algorithm. Norman Lebovitz. September 8, 2016
Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),
More informationExistence of Solutions for a Class of p(x)-biharmonic Problems without (A-R) Type Conditions
International Journal of Mathematical Analysis Vol. 2, 208, no., 505-55 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ijma.208.886 Existence of Solutions for a Class of p(x)-biharmonic Problems without
More informationResearch Article Nonlinear Systems of Second-Order ODEs
Hindawi Publishing Corporation Boundary Value Problems Volume 28, Article ID 236386, 9 pages doi:1.1155/28/236386 Research Article Nonlinear Systems of Second-Order ODEs Patricio Cerda and Pedro Ubilla
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationBOUNDED WEAK SOLUTION FOR THE HAMILTONIAN SYSTEM. Q-Heung Choi and Tacksun Jung
Korean J. Math. 2 (23), No., pp. 8 9 http://dx.doi.org/.568/kjm.23.2..8 BOUNDED WEAK SOLUTION FOR THE HAMILTONIAN SYSTEM Q-Heung Choi and Tacksun Jung Abstract. We investigate the bounded weak solutions
More informationNonlinear Systems and Elements of Control
Nonlinear Systems and Elements of Control Rafal Goebel April 3, 3 Brief review of basic differential equations A differential equation is an equation involving a function and one or more of the function
More informationResearch Article On Behavior of Solution of Degenerated Hyperbolic Equation
International Scholarly Research Network ISRN Applied Mathematics Volume 2012, Article ID 124936, 10 pages doi:10.5402/2012/124936 Research Article On Behavior of Solution of Degenerated Hyperbolic Equation
More informationTheorem 1 ( special version of MASCHKE s theorem ) Given L:V V, there is a basis B of V such that A A l
Mathematics 369 The Jordan Canonical Form A. Hulpke While SCHU Rs theorem permits us to transform a matrix into upper triangular form, we can in fact do even better, if we don t insist on an orthogonal
More informationStability and instability of solutions of a nonlocal reaction-diffusion equation when the essential spectrum crosses the imaginary axis
Stability and instability of solutions of a nonlocal reaction-diffusion equation when the essential spectrum crosses the imaginary axis Vitaly Volpert 1, Vitali Vougalter 2 1 Institute Camille Jordan,
More informationNormed Vector Spaces and Double Duals
Normed Vector Spaces and Double Duals Mathematics 481/525 In this note we look at a number of infinite-dimensional R-vector spaces that arise in analysis, and we consider their dual and double dual spaces
More informationResearch Article Localization and Perturbations of Roots to Systems of Polynomial Equations
International Mathematics and Mathematical Sciences Volume 2012, Article ID 653914, 9 pages doi:10.1155/2012/653914 Research Article Localization and Perturbations of Roots to Systems of Polynomial Equations
More information5 Compact linear operators
5 Compact linear operators One of the most important results of Linear Algebra is that for every selfadjoint linear map A on a finite-dimensional space, there exists a basis consisting of eigenvectors.
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More information1. The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ = Ax + Bu is
ECE 55, Fall 2007 Problem Set #4 Solution The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ Ax + Bu is x(t) e A(t ) x( ) + e A(t τ) Bu(τ)dτ () This formula is extremely important
More informationMAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.
MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3 (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers. (a) Define d : V V + {0} by d(x, y) = 1 ξ j η j 2 j 1 + ξ j η j. Show that
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More informationStrong Convergence of the Mann Iteration for Demicontractive Mappings
Applied Mathematical Sciences, Vol. 9, 015, no. 4, 061-068 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.015.5166 Strong Convergence of the Mann Iteration for Demicontractive Mappings Ştefan
More informationObservations on the Stability Properties of Cooperative Systems
1 Observations on the Stability Properties of Cooperative Systems Oliver Mason and Mark Verwoerd Abstract We extend two fundamental properties of positive linear time-invariant (LTI) systems to homogeneous
More informationFixed Point Theorem of Uniformly Locally Geraghty Contractive Mappings on Connected Complete Metric Spaces
International Journal of Mathematical Analysis Vol. 11, 2017, no. 9, 445-456 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7457 Fixed Point Theorem of Uniformly Locally Geraghty Contractive
More informationSufficiency for Essentially Bounded Controls Which Do Not Satisfy the Strengthened Legendre-Clebsch Condition
Applied Mathematical Sciences, Vol. 12, 218, no. 27, 1297-1315 HIKARI Ltd, www.m-hikari.com https://doi.org/1.12988/ams.218.81137 Sufficiency for Essentially Bounded Controls Which Do Not Satisfy the Strengthened
More information1 Background and Review Material
1 Background and Review Material 1.1 Vector Spaces Let V be a nonempty set and consider the following two operations on elements of V : (x,y) x + y maps V V V (addition) (1.1) (α, x) αx maps F V V (scalar
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationSingularities and Laplacians in Boundary Value Problems for Nonlinear Ordinary Differential Equations
Singularities and Laplacians in Boundary Value Problems for Nonlinear Ordinary Differential Equations Irena Rachůnková, Svatoslav Staněk, Department of Mathematics, Palacký University, 779 OLOMOUC, Tomkova
More information