• No results found

On the solvability of initial value problems for nonlinear implicit difference equations

N/A
N/A
Protected

Academic year: 2020

Share "On the solvability of initial value problems for nonlinear implicit difference equations"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

FOR NONLINEAR IMPLICIT DIFFERENCE EQUATIONS

PHAM KY ANH AND HA THI NGOC YEN

Received 18 February 2004

Our aim is twofold. First, we propose a natural definition of index for linear nonau-tonomous implicit difference equations, which is similar to that of linear diff erential-algebraic equations. Then we extend this index notion to a class of nonlinear implicit difference equations and prove some existence theorems for their initial-value problems.

1. Introduction

Implicit difference equations (IDEs) arise in various applications, such as the Leontief dynamic model of a multisector economy, the Leslie population growth model, and so forth. On the other hand, IDEs may be regarded as discrete analogues of diff erential-algebraic equations (DAEs) which have already attracted much attention of researchers.

Recently [1,3], a notion of index 1 linear implicit difference equations (LIDEs) has been introduced and the solvability of initial-value problems (IVPs), as well as multipoint boundary-value problems (MBVPs) for index 1 LIDEs, has been studied. In this paper, we propose a natural definition of index for LIDEs so that it can be extended to a class of nonlinear IDEs. The paper is organized as follows.Section 2is concerned with index 1 LIDEs and their reduction to ordinary difference equations. InSection 3, we study the index concept and the solvability of IVPs for nonlinear IDEs. The result of this paper can be considered as a discrete version of the corresponding result of [4].

2. Index 1 linear implicit difference equations

LetQbe an arbitrary projection onto a given subspaceNof dimensionm−r(1r m−1) inRm. Further, let{v

i}r1and{vj}mr+1be any bases of KerQandN, respectively.

Denote byV =(v1,. . .,vm) a column matrix and denote ˜Q=diag(Or,Im−r), whereOr andIm−rstand forr×rzero matrix and (m−r)×(m−r) identity matrix, respectively. ThenV is nonsingular,Q=VQV˜ 1, and this decomposition depends on the choice of

the bases{vi}m1, that is, onV.

Now, suppose and are two subspaces of the same dimensionm−r(1r m−1) inRm. Then any projections Q

α and onto and can be decomposed

(2)

as Qα=VαQV˜ α−1 and Qβ=VβQV˜ β−1, respectively. Define an operator connecting two subspacesand(connecting operator, for short)Qαβ:=VαQV˜ β−1. Clearly,

Qαβ=QαQαβ=QαβQβ=QαVαVβ−1=VαVβ−1Qβ, QαβQβα=Qα, QβαQαβ=Qβ.

(2.1)

We consider a system of LIDEs

Anxn+1+Bnxn=qn (n0), (2.2)

whereAn,Bn∈Rm×m,qn∈Rmare given and rankAn≡r(1rm−1) for alln0. Let Qn be any projection onto KerAn,Pn=I−Qn and consider decompositionsQn= VnQV˜ n−1 (n0). For definiteness, we putA−1:=A0,Q−1:=Q0,P−1:=P0, andV−1:=

V0. Thus, the connecting operatorsQn−1,n:=Vn−1QV˜ n−1are determined for alln0. Recall that a linear DAE A(t)x+B(t)x=q(t), t∈J:=[t0,T], where A,B∈C(J,

Rm×m),qRm, is said to be of index 1 or transferable (see [4]) if there exists a smooth projectionQ∈C1(J,Rm×m) onto KerA(t) such that the matrixG(t)=A(t) +B(t)Q(t) is nonsingular for allt∈J. It is proved that the index 1 property (transferability) of lin-ear DAEs does not depend on the choice of smooth projections and is equivalent to the conditionS(t)KerA(t)= {0}, whereS(t) := {ξ∈Rm:B(t)ξImA(t)}.

A similar result can be established for LIDEs, namely, the following lemma.

Lemma2.1. The matrixGn:=An+BnQn−1,nis nonsingular if and only if

Sn∩KerAn−1= {0}, (2.3)

where, as in the DAE case,Sn:= {ξ∈Rm:Bnξ∈ImAn}.

The proof ofLemma 2.1repeats that of [3, Lemma 1] with some obvious changes, and uses the fact that condition (2.3) holds if and only ifVnVn−−11Sn∩KerAn= {0}.

Since condition (2.3) does not depend on the representation of connecting operators, we get the following corollary.

Corollary2.2. The nonsingularity ofGndoes not depend on the choice of connecting op-erator, that is, ifQn−1,n:=Vn−1QV˜ n−1andQ¯n−1,n:=V¯n−1Q˜V¯n−1, then both matricesGn:= An+BnQn−1,nandG¯n:=An+BnQ¯n−1,nare singular or nonsingular simultaneously.

Corollary 2.2confirms that it suffices to restrict our consideration to orthogonal pro-jections onto KerAn, as was done in [3]. However, in the mentioned paper, a singular-value decomposition (SVD) ofAnis employed for constructing an orthogonal projection Qnonto KerAnand it seems not to be convenient for a further extension of the index notion to nonlinear cases.Corollary 2.2also allows us to introduce the following notion of index 1 LIDEs, which is quite similar to that of index 1 (transferable) linear DAEs.

Definition 2.3. The LIDEs (2.2) are said to be of index 1 if, for alln0, (i) rankAn=r;

(3)

The main difference between linear index 1 DAEs and linear index 1 IDEs is the fact that the pencil{A(t),B(t)}in the continuous case is always of index 1 for allt∈J, while forn1,{An,Bn}is not necessarily of index 1.

Now, we describe shortly the decomposition technique for index 1 LIDEs. Performing PnG−n1andQnG−n1on both sides of (2.2), respectively, we get

Pnxn+1+PnG−n1Bnxn=PnG−n1qn, (2.4)

QnG−n1Bnxn=Q−n1Gnqn. (2.5)

Further, denotingun=Pn−1xn,vn=Qn−1xn(n0) and observing thatPnGn−1BnQn−1xn= PnG−n1BnQn−1,nQn,n−1xn = PnQn,n−1xn = PnQnQn,n−1xn = 0, we find PnG−n1Bnxn = PnG−n1Bnun. Thus, (2.4) becomes an ordinary difference equation

un+1+PnG−n1Bnun=PnG−n1qn. (2.6)

SinceQnG−n1BnQn−1xn=QnG−n1BnQn−1,nQn,n−1xn=Qn,n−1xn=VnVn−−11Qn−1xn=VnVn−−11vn,

(2.5) is reduced to

vn=Vn−1Vn−1

QnG−n1qn−QnG−n1Bnun

. (2.7)

Finally,

xn=un+vn=

I−Qn−1,nG−n1Bn

un+Qn−1,nG−n1qn. (2.8)

Thus, if (2.2) is of index 1, then, for givenu0=P−1x0=P0x0, we can computeun+1,

vn, andxn(n0) by (2.6), (2.7), and (2.8), respectively. As in the DAEs case, we only need to initialize the P0-component of x0. Further, puttingn=0 in (2.8) and noting

thatV−1=V0,u0=P−1x0=P0x0, we find that a consistent initial valuex0must satisfy a

“hidden” constraint, namely,Q0(I+G−01B0P0)x0=Q0G−01q0.

3. Nonlinear implicit difference equations

We begin this section by recalling the following version of the Hadamard theorem on homeomorphism.

Theorem3.1 [2, page 222]. SupposeF∈C1(X,Y)is a local homeomorphism between two

Banach spacesX,Yandζ(R) :=infxR([F(x)]1)1. Then if

0 ζ(R)dR=+∞,Fis a

(global) homeomorphism ofXintoY.

In particular, if [F(x)]1αx+β for all xX, whereα0, β >0, then F

is a homeomorphism ofX intoY. Further, supposeF=T+H, where T∈C1(X,Y),

[T(x)]1γ, for allxX, andH(x)H(y)Lxy, for allx,yX, then if

Lγ <1,Fis a homeomorphism ofXintoY. Consider a system of nonlinear IDEs

fnxn+1,xn=0 (n0), (3.1)

(4)

Definition 3.2. Equation (3.1) is said to be of index 1 if

In the remainder of this paper, for the sake of simplicity, the norm ofRmis assumed to be Euclidean.

Theorem3.3. Let (3.1) be of index 1. Moreover, suppose that G1

whereq∈Rm is an arbitrary fixed vector. First, observe thatG

nPn=(∂ fn/∂y)Pn+ (∂ fn/ ∂x)Qn−1,nQnPn=(∂ fn/∂y)Pn=∂ fn/∂y, hence G−n1(∂ fn/∂y)=Pn and GnQn=(∂ fn/ ∂x)Qn−1,nQn=(∂ fn/∂x)Qn−1,n, therefore Gn−1(∂ fn/∂x)Qn−1,n=Qn, where Gn, ∂ fn/∂y, ∂ fn/∂xare valued at (u,un+v). Further, sincePn∆u=u,∆v=Qn−1∆v=Qn−1,nQn,n−1∆v,

then by the action ofG−1

n on both sides of (3.6) and using the last observations, we get

u+Qn,n−1∆v=G−n1

u,un+v

(5)

Now, applyingPnandQnto both sides of (3.7), respectively, we find∆u=PnG−n1qand

In the next theorem, without loss of generality, we will use orthogonal projections ontoNn, that is,Qn=VnQV˜ nT andVnVnT=VnTVn=I. In this case,Qn−1,n=Vn−1QV˜ nT

(ii)hn(y,x)is continuously differentiable, moreover

KerAn⊂Ker

(6)

Acknowledgment

The first author thanks Prof. Shao Xiumin and Prof. Liang Guoping for their hospitality during his visit to the Institute of Mathematics, Chinese Academy of Sciences.

References

[1] P. K. Anh and L. C. Loi, On multipoint boundary-value problems for linear implicit non-autonomous systems of difference equations, Vietnam J. Math.29(2001), no. 3, 281–286. [2] M. S. Berger,Nonlinearity and Functional Analysis, Lectures on Nonlinear Problems in

Mathe-matical Analysis. Pure and Applied Mathematics, Academic Press, New York, 1977. [3] L. C. Loi, N. H. Du, and P. K. Anh,On linear implicit non-autonomous systems of difference

equations, J. Difference Equ. Appl.8(2002), no. 12, 1085–1105.

[4] R. M¨arz,On linear differential-algebraic equations and linearizations, Appl. Numer. Math.18

(1995), no. 1–3, 267–292.

Pham Ky Anh: Department of Mathematics, Mechanics, and Informatics, College of Science, Vietnam National University, 334 Nguyen Trai, Thanh Xuan, Hanoi, Vietnam

E-mail address:[email protected]

Ha Thi Ngoc Yen: Department of Applied Mathematics, Hanoi University of Technology, 1 Dai Co Viet, 10000 Hanoi, Vietnam

References

Related documents

Abstracts t pm Abstracts 3rd Congress of the Spanish Society of Developmental Biology, M?laga, 2006 S166 Abstracts Abstracts S167 Hormone and light control of flowering MIGUEL A

International Journal of Scientific Research in Computer Science, Engineering and Information Technology CSEIT1831398 | Received 10 Dec 2017 | Accepted 22 Dec 2017 | November December

Table 4 ALCESTE analysis: significant words with chi-square value of 30 and above by alphabetical order A '+' sign indicates that this representative word includes other words from

'Goods in the world have shared meanings because conception and creation are social processes'.42 Moreover, these shared social meanings and conceptions of justice

of pages in Wikipedia show a similar pattern of evolution in both the number of contributors (who spend effort in creating or updating the pages) and the resulting output, in terms

Countries where the bankruptcy law is very lax suffer from very high interest rates due to the lack of protection to creditors and, therefore, have low

Moreover, the effects of attention (attended vs. ignored) and reflection (identical images vs. left-right reflections) were strictly additive: The priming advantage for same

The experiment results by using two palm print databases determine that the proposed method of class specific information with 2D-PCA, alternate 2DPCA, Kernel PCA and