Perturbation bounds for the matrix equation $X + A^* \widehat{X}^{-1} A = Q$
Vejdi Hasanov

TL;DR
This paper derives perturbation bounds for the maximal positive definite solution of a specific matrix equation involving block matrices, with modifications for certain norm conditions, supported by numerical examples.
Contribution
It provides new perturbation bounds for solutions of a complex matrix equation, including cases where the norm condition is not met.
Findings
Perturbation bounds for the maximal positive definite solution are established.
A modified bound is derived for cases where the norm condition is violated.
Numerical examples illustrate the theoretical results.
Abstract
Consider the matrix equation , where is an Hermitian positive definite matrix, is an matrix, and is the block diagonal matrix with on its diagonal. In this paper, a perturbation bound for the maximal positive definite solution is obtained. Moreover, in case of a modification of the main result is derived. The theoretical results are illustrated by numerical examples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · Mathematical Inequalities and Applications
Perturbation bounds for the matrix equation
Vejdi Hasanov
Faculty of Mathematics and Informatics,
Shumen University, Shumen 9712, Bulgaria,
e-mail: [email protected]
(02.03.2018)
Abstract
Consider the matrix equation , where is an Hermitian positive definite matrix, A is an matrix, and is the block diagonal matrix with on its diagonal. In this paper, a perturbation bound for the maximal positive definite solution is obtained. Moreover, in case of a modification of the main result is derived. The theoretical results are illustrated by numerical examples.
Keywords: Nonlinear matrix equation; Positive definite solutions; Maximal solution; Perturbation bounds.
AMS Subject Classification: 15A24; 65H05; 47H14
1 Introduction
In this paper we study for perturbation bounds the matrix equation
[TABLE]
where is an Hermitian positive definite matrix, is an matrix, is the block diagonal matrix defined by , in which is matrix, and is the conjugate transpose of a matrix .
Eq. (1) can be write as
[TABLE]
where are matrices, and
[TABLE]
Moreover, Eq. (1) can be reduced to
[TABLE]
by multiplying both hand side of (1) with the matrix , where is the identity matrix. Thus, Eq. (1) is solvable if and only if Eq. (3) is solvable.
The maximal positive definite solution of Eq. (1) with have many applications in ladder networks, control theory, dynamic programming, stochastic filtering, etc., see for instance [1, 2, 3] and the references therein. Since 1990, the Eq. (1) with has been extensively studied, and the research results mainly concentrated on the following: sufficient and necessary conditions for the existence of a positive definite solution [1, 2, 4]; numerical methods for computing the positive definite solution [3, 5, 6, 7]; properties of the positive definite solution [3, 4]; and perturbation bounds for the positive definite solution [8, 9, 10, 11, 12].
Eq. (3) is introduced by Long et al. [13] for and by He and Long [14] for generale case. Later Eqs. (1) and (3) are investigated by many authors [15, 16, 17, 18, 19, 20, 21, 22]. Bini et al. [23] have considered the equation arising in Tree-Like stochastic processes.
Long et al. [13] have given some necessary and sufficient conditions for the existence of a positive definite solution of Eq. (3) in case of , and proposed basic fixed point iteration and its inversion free variant for finding the largest positive definite solution to that equation. Vaezzadeh et al. [18] have considered inversion free iterative methods for (1) when , also. Hasanov and Ali [19] improved the results of Vaezzadeh et al. (in [18]) and gave convergence rate of the considered methods. Popchev et al. [16, 17] have made a perturbation analysis of (3) for .
He and Long [14] have proposed a basic fixed point iteration and its inversion free variant method for finding the maximal positive definite solution to Eq. (3). Hasanov and Hakkaev in [20] considered the Newton’s method for Eq. (1) and in [21] gave convergence rate of the basic fixed poind iteration and its two inverse free variants, and considered a modification of Newton’s method with linear rate of convergence. Duan et al. [15] have derived a perturbation bound for the maximal positive definite solution of Eq. (3) based on the matrix differentiation. Hasanov and Borisova [22] obtained two perturbed bounds, which do not require the maximal solution to the perturbed or the unperturbed equations. In addition, many authors have investigated similar or more general nonlinear matrix equations [24, 25], [26, 27], [28, 29], [30], [31], and [32, 33].
Motivated by the work in the above papers, we continue to study Eq. (1). Here, we derive new perturbation bounds for the maximal solution to Eq. (1) by generalization of the results in [11, 12]. Our bounds are much less expensive for computing because they use very simple formulas.
The rest of the paper is organized as follows. In Section 2 we give some preliminaries for the perturbation analysis. The main result and some known perturbation bounds are presented in Section 3. Three illustrative examples are provided in Section 4. The paper closes with concluding remarks in Section 5.
Throughout this paper, we denote by the set of all Hermitian matrices. The notation means that is positive definite (semidefinite). If (or ) we write (or ). (or ) stands for the identity matrix of order . A Hermitian solution we call maximal one if for an arbitrary Hermitian solution . The symbols , , , and stand the spectral radius, the spectral norm, the Frobenius norm, and any unitary invariant matrix norm, respectively. For complex matrix and a matrix , is a Kronecker product. Finally, for a matrix , we denote with the block diagonal matrix with on its diagonal, i.e. .
2 Statement of the problem and preliminaries
It is proved in [14] that if Eq. (3) has a positive definite solution, then it has a maximal Hermitian solution . Moreover, if , then Eq. (3) with has maximal positive definite solution , , and it’s an unique solution with these properties. These results are valid for Eq. (1) also, i.e., if Eq. (1) has a positive definite solution, then it has a maximal solution . If , then Eq. (1) has maximal positive definite solution , , and it’s a unique solution with these properties. Moreover, these results have been generalized to equation by Yin et al. in [31].
Now, we show that the condition for existing of maximal positive definite solution , for which can be replaced with .
Lemma 2.1**.**
If , then Eq. (3) has a maximal solution and . Moreover, for any other solution .
Proof. For , we define a set of matrices as follows
[TABLE]
We consider a map . Thus, all the solutions of Eq. (3) are fixed points of . The map is continuous on . We prove that .
Let , then
[TABLE]
Therefore, and according to Schauder’s fixed point theorem [35] there exists a matrix such that , i.e., is a solution of Eq. (3). It is obviously that the maximal solution . Now, we prove that is a unique solution in .
Let and are two solution of Eq. (3) in . We have
[TABLE]
Since , then .
Remark 2.2**.**
By Lemma 2.1 we have, if , then Eq. (1) has a maximal solution and . Moreover, is a unique solution in .
Hasanov and Hakkaev in [20] have obtained
[TABLE]
Moreover, we have (see [25])
[TABLE]
Lemma 2.3**.**
[34]** Let , , be matrices, and . Then
- (a)
if , then the equation has a unique solution , and , when ; 2. (b)
if there is some such that is positive definite, then .
Lemma 2.4**.**
Let be a positive definite solution of Eq. (1) with . If
[TABLE]
then , i.e., the maximal solution is a unique positive definite solution which satisfy the condition (6).
Proof. Let be a positive definite solution of Eq. (1) which satisfy the condition (6) and be the maximal solution. Since and , we have
[TABLE]
Thus,
[TABLE]
which implies that is a solution of the equation , where
[TABLE]
By Lemma 2.4 (a) we have that . But, is the maximal solution, i.e. . Hence, .
Remark 2.5**.**
We have following hypothesis: the maximal solution is a unique positive definite solution of Eq. (1) which satisfy the condition (4).
Lemma 2.6**.**
Let , be a positive definite solution of Eq. (1). If there is a positive definite matrix such that \big{\|}\widehat{PX_{+}^{-1}}AP^{-1}\big{\|}<1, then is a maximal solution, i.e., .
Proof. Let , be a positive definite solution of Eq. (1) and is a positive definite matrix such that \big{\|}\widehat{PX_{+}^{-1}}AP^{-1}\big{\|}<1. Then
[TABLE]
Therefore, is a positive definite solution of the equation
[TABLE]
with and .
Since
[TABLE]
by Lemma 2.4 and (5), it follows that is a maximal solution of Eq. (7). Let be a maximal solution of Eq. (1), i.e. . Then is a positive definite solution of Eq. (7) and , i.e., . Hence, .
Consider the perturbed equation
[TABLE]
where , . The matrices and , () are small perturbations in the matrix coefficients and in Eq. (1), such that .
We suppose that Eq. (1) has a maximal positive definite solution . The main question is: how much are the perturbations and in the coefficient matrices and , respectively such that Eq. (8) has a maximal positive definite solution ? The second question is: how much is the perturbation , when we have small perturbations and in and ?
3 Perturbation bounds
The questions in the preview section for Eq. (1) in case of have been investigated by several authors [8, 9, 10, 11, 12]. Hasanov and Ivanov in [11] have obtained the following result.
Theorem 3.1**.**
[11, Theorem 2.1]** Let be coefficient matrices for equations and . Let
[TABLE]
where is the maximal positive definite solution of the equation . If
[TABLE]
then , the perturbed matrix equation has the maximal positive definite solution , and
[TABLE]
Moreover, in [11] has been obtained similar result for equation , which was generalized for equation by Yin and Fang [24].
Now, we derive new perturbation bounds for the maximal solution to Eq. (1) by generalization of Theorem 3.1 and its modification in [12]. Firstly, we define for an matrix and a unitary invariant norm . Note that, the values of in cases of the spectral norm and the Frobenius norm , are and , respectively.
Theorem 3.2**.**
Let be coefficient matrices for Eqs. (1) and (8). Let
[TABLE]
where K_{U}=\min\big{\{}\theta_{U}(m)\big{\|}\widehat{X_{L}^{-1}}A\big{\|},\big{\|}\widehat{X_{L}^{-1}}A\big{\|}_{U}\big{\}} and is the maximal positive definite solution of Eq. (1). If
[TABLE]
then , the perturbed equation (8) has a maximal positive definite solution , and
[TABLE]
Proof. Let be an arbitrary positive definite solution of Eq. (8). Subtracting (1) from (8) gives
[TABLE]
where . Using the equalities
[TABLE]
we receive
[TABLE]
Consider a map defined by following way:
[TABLE]
Using the inequalities in (9), we have
[TABLE]
[TABLE]
which implies that
[TABLE]
The square equation
[TABLE]
has two positive real roots with the smaller one
[TABLE]
We define
[TABLE]
For each we have
[TABLE]
Thus is a nonsingular matrix and
[TABLE]
According to definition for , for each we obtain
[TABLE]
where the last inequality is due to the fact that is a solution of the square equation (13).
Thus for every , which means that . Moreover, is a continuous mapping on . According to Schauder’s fixed point theorem [35] there exists a such that . Hence there exists a solution of Eq. (11) for which
[TABLE]
Let
[TABLE]
Since is a solution of Eq. (1) and is a solution of Eq. (11), then is a Hermitian solution of the perturbed equation (8).
First, we prove that is a positive definite solution, and second we prove that , i.e, is the maximal positive definite solution of Eq. (8).
Since is a positive definite matrix, then there exists a positive definite matrix square root of . From (16) we receive
[TABLE]
Since
[TABLE]
then . Thus, is a positive definite solution of Eq. (8). We have to prove that .
Consider \big{\|}\widehat{\tilde{X}_{+}^{-1}}\tilde{A}\big{\|}. By (12), (14), and (15), we have
[TABLE]
Thus, from (5) and Lemma 2.4 (or Lemma 2.6 with ) it follows that is the maximal positive definite solution of Eq. (8), i.e., and .
Note that and in some cases of Eq. (1) the coefficients and have not satisfied the condition .
Example 3.3**.**
Consider Eq. (1) with
[TABLE]
where
[TABLE]
is the maximal solution.
For Example 3.3 we have . Hence, the bound in Theorem 3.2 is not applicable. But , where .
Remark 3.4**.**
According to Remark 2.2, from \big{\|}\widehat{\sqrt{Q^{-1}}A}\sqrt{Q^{-1}}\big{\|}<\frac{1}{2} it follows
[TABLE]
In case of Example 3.3, \big{\|}\widehat{\sqrt{Q^{-1}}A}\sqrt{Q^{-1}}\big{\|}=0.4964.
Applying the technique developed in [12, 25], we obtain the following result.
Theorem 3.5**.**
Let be coefficient matrices for Eqs. (1) and (8). Let
[TABLE]
where K_{U}^{P}=\min\big{\{}\theta_{U}(m)\big{\|}\widehat{PX_{L}^{-1}}AP^{-1}\big{\|},\big{\|}\widehat{PX_{L}^{-1}}AP^{-1}\big{\|}_{U}\big{\}}, is the maximal positive definite solution of Eq. (1), and is a positive definite matrix. If K_{U}^{P}\big{\|}\widehat{PX_{L}^{-1}}AP^{-1}\big{\|}<1 and
[TABLE]
then and
[TABLE]
Proof. The proof is similar to the proof of Theorem 3.2 by using technique in [12, Theorem 2.4] and [25, Theorem 2]. Moreover, we use Lemma 2.6 for proving that is a maximal solution of the perturbed equation (8).
Now, we describe some known perturbation bounds.
Xu in [8] have obtained an elegant bound in case of , which does not require the solution to the perturbed or the unperturbed equations. This bound has been generalized in case of in [22] and for in [15].
Theorem 3.6**.**
[22, Theorem 3]** Let
- (i)
;
- (ii)
\displaystyle\|\Delta Q\|\leq\left[\frac{1}{2}-\|Q^{-1}\|\Big{(}\sum_{i=1}^{m}\|A_{i}\|^{2}\Big{)}^{\frac{1}{2}}\right]\|Q^{-1}\|^{-1},
- (iii)
.
Then the equations (1) and (8) have maximal solutions and , respectively. Moreover,
[TABLE]
where
Theorem 3.6 contains . In [22, Theorem 5] can be found a perturbation bound which does not depend on the coefficients of the perturbed equation (8).
A perturbation bound has been derived for the equation by Yin et al. [31]. This result rewritten for is as follows
Theorem 3.7**.**
[31, Theorem 3.1]** Let
- (i)
*, *
- (ii)
*, *
- (iii)
.
Then the equations (1) and (8) have maximal positive definite solutions and , respectively. Moreover,
[TABLE]
where and .
Konstantionov et al. [32] have obtained local and nonlocal perturbation bounds for the equation by using the technique of Fr’echet derivatives and the method of Lyapunov majorants. One particular case of this equation is , , , , , , i.e. Eq. (1).
Now, we formulate the results from [32] in this particular case. We use some notations. Let
[TABLE]
where denotes the th column of .
Let
[TABLE]
Konstantinov et al. [32] have obtained the local perturbation bounds:
[TABLE]
where is an real symmetric matrix with non-negative entries , .
We note that, in case of real matrix coefficients in Eq. (1), the above formulas are more simple (see [32]).
Let
[TABLE]
The following non-local perturbation bound was obtained in [32].
Theorem 3.8**.**
([32, Theorem 5.1])* Let , where is given in (22). Then the non-local perturbation bound*
[TABLE]
is valid for Eq. (1), where , are determined by (19)-(21).
4 Numerical experiments
We experiment with our bounds and the corresponding perturbation estimates proposed by Hasanov and Borisova [22], Yin et al. [31] for the equation and Konstantionov et al. [32] for the equation . Denote the ratio of the perturbation bounds to the estimated value as follows:
[TABLE]
where for and the perturbation bounds and are computed by using the spectral norm, and for and , and are computed by using the Frobenius norm. Moreover, we compute for different : , and .
Example 4.1**.**
Consider Eq. (1) with matrices
[TABLE]
where is the maximal solution, and
[TABLE]
Assume that the perturbations on and are
[TABLE]
where , , is a random matrix, which is generated by Matlab’s function randn, and being the matrix with all entries equal to one.
The ratio of the perturbation bounds and the estimated value for are listed in Table 1. Among the bounds considered in this example the bound by using spectral norm, followed by and by using Frobenius norm, gives the sharpest estimates. The bound is too conservative, but it does not require the solution to the perturbed or the unperturbed equations.
Example 4.2**.**
Consider Eq. (1) with matrices
[TABLE]
where , , , , is the maximal solution, and
[TABLE]
Assume that the perturbations on and are
[TABLE]
where , , , and is a random matrix.
The ratio of the perturbation bounds and the estimated value for are listed in Table 2. The results for Example 4.2 are identical with these of Example 4.1.
Example 4.3**.**
Consider Eq. (1) with matrices and from Example 3.3, i.e.,
[TABLE]
where
[TABLE]
is the maximal solution. Assume that the perturbations on and are
[TABLE]
We recall that for Example 4.3 (see Example 3.3) we have . Hence, the bound in Theorem 3.2 is not applicable. But {\big{\|}\widehat{\sqrt{Q}X_{+}^{-1}}A\sqrt{Q^{-1}}\big{\|}}=0.7316. Moreover, {\big{\|}\widehat{\sqrt{Q}X_{+}^{-1}}A\sqrt{Q^{-1}}\big{\|}_{F}}=0.7742, , and , where . The ratio of the perturbation bounds and the estimated value for are listed in Table 3. The cases when the conditions of existence of a bound are violated are denoted by an asterisk.
5 Concluding remarks
Analyzing the behaviour of the perturbation bounds considered in the paper, we can point out as most effective the bounds and . When we use the bound with appropriate matrix . The optimal choosing of matrix is an open problem. The perturbation bounds or , derived in this paper can be easily computed using any unitary invariant norm , while the bound depends on many parameters, which is very difficult for computing in generally. The bound is an a priori estimate, since for its calculation it is not necessary to know the solutions and of the unperturbed and the perturbed equation, respectively.
Acknowledgment
This research work was supported by the Shumen University under Grant No RD-08-145/2018.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Anderson, W.N., Morley, T.D., Trapp, G.E. Positive Solutions to X = A − B X − 1 B ∗ 𝑋 𝐴 𝐵 superscript 𝑋 1 superscript 𝐵 X=A-BX^{-1}B^{*} , Linear Algebra Appl. , V.134, 1990, pp.53-62.
- 2[2] Engwerda, J.C. On the existence of a positive definite solution of the matrix equation X + A T X − 1 A = I 𝑋 superscript 𝐴 𝑇 superscript 𝑋 1 𝐴 𝐼 X+A^{T}X^{-1}A=I , Linear Algebra Appl. , V.194, 1993, pp.91-108.
- 3[3] Zhan, X. Computing the extremal positive definite solutions of a matrix equation, SIAM J. Sci. Comput. , V.17, 1996, pp.1167 1174.
- 4[4] Engwerda, J.C., Ran, A.C.M., Rijkeboer, A.L. Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation X + A ∗ X − 1 A = Q 𝑋 superscript 𝐴 superscript 𝑋 1 𝐴 𝑄 X+A^{*}X^{-1}A=Q , Linear Algebra Appl. , V.186, 1993, pp.255-275.
- 5[5] Guo, C.-H., Lancaster, P., Iterative solution of two matrix equations, Math. Comput. , V.68, 1999, pp.1589-1603.
- 6[6] Meini, B. Efficient computation of the extreme solutions of X + A ∗ X − 1 A = Q 𝑋 superscript 𝐴 superscript 𝑋 1 𝐴 𝑄 X+A^{*}X^{-1}A=Q and X − A ∗ X − 1 A = Q 𝑋 superscript 𝐴 superscript 𝑋 1 𝐴 𝑄 X-A^{*}X^{-1}A=Q , Math. Comput. V.71, 2001, pp.1189-1204.
- 7[7] Ivanov, I.G., Hasanov, V.I., Uhlig, F. Improved methods and starting values to solve the matrix equations X ± A ∗ X − 1 A = I plus-or-minus 𝑋 superscript 𝐴 superscript 𝑋 1 𝐴 𝐼 X\pm A^{*}X^{-1}A=I iteratively, Math. Comput. , V.74, 2005, pp.263-278.
- 8[8] Xu, S.F. Perturbation analysis of the maximal solution of the matrix equation X + A ∗ X − 1 A = P 𝑋 superscript 𝐴 superscript 𝑋 1 𝐴 𝑃 X+A^{*}X^{-1}A=P , Linear Algebra Appl. , V.336, 2001, pp.61-70.
