In this short note, we presented a number of alternative explicit necessary and sufficient conditions for diagonal stability along with a new proof of a well-known result in this regard.
Citation: Ali Algefary, Jianhong Xu. A note on explicit conditions for diagonal stability[J]. AIMS Mathematics, 2024, 9(9): 25253-25260. doi: 10.3934/math.20241232
[1] | Patarawadee Prasertsang, Thongchai Botmart . Improvement of finite-time stability for delayed neural networks via a new Lyapunov-Krasovskii functional. AIMS Mathematics, 2021, 6(1): 998-1023. doi: 10.3934/math.2021060 |
[2] | Xi-Ming Fang . General fixed-point method for solving the linear complementarity problem. AIMS Mathematics, 2021, 6(11): 11904-11920. doi: 10.3934/math.2021691 |
[3] | Huahai Qiu, Li Wan, Zhigang Zhou, Qunjiao Zhang, Qinghua Zhou . Global exponential periodicity of nonlinear neural networks with multiple time-varying delays. AIMS Mathematics, 2023, 8(5): 12472-12485. doi: 10.3934/math.2023626 |
[4] | Ali Algefary . Diagonal solutions for a class of linear matrix inequality. AIMS Mathematics, 2024, 9(10): 26435-26445. doi: 10.3934/math.20241286 |
[5] | Ali Algefary . A characterization of common Lyapunov diagonal stability using Khatri-Rao products. AIMS Mathematics, 2024, 9(8): 20612-20626. doi: 10.3934/math.20241001 |
[6] | Zhigang Zhou, Li Wan, Qunjiao Zhang, Hongbo Fu, Huizhen Li, Qinghua Zhou . Exponential stability of periodic solution for stochastic neural networks involving multiple time-varying delays. AIMS Mathematics, 2024, 9(6): 14932-14948. doi: 10.3934/math.2024723 |
[7] | Zahra Eidinejad, Reza Saadati, Donal O'Regan, Fehaid Salem Alshammari . Measure of quality and certainty approximation of functional inequalities. AIMS Mathematics, 2024, 9(1): 2022-2031. doi: 10.3934/math.2024100 |
[8] | Panpan Liu, Haifeng Sang, Min Li, Guorui Huang, He Niu . New criteria for nonsingular $ H $-matrices. AIMS Mathematics, 2023, 8(8): 17484-17502. doi: 10.3934/math.2023893 |
[9] | Wentao Le, Yucai Ding, Wenqing Wu, Hui Liu . New stability criteria for semi-Markov jump linear systems with time-varying delays. AIMS Mathematics, 2021, 6(5): 4447-4462. doi: 10.3934/math.2021263 |
[10] | Ahmad Y. Al-Dweik, Ryad Ghanam, Gerard Thompson, M. T. Mustafa . Algorithms for simultaneous block triangularization and block diagonalization of sets of matrices. AIMS Mathematics, 2023, 8(8): 19757-19772. doi: 10.3934/math.20231007 |
In this short note, we presented a number of alternative explicit necessary and sufficient conditions for diagonal stability along with a new proof of a well-known result in this regard.
Throughout this note, we shall deal with real square matrices only. A matrix A is called (Lyapunov) diagonally stable if there exists a positive diagonal matrix D such that
DA+ATD |
is positive definite. We comment that in practice, the setting of DA+ATD being negative definite is commonly used. We switch this to being positive definite so the notion of P-matrices can be handled more conveniently. The existence of such matrix D means that
V(x)=xTDx |
is a diagonal quadratic Lyapunov function for a linear system in the form
˙x(t)=Ax(t). |
For detailed background material and existing results on diagonal stability, as well as its connection to other types of matrix stability, we refer the reader to the surveys in [1,2].
This type of matrix stability has various applications in networks [3], dynamical systems [4], and computations [5]. The study of diagonal stability is of considerable importance, addressing both theoretical and practical aspects.
Despite significant research efforts, determining the diagonal stability of a matrix remains a difficult problem. Two most notable characterizations for the diagonal stability of a matrix A∈Rn×n can be found in the literature. First, it was shown in [6] that a necessary and sufficient condition for A to be diagonally stable is the existence of a positive diagonal entry in AH, where H is any nonzero positive semi-definite matrix. The other, see [7], depends on the P- matrix property of the Hadamard multiplication A with any positive semi-definite matrix S with sii≠0 for all i. Recall that a matrix A∈Rn×n is said to be a P-matrix if all its principal minors are positive.
A well-known necessary condition [8] for A to be diagonally stable is that A must be a P-matrix. This P-matrix condition is also sufficient when A is 2×2; see [6]. Such a condition is said to be explicit because it can be checked directly using the entries of A.
For diagonal stability of a 3×3 matrix, two explicit necessary and sufficient conditions can be found in the literature. The first one is as follows.
Theorem 1.1. [7, Theorem 4.1] A 3×3 matrix A=[ai,j] is diagonally stable if, and only if,
(i) A is a P-matrix, and
(ii) max{1,ω1,ω2,ω3}<12(1+ω1+ω2+ω3), where ωi=√ai,i(A−1)i,i, i=1,2,3.
The second one [8, Theorem 4] is not as explicit as the above since it is formulated as a pair of quadratic inequalities. An alternative and more transparent proof of this result can be found in [9]. The results in [9] are further explored in [10,11].
This note shall concern Theorem 1.1 only. It should be pointed out here that no explicit necessary and sufficient condition is known for cases beyond 3×3. The main difficulty for this situation is due to the much larger number of parameters being involved in cases of higher dimensions.
The proof of Theorem 1.1 in [7] is done by establishing a positive lower bound for a multivariable objective function through some rather sophisticated parametrization and algebraic manipulations. This has been the main motivation for this note. Our goals are to present a more transparent proof of Theorem 1.1 by first establishing a number of elementary algebraic inequalities and, along the way, to formulate several useful alternative explicit necessary and sufficient conditions for diagonal stability.
Before introducing some preliminary existing results, let us set the stage first. Given two matrices A and B of the same size, they are said to share a common diagonal solution if there exists a positive diagonal matrix D such that
DA+ATDandDB+BTD |
are both positive definite. In addition, we denote by M=[mi,j] the matrix of minors of A, i.e. mi,j is the determinant of the sub-matrix obtained from A by deleting its ith row and jth column.
We now quote the following two results from [10], which will serve as our starting point.
Lemma 1.1. [10, Theorem 2.1] A 3×3 matrix A=[ai,j] is diagonally stable if, and only if,
(i) a3,3>0, and
(ii) ˆA=[a1,1a1,2a2,1a2,2] and S=1a3,3[m2,2m2,1m1,2m1,1] share a common diagonal solution.
Note that the matrix S in Lemma 1.1 is the Schur complement of a3,3 in A. For background material, see, for example, [12,13].
Lemma 1.2. [10, Corollary 2.4] Two 2×2 matrices A1=[a(1)i,j] and A2=[a(2)i,j] share a common diagonal solution if, and only if,
(i) A1 and A2 are P-matrices, and
(ii) maxkx(k)1<minkx(k)2, where, for k=1,2,
x(k)1=(a(k)1,2√a(k)1,1a(k)2,2+√detAk)2andx(k)2=(√a(k)1,1a(k)2,2+√detAka(k)2,1)2. |
In Lemma 1.2, by convention, x(k)2=+∞ if the respective a(k)2,1=0.
Let us start with a few technical lemmas.
Lemma 2.1. Suppose that 0<α<β≤γ<δ such that αδ=βγ=λ. Then,
β+γ<α+δ. |
Proof. The conclusion is equivalent to
λγ+γ<λδ+δ. | (2.1) |
Note that γ≥√λ and δ>√λ. Define ϕ(t)=λt+t, where t≥√λ. Since ϕ′(t)=−λt2+1>0 for t>√λ, ϕ(t) is a strictly increasing function on t≥√λ. Thus, (2.1) follows.
In a similar way, we can easily show the following lemma whose proof is thus omitted.
Lemma 2.2. Suppose that 0<α≤β<γ≤δ such that αδ=βγ=λ. Then,
β+γ≤α+δ. |
The next lemma is a slightly enhanced version of [14, Lemma 1].
Lemma 2.3. [10, Lemma 3.3] For any positive numbers a, b, c, and d, the following are equivalent:
(i) (a+b)2−(c−d)2>0 and (c+d)2−(a−b)2>0.
(ii) max{a,b,c,d}<12(a+b+c+d)
Lemmas 1.1 and 1.2 lead directly to the result below, which is an alternative explicit necessary and sufficient condition for diagonal stability.
Theorem 2.1. A 3×3 matrix A is diagonally stable if, and only if,
(i) A is a P-matrix,
(ii) (a1,2√a1,1a2,2+√m3,3)2<(√m1,1m2,2+√a3,3detAm1,2)2=μ, and
(iii) (m2,1√m1,1m2,2+√a3,3detA)2<(√a1,1a2,2+√m3,3a2,1)2=ν.
Proof. According to Lemma 1.1, the diagonal stability of A∈R3×3 is equivalent to: (i)′ a33>0, and (ii)′ A1=[a1,1a1,2a2,1a2,2] and A2=1a3,3[m2,2m2,1m1,2m1,1] share a common diagonal solution.
Now, by Lemma 1.2, condition (ii)′ is equivalent to: (iii)′ A1 and A2 being P-matrices, and (iv)′ maxkx(k)1<minkx(k)2, where
x(k)1=(a(k)1,2√a(k)1,1a(k)2,2+√detAk)2andx(k)2=(√a(k)1,1a(k)2,2+√detAka(k)2,1)2. |
From (i)′ and (iii)′, (i) follows easily. Additionally, by noting that detA=a3,3detS, and the condition maxkx(k)1<minkx(k)2 is equivalent to x(2)1<x(1)2 and x(1)1<x(2)2, we obtain (ii) and (iii).
We comment that since A is a P-matrix, all the square roots in Theorem 2.1 are well-defined and positive. Similar to Lemma 1.2, μ and ν are interpreted as +∞ when the respective m1,2 and a2,1 are zero.
A consequence of Theorem 2.1 is the following, whose proof is straightforward and hence omitted.
Corollary 2.1. Let A be a 3×3 matrix such that a1,2, a2,1, m1,2 and m2,1 are all nonzero. Then, A is diagonally stable if, and only if,
(i) A is a P-matrix,
(ii) (a1,2√a1,1a2,2+√m3,3)2<(√m1,1m2,2+√a3,3detAm1,2)2,
(iii) (√a1,1a2,2−√m3,3a2,1)2<(m2,1√m1,1m2,2−√a3,3detA)2,
(iv) (m2,1√m1,1m2,2+√a3,3detA)2<(√a1,1a2,2+√m3,3a2,1)2, and
(v) (√m1,1m2,2−√a3,3detAm1,2)2<(a1,2√a1,1a2,2−√m3,3)2.
Next, using Theorem 2.1 and Corollary 2.1, we shall present another alternative explicit necessary and sufficient condition for diagonal stability.
For convenience, let us define
u1=(√a1,1a2,2−√m3,3)(√m1,1m2,2−√a3,3detA), |
u2=(√a1,1a2,2+√m3,3)(√m1,1m2,2+√a3,3detA), |
v1=a1,2m1,2,andv2=a2,1m2,1. |
Observe
u1u2=v1v2. | (2.2) |
Then, we can state the following.
Theorem 2.2. A 3×3 matrix A is diagonally stable if, and only if,
(i) A is a P-matrix, and
(ii) v21+v22<u21+u22.
Proof. It suffices to show that condition (ⅱ) here is equivalent to the corresponding conditions in Theorem 2.1 and Corollary 2.1.
When a1,2=0, conditions (ⅱ) and (ⅲ) in Theorem 2.1 reduce to v22<u22 and, hence, are equivalent to v21+v22<u21+u22 since u1=v1=0. Similarly, when a2,1=0, conditions (ⅱ) and (ⅲ) in Theorem 2.1 become v21<u22, i.e., v21+v22<u21+u22 since u1=v2=0. Clearly, such an argument applies also to the cases when either m1,2=0 or m2,1=0. Theorem 2.2, therefore, holds when any of the a1,2, a2,1, m1,2, or m2,1 is zero.
We assume next that a1,2, a2,1, m1,2, and m2,1 are nonzero. Consequently, u21,u22,v21,v22 are all positive. Besides, u21<u22.
Suppose that conditions (ⅱ) through (ⅴ) in Corollary 2.1 hold, i.e.,
u21<v21,v22 and v21,v22<u22. | (2.3) |
Without loss of generality, we assume u21<v21≤v22<u22. Besides, by (2.2), u21u22=v21v22. These, accordingly to Lemma 2.1, imply condition (ⅱ) here.
Conversely, assume that condition (ⅱ) here holds but (2.3) is not satisfied. Let us consider the following possible scenarios:
● If u21≥v21 and u22>v22, then u21u22>v21v22, which contradicts (2.2).
● If u21<v21 and u22≤v22, then u21u22<v21v22, which again contradicts (2.2).
● If u21≥v21 and u22≤v22, then v21≤u21<u22≤v22. By Lemma 2.2, we obtain u21+u22≤v21+v22, which contradicts condition (ⅱ) here.
The above analysis shows that (2.3) must hold. The proof is now complete.
We are now ready to present a new proof of Theorem 1.1.
Proof of Theorem 1.1. It suffices to show that condition (ⅱ) in Theorem 1.1 and condition (ⅱ) in Theorem 2.2 are equivalent.
It is easy to verify
u1+u2=2√a1,1a2,2m1,1m2,2+2√a3,3m3,3detA>0. | (2.4) |
Moreover, we have
a1,1m1,1+a2,2m2,2−a3,3m3,3−detA=a1,2m1,2+a2,1m2,1. | (2.5) |
By Lemma 2.3 and (A−1)i,i=mi,idetA for all i, condition (ⅱ) in Theorem 1.1 is equivalent to
(√a1,1m1,1+√a2,2m2,2)2−(√a3,3m3,3−√detA)2>0 | (2.6) |
and
(√a3,3m3,3+√detA)2−(√a1,1m1,1−√a2,2m2,2)2>0. | (2.7) |
Expanding these expressions and using (2.4) and (2.5), we see that (2.6) and (2.7) are equivalent to
−u1−u2<v1+v2<u1+u2, |
i.e.
(v1+v2)2<(u1+u2)2. |
Next, by (2.2), the above is equivalent to
v21+v22<u21+u22, |
i.e. condition (ⅱ) in Theorem 2.2. This completes the proof.
Example 2.1. Consider the matrix
A=[1−3262−1−6−13]. |
It is clear that A is a P-matrix. Additionally, we have
A−1=153[57−1−12151361920]. |
Thus, we find that ω1=√1⋅553=0.307, ω2=√2⋅1553=0.752, and ω3=√3⋅2053=1.064. Since max{1,ω1,ω2,ω3}=1.064<12(1+ω1+ω2+ω3)=1.562, we conclude from Theorem 1.1 that A is indeed diagonally stable. In fact, the matrix D=[10.90.65] satisfies the condition that DA+ATD is positive definite.
Explicit necessary and sufficient conditions for the diagonal stability are very interesting research problems due to their simplicity to verify. However, no such results exist for matrices beyond 3×3. In this short paper, we provide a shorter and more transparent proof of a well-known explicit characterization for the 3×3 case [7]. Our new proof relies on Redheffer's result [9,11], which has been restated in [10] using the notion of Schur complements. Furthermore, we derive additional equivalent explicit conditions for the diagonal stability of a matrix A∈R3×3. A natural direction for future work is developing similar results for higher dimension matrices.
Ali Algefary: Methodology, Formal analysis, Writing-original draft preparation, Writing-review and editing; Jianhong Xu: Formal analysis, Writing-original draft, Supervision. All authors have read and approved the final version of the manuscript for publication.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2024-9/1). The authors would like to express their sincere gratitude to the anonymous reviewers for their invaluable feedback and constructive suggestions, which greatly contributed to the improvement of this manuscript.
The authors do not have any conflict of interest.
[1] |
D. Hershkowitz, Recent directions in matrix stability, Linear Algebra Appl., 171 (1992), 161–186. https://doi.org/10.1016/0024-3795(92)90257-B doi: 10.1016/0024-3795(92)90257-B
![]() |
[2] |
O. Kushel, Unifying matrix stability concepts with a view to applications, SIAM Review, 61 (2019), 643–729. https://doi.org/10.1137/18M119241X doi: 10.1137/18M119241X
![]() |
[3] | S. Mey, Control Techniques for Complex Networks, Cambridge: Cambridge University Press, 2008. https://doi.org/10.1017/CBO9780511804410 |
[4] | J. Hofbauer, K. Sigmund, Evolutionary Games and Population Dynamics, Cambridge: Cambridge University Press, 1998. https://doi.org/10.1017/CBO9781139173179 |
[5] | E. Kaszkurewicz, A. Bhaya, Matrix Diagonal Stability in Systems and Computation, Berlin: Springer Science and Business Media, 2012. https://doi.org/10.1007/978-1-4612-1346-8 |
[6] |
G. Barker, P. Berman, R. Plemmons, Positive diagonal solutions to the Lyapunov equations, Linear Multil. Algebra, 5 (1978), 249–256. https://doi.org/10.1080/03081087808817203 doi: 10.1080/03081087808817203
![]() |
[7] |
J. Kraaijevanger, A characterization of Lyapunov diagonal stability using Hadamard products, Linear Algebra Appl., 151 (1991), 245–254. https://doi.org/10.1016/0024-3795(91)90366-5 doi: 10.1016/0024-3795(91)90366-5
![]() |
[8] |
G. Cross, Three types of matrix stability, Linear Algebra Appl., 20 (1978), 253–263. https://doi.org/10.1016/0024-3795(78)90021-6 doi: 10.1016/0024-3795(78)90021-6
![]() |
[9] |
R. Redheffer, Volterra multipliers Ⅱ, SIAM J. Algebr. Dis. Meth., 6 (1985), 592–611. https://doi.org/10.1137/0606059 doi: 10.1137/0606059
![]() |
[10] |
M. Gumus, J. Xu, On common diagonal Lyapunov solutions, Linear Algebra Appl., 507 (2016), 32–50. https://doi.org/10.1016/j.laa.2016.05.032 doi: 10.1016/j.laa.2016.05.032
![]() |
[11] |
R. Shorten, N. Kumpati, On a theorem of Redheffer concerning diagonal stability, Linear Algebra Appl., 431 (2009), 2317–2329. https://doi.org/10.1016/j.laa.2009.02.035 doi: 10.1016/j.laa.2009.02.035
![]() |
[12] | A. Berman, R. Plemmons, Nonnegative Matrices in the Mathematical Sciences, New York: Society for Industrial and Applied Mathematics, 1994. https://doi.org/10.1137/1.9781611971262 |
[13] | F. Zhang, The Schur Complement and its Applications, Berlin: Springer Science and Business Media, 2006. https://doi.org/10.1007/b105056 |
[14] | N. Oleng, K. Narendra, On the existence of diagonal solutions to the Lyapunov equation for a third order system, In: Proceedings of the 2003 American Control Conference, 4 (2003), 2761–2766. https://doi.org/10.1109/ACC.2003.1243497 |