Abstract
In the present article, we consider the problem on location of the matrix spectrum with respect to a parabola. In terms of solvability of a matrix Lyapunov type equation, we prove theorems on location of the matrix spectrum in certain domains \({\cal P}_i \) (bounded by a parabola) and \({\cal P}_e \) (lying outside the closure of \({\cal P}_i \)). A solution to the matrix equation is constructed. We use this equation and prove an analog of the Lyapunov–Krein theorem on dichotomy of the matrix spectrum with respect to a parabola.
Avoid common mistakes on your manuscript.
1. INTRODUCTION AND FORMULATION OF THE PROBLEM
Spectral problems of linear algebra are important for theoretical and applied studies. Many problems of the control theory and problems on description of the \(\varepsilon \)spectrum or pseudospectrum lead to questions on location of the matrix spectrum with respect to various domains whose boundaries are contours in the complex plane and to dichotomy problems for the matrix spectrum with respect to certain curves (see, for example, [7, 8, 9, 12]). Therefore, establishing criteria and developing algorithms for description of location of the matrix spectrum in the complex plane are of great importance.
In linear algebra, Lyapunov’s criteria are the bestknown criteria for localization of the matrix spectrum. They provide us with necessary and sufficient conditions for location of the matrix spectrum in the unit disc
and in the left halfplane
We present the formulations for the case of an ( \(n\times n \))matrix \(A \).
Theorem 1.1 (A. M. Lyapunov) \(. \) Each eigenvalue of a matrix \(A\) belongs to the unit disc \({\cal C}_i \) if and only if the matrix equation
has a Hermitian positive definite solution \(H\), i.e., \(H = H^* > 0 \).
Corollary 1.2\(. \) If each eigenvalue of a matrix \(A\) belongs to the unit disc \({\cal C}_i \) then there exists a solution \(H\) to matrix equation (1.1) that satisfies the conditions \(H = H^* > 0 \) and has the form
Theorem 1.3 (A. M. Lyapunov) \(. \) Each eigenvalue of a matrix \(A\) belongs to the left halfplane \({\cal C}_- \) if and only if the matrix equation
has a Hermitian positive definite solution \(H\), i.e., \(H = H^* > 0 \).
Corollary 1.4\(. \) If each eigenvalue of a matrix \(A\) belongs to the left halfplane \({\cal C}_- \) then there exists a solution \(H\) to matrix equation (1.3) that satisfies the conditions \(H = H^* > 0 \) and has the form
Matrix equations (1.1) and (1.3) are usually called the Lyapunov equations. Notice that the above criteria are used in numerical research. In particular, Godunov and Bulgakov used formulas (1.2) and (1.4) and developed algorithms for numerical solving the problem on location of the matrix spectrum in the domains \({\cal C}_i\) and \({\cal C}_- \) with a guaranteed accuracy. A survey of results in this direction can be found in [3, 7].
In [4, 6], the problem was studied on location of the matrix spectrum in the domain bounded by the ellipse
In particular, the following assertion was proven in [6].
Theorem 1.5 \(. \) Each eigenvalue of a matrix \(A\) belongs to the domain \({\cal E}_i \) if and only if the matrix equation
has a Hermitian positive definite solution \(H\) , i.e., \(H = H^* > 0 \) .
In [4], a formula was obtained for solving equation (1.5) with \(C=I\). Namely, we have
where
We rewrite formula (1.6) as follows:
where
On the basis of this formula, an algorithm for numerical solving was developed for the problem on location of the matrix spectrum in the domain \({\cal E}_i \), see [4].
Notice that Theorems 1.1–1.3 can be generalized for solving the problem on dichotomy of the matrix spectrum with respect to a circle, straight line, and ellipse, see [3, 5, 6, 7].
The above theorems establish connections between location of the matrix spectrum in the domains \( {\cal C}_i\), \({\cal C}_- \), and \({\cal E}_i \) and solvability of matrix equations (1.1), (1.3), and (1.5) respectively. Notice that similar connections exist in more general cases. In [8, 9], they were established for problems on location of the matrix spectrum in a variety of domains in the complex plane and the class of generalized Lyapunov equations of the form
where \(A\), \(B \), and \(C \) are known matrices of sizes \(n \times n \), \(m \times m\), and \(m \times n \) respectively, the number \(N \) determines the order of equation (1.7), each \(a_{jk} \) is a constant coefficient, and \(H \) is an unknown (\(m \times n \))matrix.
It is obvious that equations (1.1), (1.3), and (1.5) are partial cases of equation (1.7) with \(N \le 2 \), \(m = n\), and \(B = A^* \).
Generalized Lyapunov equations (1.7) first appeared in papers by Krein, see [5, Ch. 1]. We present below one of his results. Let
denote the characteristic polynomial of equation (1.7). We introduce the following notation.
-
–
Let \(\sigma (A) = \{\mu _1,\dots ,\mu _n\}\) be the spectrum of a matrix \(A\).
-
–
Let \(\sigma (B) = \{\lambda _1,\dots ,\lambda _m\}\) be the spectrum of a matrix \(B\).
-
–
Let \(\gamma _A\) be a closed contour surrounding \(\sigma (A) \).
-
–
Let \(\gamma _B\) be a closed contour surrounding \(\sigma (B) \).
For the proof of the following assertion, the reader is referred to [5].
Theorem 1.6 (M. G. Krein) \(. \) Assume that
where
Then, for every matrix \(C \), there exists a unique solution to equation (1.7). This solution can be represented as follows:
In the present article, we consider the problem on location of the matrix spectrum with respect to a parabola. In particular, we solve the problem on dichotomy of the spectrum with respect to a parabola. Notice that a series of algorithms is known for solving such problems (see, for example, [1, 2, 10, 11]). However, these algorithms are based on reduction of spectral problems to wellknown problems on location of the matrix spectrum with respect to either a circle or a straight line. We suggest a new solution of the problems under consideration without intermediate reduction to known ones. Our solution is based on studying a special Lyapunov type matrix equation. In terms of solvability of this equation, we prove assertions on location of the matrix spectrum in the domains \({\cal P}_i\) (bounded by a parabola) and \({\cal P}_e\) (lying outside the closure of \({\cal P}_i\)). Moreover, we use the norm of the solution to the matrix equation and find a region near the parabola
without eigenvalues of \(A \). Studying the problem on location of the matrix spectrum in the domain \({\cal P}_i\), we also obtain an explicit formula for the solution to the matrix equation which is similar to formulas (1.2), (1.4), and (1.6) and can be used for developing numerical algorithms. Notice that we use the same equation for proving an analog of Lyapunov–Krein theorem on dichotomy of the matrix spectrum with respect to a parabola.
2. LOCATION OF THE MATRIX SPECTRUM IN A DOMAIN BOUNDED BY A PARABOLA
In the present section, we establish necessary and sufficient conditions for location of the matrix spectrum in a domain in the complex plane that is bounded by a parabola. The conditions are similar to the above criteria. They are formulated in terms of solvability of a certain matrix equation.
Let \(A\) be an ( \(n \times n \))matrix. We denote by \({\cal P}_i \) the domain bounded by a parabola \(h \), i.e.,
We prove the following assertion.
Theorem 2.1 \(. \) If the spectrum of a matrix \(A\) is a subset of the domain \({\cal P}_i \) then, for each matrix \(C \) , there exists a unique solution to the matrix equation
Proof. It is obvious [8] that equation (2.1) is a generalized Lyapunov equation (see (1.7)) with
By the conditions of the theorem, each eigenvalue \(\mu _j\) of \(A \) belongs to the domain \({\cal P}_i \). We have \(B = A^* \). The spectrum of \(B \) is a subset of \({\cal P}_i \). We show that the conditions of Krein’s theorem are satisfied.
For equation (2.1), we represent the characteristic polynomial (see (1.8)) as follows:
Let \(\mu _r = \alpha _r + i\beta _r \). We have \(\lambda _s = \overline \mu _s = \alpha _s - i\beta _s\) and
It is obvious that
hence, we have
Since \(\sigma (A) \subset {\cal P}_i \), we obtain \(\alpha _j - \frac {1}{2p}\beta ^2_j > 0\), \(j=1,\dots ,n \). We conclude that
Therefore, the conditions of Theorem 1.4 hold; hence, there exists a unique solution to equation (2.1) for each choice of \(C \). By formula (1.9), we have
where \(\gamma _A \) and \(\gamma _{A^*} \) are contours that surround the spectra of the matrices \(A \) and \(A^* \) respectively. We may take the boundary of the set
for both \(\gamma _A\) and \(\gamma _{A^*} \). This completes the proof of the theorem. \(\quad \square \)
Corollary 2.2 \(. \) If \(C = C^*\) then \(H = H^*\) . If \(C = C^* > 0\) then \(H = H^* > 0\) .
Theorem 2.3\(. \) Assume that \(C = C^* > 0\) and there exists a Hermitian positive definite solution \(H \) to equation (2.1). Then each eigenvalue \(\mu _k\) of \(A \) belongs to the domain \( {\cal P}_i\). Moreover, the following estimate is valid:
Proof. Let \(\mu _k \) be an eigenvalue of \(A \) and let \(v_k \) be a corresponding unit eigenvector. By (2.1), we have
Since
we obtain
Therefore, the conditions \(C = C^*> 0 \) and \(H = H^*> 0 \) imply that \(\mu _k \in {\cal P}_i \), \(k = 1,\ldots ,n \). We take into account (2.4) and obtain the estimate
which is equivalent to (2.3). This completes the proof of the theorem. \(\quad \square \)
The following assertion is immediate from Theorems 2.1 and 2.2.
Theorem 2.4\(. \) Let \(C = C^* > 0\). The spectrum of \(A \) is a subset of the domain \({\cal P}_i\) if and only if there exists a Hermitian positive definite solution \(H \) to equation (2.1), i.e., \(H = H^* > 0 \).
3. FORMULAS FOR THE SOLUTION TO EQUATION (2.1)
In the present section, we obtain an analog of Lyapunov’s formulas for the solution to equation (2.1) provided that the spectrum of \(A\) is a subset of \({\cal P}_i \).
We consider the case in which the matrix on the righthand side of equation (2.1) is the unit matrix, i.e., we have \(C = I\). As is proven in the previous section, there exists a unique solution to this equation; moreover, the solution is Hermitian and positive definite. In view of formula (2.2), we may represent the solution as follows:
This formula is not convenient for solving particular problems. We suggest a simpler formula that can be used for numerical solving.
Let \(\mu \) be an eigenvalue of \(A \) and let \(v \) be a corresponding eigenvector. We take into account (2.4) and obtain the equality
We pass to the equivalent relation
Since \(\mu \in {\cal P}_i \), we have
We rewrite (3.2) in the following form:
We find that
We transform each of the summands \(J_k \), \(k = 0,1,\ldots \). Since \(\mathrm {Re}\thinspace \mu > 0 \), we obtain
for \(k = 0 \). It is obvious that
for \(k = 1\). The same transform as for \( k = 0\) leads to the equalities
We repeat similar transforms and obtain
We conclude that
We transform each summand \(J_k \), \(k\ge 2 \), following the same lines and rewrite (3.3) as follows:
For \(k \ge 0\), we introduce the notation
and rewrite (3.4) as follows:
If the eigenvalues are pairwise distinct and \(\mu _l \in {\cal P}_i\) for every \(l \) then the corresponding eigenvectors \(v_l \) satisfy the following system of \(n \) equalities:
Since \(H = H^*\) and \(H_k = H^*_k \), we conclude that the Hermitian matrix
is the zero matrix. Thus, we may rewrite formula (3.1) as follows:
Notice that each matrix can be approximated with a guaranteed accuracy by matrices whose eigenvalues are pairwise distinct. Hence, formula (3.5) is valid in the general case too. Formula (3.5) is an analog of formula (1.6). As in [4], it can be used for developing numerical algorithms.
4. DICHOTOMY OF THE MATRIX SPECTRUM WITH RESPECT TO A PARABOLA
In the present section, we consider the problem on dichotomy of the matrix spectrum with respect to a parabola \(h\). We begin with the problem on location of the matrix spectrum \(\sigma (A) \) in the domain
We consider matrix equation (2.1) with a modified righthand side:
Theorem 4.1\(. \) Assume that the spectrum of \(A\) lies outside the closure of the domain \({\cal P}_i \). Then, for each matrix \(C\), there exists a unique solution \(H \) to equation (4.1). If \(C = C^* \) then \(H = H^*\). If \(C = C^*> 0\) then \(H = H^* > 0\).
Proof. Since each eigenvalue \(\mu _j \) of \(A \) belongs to \({\cal P}_e \), we have
as in the proof of Theorem 2.1. We find that the conditions of Krein’s theorem hold. Therefore, for each \(C \), there exists a unique solution to equation (4.1); moreover, the solution can be represented in the integral form and the formula for this solution differs from (2.2) by the sign and the choice of contours of integration. We conclude that the solution is Hermitian if the matrix on the righthand side is Hermitian. It is easy to see that the conditions \(C = C^*> 0\) imply the conditions \(H = H^* > 0 \), which completes the proof of the theorem. \(\quad \square \)
Theorem 4.2\(. \) Let \(C = C^*> 0\). Assume that there exists a Hermitian positive definite solution \(H \) to equation (4.1), i.e., \(H = H^*> 0 \). Then the spectrum of \(A \) is a subset of the domain \({\cal P}_e\) and
Proof. Let \(\mu _k \) be an eigenvalue of \(A \) and let \(v_k \) be a corresponding unit eigenvector. We repeat the arguments from the proof of (2.4) and derive the following equality from (4.1):
Since \(C = C^* > 0 \) and \(H = H^* > 0 \), we conclude that \(\mu _k\in {\cal P}_e \). It follows from (4.3) that, for every eigenvalue, we have
This inequality is equivalent to estimate (4.2). \(\quad \square \)
The following assertion is immediate from Theorems 4.1 and 4.2.
Theorem 4.3\(. \) Each eigenvalue of \(A \) belongs to the domain
if and only if there exists a Hermitian positive definite solution \(H \) to matrix equation (4.1) with \(C = C^* > 0 \), i.e., we have \(H = H^* > 0\).
We consider matrix equation (2.1) with a special expression on the righthand side:
Theorem 4.4\(. \) Let \(P \) be a projection onto an invariant subspace with respect to \(A \) that commutes with \(A \). Assume that \(C = C^* > 0\). If there exists a Hermitian positive definite solution \(H \) to equation (4.4) such that
then the matrix spectrum \( \sigma (A)\) is disjoint from the parabola \(h\). Moreover, the projection \(P \) is a mapping onto a maximal invariant subspace with respect to \(A \) that corresponds to eigenvalues in the domain \({\cal P}_i\).
Proof. Since \(AP = PA \), we find that \((I - P) \) is a projection onto an invariant subspace with respect to \(A \) too. Hence, there exists a nondegenerate matrix \(T \) such that
and
By (4.5), we have
We consider the matrix \(\hat {H} \) with
and find that
In a similar way, we rewrite (4.4) in the following form:
where
It is obvious that
Therefore, equation (4.4) is equivalent to the following systems of equations:
Since \(H = H^* > 0\) and \(C = C^* > 0 \), we obtain
By Theorems 2.2 and 4.2, each eigenvalue of \( A_{11}\) belongs to \({\cal P}_i \) and each eigenvalue of \(A_{22} \) belongs to \({\cal P}_e \). It is also clear that \(P \) is a projection onto a maximal invariant subspace with respect to \(A \) that corresponds to eigenvalues in the domain \({\cal P}_i \). \(\quad \square \)
Corollary 4.5 \(. \) Let the conditions of the above theorem hold. Then each eigenvalue of \(A \) belongs to the set
REFERENCES
È. A. Biberdorf, “Development of the matrix spectrum dichotomy method,” in: Continuum Mechanics, Applied Mathematics and Scientific Computing: Godunov’s Legacy, 37 (Springer Nature, Cham, 2020).
È. A. Biberdorf, M. A. Blinova, and N. I. Popova, “Some modifications of the method of matrix spectrum dichotomy and their applications to stability problems,” Sib. Zh. Vychisl. Mat. 21, 139 (2018) [Numer. Anal. Appl. 11, 108 (2018)].
A. Bulgak and H. Bulgak, Linear Algebra (Selçuk Univ., Konya, 2001) [in Turkish].
A. Bulgak, G. Demidenko, and I. Matveeva, “On location of the matrix spectrum inside an ellipse,” Selçuk J. Appl. Math. 4 (1), 25 (2003).
Yu. L. Daletskiĭ and M. G. Kreĭn, Stability of Solutions of Differential Equations in Banach Space (Nauka, Moscow, 1970) [ Stability of Solutions of Differential Equations in Banach Space (Amer. Math. Soc., Providence, RI, 1974)].
G. Demidenko, “On a functional approach to spectral problems of linear algebra,” Selçuk J. Appl. Math. 4:2, 39 (2001).
S. K. Godunov, Modern Aspects of Linear Algebra (Nauchnaya Kniga, Novosibirsk, 1997) [Modern Aspects of Linear Algebra (Amer. Math. Soc., Providence, RI, 1998)].
A. G. Mazko, “Localization of the spectrum and stability of dynamical systems,” Trudy Inst. Mat., Nats. Akad. Nauk Ukrain. 28, 1 (1999) [in Russian].
A. G. Mazko, Matrix Equations, Spectral Problems, and Stability of Dynamic Systems (Cambridge Sci. Publ., Cottenham, 2008).
M. Sadkane and A. Touhami, “On modifications to the spectral dichotomy algorithm,” Numer. Funct. Anal. Optim. 34, 791 (2013).
S. Traore and M. Dosso, “Spectral dichotomy methods of a matrix with respect to the general equation of the parabola,” European J. Pure Appl. Math. 15, 681 (2022).
L. N. Trefethen, “Computation of pseudospectra,” Acta Numer. 8, 247 (1999).
Funding
The study was carried out within the framework of the state contract for the Sobolev Institute of Mathematics of the Siberian Branch of RAS (project No. FWNF-2022-0008).
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Demidenko, G.V., Prokhorov, V.S. On Location of the Matrix Spectrum with Respect to a Parabola. Sib. Adv. Math. 33, 190–199 (2023). https://doi.org/10.1134/S1055134423030033
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1055134423030033