• Tidak ada hasil yang ditemukan

vol21p76-84. 118KB Jun 04 2011 12:06:11 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "vol21p76-84. 118KB Jun 04 2011 12:06:11 AM"

Copied!
9
0
0

Teks penuh

(1)

POSITIVE DEFINITE SOLUTION OF THE MATRIX EQUATION

X =Q+AH(IXC)−δA

GUOZHU YAO†, ANPING LIAO, AND XUEFENG DUAN§

Abstract. We consider the nonlinear matrix equationX=Q+AH(IXC)−δA (0< δ1), whereQis ann×npositive definite matrix,Cis anmn×mnpositive semidefinite matrix,I is the m×midentity matrix, andAis an arbitrarymn×nmatrix. We prove the existence and uniqueness of the solution which is contained in some subset of the positive definite matrices under the condition thatI⊗Q > C. Two bounds for the solution of the equation are derived. This equation is related to an interpolation problem whenδ= 1. Some known results in interpolation theory are improved and extended.

Key words. Nonlinear matrix equation, Positive definite solution, Interpolation theory.

AMS subject classifications.15A24, 65H05.

1. Introduction. We consider the positive definite solutionX of the nonlinear matrix equation

X=Q+AH(IXC)−δA, 0< δ 1,

(1.1)

where Q is an n×n positive definite matrix, A is an mn×n complex matrix, C

is an mn×mn positive semidefinite matrix, I is the m×m identity matrix, ⊗ is

the Kronecker product, andAH denotes the conjugate transpose of matrixA. When

δ= 1, (1.1) is connected to an interpolation problem (see [1]-[3]). The special cases

of this equation have many applications in various areas, including control systems, ladder networks, dynamic programming, stochastic filtering, statistics (see [4]).

In recent years, many authors have been greatly interested in studying both the theory and numerical aspects of the positive definite solutions of the nonlinear matrix equations of the form (1.1) (see [1], [3]-[18]). Some special cases of (1.1) have been

investigated. When δ = 1, Ran et al [1] showed that (1.1) has a unique positive

definite solution by using a reduction method and Sun [3] obtained the perturbation

Received by the editors on June 10, 2009. Accepted for publication on July 31, 2010. Handling

Editors: Roger A. Horn and Fuzhen Zhang.

College of Mathematics and Computing Science, Changsha University of Science and Technology,

Changsha 410114, P.R. China (gzyao@163.com). Supported by Hunan Provincial Educational Department Science Foundation (10C0370).

College of Mathematics and Econometrics, Hunan University, Changsha 410082, P.R. China §School of Mathematics and Computational Science, Guilin University of Electronic Technology,

Guilin 541004, P.R. China.

(2)

bounds and the residual bounds for an approximate solution of (1.1). In addition,

Duan [17] proved that (1.1) always has a unique positive definite solution whenC= 0.

Hasanov [11] obtained that (1.1) has a unique positive definite solution under rigorous

conditions when C = 0 and m = 1. In this article, we first claim that (1.1) always

has a unique positive definite solution and then use a new approach that is different from [1] to prove our conclusions in Sections 2 and 3. We also obtain some bounds for the unique positive definite solution of (1.1).

Throughout this paper, X > 0 (X ≥ 0) denotes that the matrix X is

posi-tive definite (semidefinite). B⊗C denotes the Kronecker product of B and C. If

B−C is positive definite (semidefinite), then we write B > C (B ≥ C). We use

λM(B) (σM(B)) andλm(B) (σm(B)) to denote the maximal and minimal

eigenval-ues (singular valeigenval-ues) of an n×n positive definite matrix B, respectively. Let P(n)

denote the set of n×n positive definite matrices, ϕ(n) denote the matrix set

de-fined by {X ∈ P(n) | I ⊗X > C}, [B, C] = {X ∈ P(n) | B ≤ X ≤ C} and

(B, C) = {X ∈ P(n) | B < X < C}. Unless otherwise stated, we suppose that

I⊗Q > C, the solutions of the matrix equations in this paper are positive definite and the solution of (1.1) is inϕ(n).

2. The existence of a unique solution. In this section, we prove that (1.1) always has a unique solution. We begin with some lemmas.

Lemma 2.1. (1.1)is equivalent to the following nonlinear matrix equation

Y = ¯Q+ ¯AH(I⊗Y)−δ ¯ A,

(2.1)

whereY =I⊗X−C, Q¯=I⊗Q−C, A¯=I⊗A.

Proof. Taking the Kronecker product ofIwith both left sides of (1.1), we obtain

I⊗X−I⊗[AH(I⊗X−C)−δ

A] =I⊗Q.

Then

I⊗X−C−(I⊗AH)[I⊗(I⊗X−C)−δ](

I⊗A) =I⊗Q−C.

(2.2)

Noting thatI⊗AH= (IA)H andIY−δ = (IY)−δ, we get (2.1) by substituting

Y,Q¯ and ¯AforI⊗X−C,I⊗Q−C andI⊗Ain (2.2), respectively. Furthermore,

(2.1) has a solution ¯Y =I⊗X¯ −Cif ¯X is a solution of (1.1). For the converse, it is easy to verify that (1.1) has a solution ¯X =Q+AHY¯−δAif ¯Y is a solution of (2.1).

Lemma 2.2. ([19, p.2]). If A ≥ B > 0 (or A > B > 0), then Bα >0

(or> Bα>0) for all 0 < α1, and 0 < Aα Bα (or0 < Aα < Bα) for all

(3)

To discuss the solution of (1.1), we define maps f andF as follows:

f(X) =Q+AH(I⊗X−C)−δ

A, X ∈ϕ(n),

(2.3)

and

F(Y) = ¯Q+ ¯AH(IY)−δA,¯ Y P(mn).

(2.4)

Observe that the solutions of (1.1) and (2.1) are fixed points off in ϕ(n) and F in

P(mn), respectively. Let

fk(X) =f[fk−1

(X)], Fk(Y) =F[Fk−1

(Y)], k= 2,3, . . . .

Lemma 2.3. The mapF has the following properties:

(1) IfY1≥Y2≥0, thenF(Y2)≥F(Y1)≥0 andF2(Y1)≥F2(Y2)≥0.

(2) For any matrixY >0,Q¯ ≤F2(Y)≤F( ¯Q),and the set{Y |Q¯≤Y ≤F( ¯Q)}

is mapped into itself byF.

(3) The sequence{F2k( ¯Q)}

k=0 is an increasing sequence of positive definite

ma-trices converging to a positive definite matrix Y−

, which is a fixed point of

F2, i.e., Y− =

F2(Y−), and the sequence {

F2k+1( ¯Q)}

k=0 is a decreasing

sequence of positive definite matrices converging to a positive definite matrix

Y+, which is also a fixed point ofF2, i.e.,Y+=F2(Y+).

(4) F maps the set {Y |Y−

≤Y ≤Y+} into itself. In particular, any solution

of(2.1)is in between Y− and

Y+, and if Y− =

Y+, then (2.1)has a unique solution.

Proof. The proof is similar to that of Theorem 2.2 of [6] and is omitted here.

From (4) of Lemma 2.3, we know that (2.1) has a unique solution ifY−

=Y+.

Next we will prove thatY−

=Y+. Lemma 2.4. Let η(t) = (1−t)λm( ¯Q)

tλM[F( ¯Q)]. Then we have, for anyY >0 andt∈(0,1),

F2(tY)≥t[1 +η(t)]F2(Y).

Proof. By (2) of Lemma 2.3, for anyY >0, we have

F2(Y)≤F( ¯Q)≤λM[F( ¯Q)]I.

(2.5)

Hence

F2(tY)−t[1 +η(t)]F2(Y) = ¯Q+ ¯AH[I⊗F(tY)]−δ ¯

(4)

= (1−t) ¯Q+ ¯AH[I⊗( ¯Q+t−δ ¯

AH(I⊗Y)−δ ¯ A)]−δ ¯

A

−tA¯H[I⊗F(Y)]−δ¯

A−tη(t)F2(Y) = (1−t) ¯Q+tA¯H[I⊗(t1δQ¯+t−δ+

1

δA¯H(I⊗Y)−δA¯)]−δA¯ −tA¯H[IF(Y)]−δA¯(t)F2(Y).

Since 0< t1δ <1 and 0< t−δ+

1

δ <1, we have

t1δQ <¯ Q, t¯ −δ+

1

δ[ ¯AH(I⊗Y)−δA¯]<A¯H(I⊗Y)−δA.¯ From Lemma 2.2 it follows that

[t1δQ¯+t−δ+

1

δA¯H(I⊗Y)−δA¯]−δ ≥[ ¯Q+ ¯AH(I⊗Y)−δA¯]−δ, (2.6)

which implies that

[I⊗(t1δQ¯+t−δ+

1

δA¯H(I⊗Y)−δA¯)]−δ ≥[I⊗( ¯Q+ ¯AH(I⊗Y)−δA¯)]−δ. (2.7)

Hence, combining (2.5), (2.6) and (2.7), we have

F2(tY)−t[1 +η(t)]F2(Y) ≥ (1−t) ¯Q−tη(t)F2(Y)

≥ (1−t)λm( ¯Q)I−tη(t)λM[F( ¯Q)]I

= (1−t)λm( ¯Q)I−t(1−t)λm( ¯Q)

tλM[F( ¯Q)] λM[F( ¯Q)]I

= 0,

i.e.,F2(tY)≥t[1 +η(t)]F2(Y).

Lemma 2.5. For any Y10 andY20,we have λM(Y1)Y2λm(Y2)Y1.

Proof. For anyY1≥0 andY2≥0, it follows that

Y2≥λm(Y2)I, λM(Y1)I≥Y1. Hence

λM(Y1)Y2≥λM(Y1)λm(Y2)I≥λm(Y2)Y1.

Theorem 2.6. (1.1) always has a unique positive definite solution X¯ and the

sequence{fk(X0)}∞k=0converges tofor any X0∈ϕ(n), where the mapf is defined

by(2.3).

Proof. We first consider (2.1) since (1.1) is equivalent to (2.1) according to Lemma

2.1. From Lemma 2.3, we know that there exist positive definite matrices Y−

P(mn) andY+P(mn) such thatY+Y

and

lim

k→∞

F2k( ¯Q) =Y−

, lim

k→∞

(5)

We also know that the matricesY− and

Y+ are fixed points ofF2, i.e.,

Y−

=F2(Y− )

and

Y+=F2(Y+).

By Lemma 2.5,Y− λm(Y−)

λM(Y+)Y

+,we define

t0= sup{t|Y−≥tY+}.

Evidently, 0< t0<+∞, we now prove thatt0≥1. Assume that 0< t0<1, Y−≥

t0Y+. By Lemmas 2.3 and 2.4, we have

Y−

=F2(Y−

)≥F2(t0Y+)≥t0[1 +η(t0)]F2(Y+) =t0[1 +η(t0)]Y+. (2.8)

Sincet0[1 +η(t0)]> t0, (2.8) is contradictory to the definition oft0, and therefore

t0≥1, Y−=Y+.

Let ¯Y = Y+ (or Y−

). We know that lim

k→∞

Fk( ¯Q) = ¯Y is the unique solution of

(2.1) by Lemma 2.3. Therefore, ¯X=Q+AHY¯−δAis the unique solution of (1.1) by

Lemma 2.1.

It remains to prove that the sequence{Fk(Y0)}∞k=0 converges to ¯Y for anyY0 in

P(mn). From Lemma 2.3, we have

¯

Q≤F2(Y0)≤F( ¯Q). (2.9)

TakingF in (2.9) yields

F2( ¯Q)≤F3(Y0)≤F( ¯Q).

And takingF in (2.9) repeatedly yields

F2k−2

( ¯Q)≤F2k(Y0)≤F2k−1( ¯Q), k= 1,2,3, . . . ,

F2k( ¯Q)F2k+1(Y

0)≤F2k−1( ¯Q), k= 1,2,3, . . . . It follows from the convergence of {Fk( ¯Q)}

k=0 to the unique solution ¯Y that the

sequence{Fk(Y0)}∞k=0 converges to ¯Y for anyY0∈P(mn). From the mapsf andF defined by (2.3) and (2.4), we have

(6)

whereX0∈ϕ(n), Y0=I⊗X0−C∈P(mn). Hence lim

k→∞[

I⊗fk(X

0)] = lim

k→∞

Fk(Y

0) +C

= Y¯ +C

= Q¯+ ¯AH(IY¯)−δA¯+C

= I⊗(Q+AHY¯−δA)

= I⊗X,¯

i.e., lim

k→∞

fk(X

0) = ¯X.

3. Some bounds for the unique solution. In this section, we present two bounds for the unique solution (1.1).

Theorem 3.1. Letbe the unique positive definite solution of (1.1). Then

¯

X ∈[f2(Q), f(Q)].

Proof. Let ¯Y = I⊗X¯ −C. We know that ¯Y is the unique positive definite solution of (2.1) by Lemma 2.1, i.e.,

¯

Y = ¯Q+ ¯AH(I⊗Y¯)−δ ¯ A.

Thus

¯

Y ≥Q,¯

which implies that

¯

Y−δ ¯ Q−δ

.

Thus we have

¯

Y = ¯Q+ ¯AH(ImY¯)−δA¯Q¯+ ¯AH(ImQ¯)−δA.¯

Hence

¯

Q≤Y¯ ≤F( ¯Q).

(3.1)

From Lemma 2.2 it follows that

[F( ¯Q)]−δ

≤Y¯−δ

≤Q¯−δ ,

which implies that

¯

Q+ ¯AH[I⊗F( ¯Q)]−δ¯

A≤Q¯+ ¯AH(I⊗Y¯)−δ ¯

A≤Q¯+ ¯AH(I⊗Q¯)−δ ¯

A,

i.e.,

¯

(7)

Since

F2( ¯Q) =I⊗f2(Q)−C, F( ¯Q) =I⊗f(Q)−C,

we have

I⊗f2(Q)−C≤I⊗X¯−C≤I⊗f(Q)−C,

i.e., ¯X ∈[f2(Q), f(Q)].

Theorem 3.2. Letbe the unique positive definite solution of(1.1). Then

I⊗X¯ ∈[αI+C, βI+C],

where the pair (α, β)is a solution of the system

α = λm( ¯Q) +σ2m(A)β

−δ

, β = λM( ¯Q) +σ2

M(A)α

−δ.

Proof. Let ¯Y =I⊗X¯−C. We know that ¯Y is the unique solution of (2.1). From ¯

A=I⊗A, we haveσm(A¯) =σm(A), σM(A¯) =σM(A). Define the sequences{αs} and{βs} as follows:

α0 = λm( ¯Q),

β0 = λM( ¯Q) +σ2M(A¯)λ

−δ

m( ¯Q), αs = λm( ¯Q) +σ2m(A¯)β

−δ

s−1,

βs = λM( ¯Q) +σ2M(A¯)α

−δ

s−1, s= 1,2, . . . .

We will prove that the sequences {αs} and {βs} are monotonically increasing and

monotonically decreasing, respectively. Obviously,

0< α0< β0. Hence

α1 = λm( ¯Q) +σ2m(A¯)β

−δ

0 ≥α0,

β1 = λM( ¯Q) +σ2M(A¯)α

−δ

0 =β0.

Suppose thatαk≥αk−1, βk ≤βk−1.Then

αk+1 = λm( ¯Q) +σm2(A¯)β

−δ

k ≥λm( ¯Q) +σ

2

m(A¯)β

−δ

k−1=αk,

βk+1 = λM( ¯Q) +σM2 (A¯)α

−δ

k ≤λM( ¯Q) +σM2 (A¯)α

−δ

(8)

Next, we will prove that the unique solution ¯Y of (2.1) lies in [αsI, βsI], for

s= 0,1,2, . . .. It is easy to see that ¯

Q≤Y¯ ≤Q¯+ ¯AH(I⊗Q¯)−δ¯ A.

(3.2)

By ¯Q≥σm( ¯Q)I=α0I, we have ¯Y ≥α0I and ¯

Q+ ¯AH(IQ¯)−δA¯ Q¯+λ−δ

m( ¯Q) ¯AHA¯

≤ [λM( ¯Q) +λ−δ

m( ¯Q)σ2M(A¯)]I

= β0I.

(3.3)

Combining (3.2) and (3.3), we have ¯Y ∈[α0I, β0I]. Suppose that ¯Y ∈ [αkI, βkI]. Then

¯

Y = Q¯+ ¯AH(IY¯)−δA¯

≥ Q¯+β−δ

k A¯HA¯

≥ [λm( ¯Q) +β−δ

k σ2m(A¯)]I

= αk+1I

and

¯

Y = Q¯+ ¯AH(IY¯)−δA¯

≤ Q¯+α−δ k A¯

HA¯

≤ [λM( ¯Q) +α−δ

k σ2M(A¯)]I

= βk+1I.

Consequently, the sequences{αs} and {βs} are convergent. Let α= lim

s→∞

αs, β = lim

s→∞βs. Then ¯Y ∈[αI, βI]. Since ¯Y =I⊗ ¯

X−C, we have thatIm⊗X¯ belongs to

[αI+C, βI+C].

Acknowledgment. The authors would like to thank the referees for the valuable comments and suggestions.

REFERENCES

[1] A.C.M. Ran and M.C.B. Reurings. A nonlinear matrix equation connected to interpolation theory. Linear Algebra and its Applications, 379:289–302, 2004.

[2] L.A. Sakhnovich. Interpolation Theory and Its Applications, Mathematics and Its Applications. vol. 428, Kluwer Academic, Dordrecht, 1997.

[3] J.G. Sun. Perturbation analysis of the matrix equationX=Q+AH(XbC)−1A.Linear Algebra

and its Applications, 372:33–51, 2003.

[4] A. Ferrante and B.C. Levy. Hermitian solutions of the equationX =Q+N∗X−1N. Linear

Algebra and its Applications, 247:359–373, 1996.

(9)

[6] S.M. El-Sayed and A.C.M. Ran. On an iterative method for solving a class of nonlinear matrix equations. SIAM J. Matrix Anal. Appl., 23:632–645, 2001.

[7] S.M. El-Sayed and M.A. Ramadan. On the existence of a positive definite solution of the matrix equationX+A∗X− 1

2mA=I.Int. J. Comp. Math., 76:331–338, 2001.

[8] C.H. Guo and P. Lancaster. Iterative solution of two matrix equations.Math. Comput., 68:1589– 1603, 1999.

[9] D.J. Gao and Y.H. Zhang. On the Hermitian positive definite solutions of the matrix equation X−A∗XqA=Q(q >0).Mathematica Numerical Sinica, 29:73–80, 2007.

[10] V.I. Hasanov. Solutions and perturbation theory of nonlinear matrix equations.Ph. D. Thesis, Sofia, 2003.

[11] V.I. Hasanov. Positive definite solutions of the matrix equationsX±ATX−qA=Q, Linear Algebra and its Applications, 404:166-182, 2005.

[12] I.G. Ivanov, V.I. Hasanov and F. Uhilg. Improved methods and starting values to solve the matrix equationsX±A∗X−1A=I iteratively. Math. Comput., 74:263-278, 2004.

[13] I.G. Ivanov. On positive definite solutions of the family of matrix equationsX+A∗X−nA=Q. J. Comput. Appl. Math., 193:277-301, 2006.

[14] X.G. Liu and H. Gao. On the positive definite solutions of the matrix equationXs±ATX−tA= In.Linear Algebra and its Applications, 368:83-97, 2003.

[15] A.P. Liao. On positive definite solutions of the matrix equationX+AHX−nA=I. Numerical Mathematics -A Joural of Chinese Universities, 26:156-161, 2004.

[16] A.P. Liao, X.F. Duan and J.R. Shen. Hermitian positive definite solutions of the matrix equation X+A∗X−qA=Q.Mathematica Numerica Sinica,4:369-378, 2008.

[17] X.F. Duan, A.P. Liao and B. Tang. On the nonlinear matrix equationX−Pmi=1A∗

iXiδAi=Q. Linear Algebra and its Applications, 429:110-121, 2008.

Referensi

Dokumen terkait

Suatu sistem terdiri dari sejumlah komponen yang saling berinteraksi yangD. artinya saling bekerja sama dalam membentuk satu

Penelitian Belkaoui (1989) dalam Retno (2006) menemukan hasil, bahwa (1) pengung- kapan sosial mempunyai hubungan yang po- sitif dengan kinerja sosial perusahaan yang

Hasil wawancara dengan Dede Soepandi, Pemilik Industri Tahu, Tanggal 28 Mei 2013, pukul 13.05.. dibiarkan air limbah akan berubah warnanya menjadi coklat kehitaman dan

Pada perancangan sistem ini akan dibuat suatu program yang dapat dijalankan pada PC maupun laptop, yang digunakan untuk simulasi pencarian rute terpendek, rute yang

4.875.000.000,- (Empat Milyar Delapan Ratus Tujuh Puluh Lima Juta Rupiah) Pada Satker Balai Lalu Lintas Angkutan jalan, Sungai, Danau dan Penyeberangan Palu, maka dengan ini

[r]

[r]

[r]