1. Introduction
Eigenvalue localization is an important topic in Matrix theory and its applications. Many eigenvalue inclusion sets for a matrix
[
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11] have been established, such as the well-known Geršgorin set [
5,
11] and the Brauer set [
1,
11]. However, as Melman [
9] pointed out, for the special class of matrices with a constant main diagonal (c.m.d.), both the Geršgorin and Brauer sets each consists of a single disc, a rather uninteresting outcome. In fact, if a matrix
satisfies
, then both
and
reduce, respectively, to the following forms:
and
where
and
. Obviously, the Geršgorin and Brauer sets are just discs [
9].
To localize all eigenvalues of matrices with a c.m.d. more precisely, Melman also [
9] gave an eigenvalue inclusion set (see Theorem 1), which is tighter than
and
.
Theorem 1 ([9] Theorem 2.1).Let with for all , . Let be the spectrum of the matrix A, that is, Then,where , denotes the th entry of and Furthermore,
In [
7], Li and Li provided two tighter sets including all eigenvalues of a matrix with a c.m.d. (see Theorems 2 and 3).
Theorem 2 ([7] Theorem 2.4).Let with for all , . Then,where Theorem 3 ([7] Theorems 2.5 and 2.7).Let with for all , . Then,where In this paper, we first give a sufficient condition for non-singular matrices, which leads to a new set including all eigenvalues of matrices with a c.m.d. As an application, in
Section 3, we apply the result obtained in
Section 2 to Toeplitz matrices as a subclass of matrices with a c.m.d. and obtain a new eigenvalue inclusion set. All the new eigenvalue inclusion sets are proved to be tighter than those in [
9].
2. A New Eigenvalue Inclusion Set for Matrices with a c.m.d.
In this section, we present a new eigenvalue inclusion set for matrices with a c.m.d. First, a sufficient condition for non-singular matrices is given.
Lemma 1. For any with for all , and , ifwhere , then A is non-singular. Proof. Suppose on the contrary that
satisfies Inequality (
1) and is singular, then there is an
, with
, such that
. Let
Note that
. Then,
, which leads to
, equivalently,
. This implies that for all
,
Taking
, Inequality (
2) becomes
If
, then Inequality (
3) reduces to
, implying that
. However, this contradicts Inequality (
1). Hence,
. We now take
in Inequality (
3), and obtain similarly
On multiplying the above inequality with Inequality (
3), then
Note that
, then
which contradicts Inequality (
1). Therefore,
A is non-singular. ☐
From Lemma 1, we can obtain a new eigenvalue inclusion set for matrices with a c.m.d.
Theorem 4. Let with for all , and . Then,whereand . Proof. Suppose that
, then
is singular. If
, then
for any
, which leads to that for any
,
that is,
From Lemma 1, we have that is non-singular. This contradicts that is singular. Hence, . ☐
We now give a comparison between the new eigenvalue set and the set in Theorem 1.
Theorem 5. Let with for any , and . Then, Proof. Suppose that
, then there exist
with
and
, that is,
If
, then
or
. We can get
or
and hence
. If
, we have from Inequality (
8),
that is,
or
. Hence,
or
, consequently,
and
As Equation (
9) holds for any
i and
j in
N, therefore
. ☐
Example 1. Consider the matrix A (the matrix in [9]),the sets , , , and are shown in Figure 1, where is represented by the outside boundary, by the middle, by the inner, and is filled. The exact eigenvalues are plotted with asterisks. It is easy to see that This example shows that the the new eigenvalue inclusion set in Theorem 4 is tighter than the Geršgorin set , the Brauer set and the set obtained in [9]. Remark 1. From Theorems 3 and 5, we have thatand Note here that and . However, the sets and (also and ) cannot be compared with each other. In fact, we also consider the matrix A in Example 1, and draw , and in Figure 2 and Figure 3. It is not difficult to see thatand 3. Eigenvalue Inclusion Set for Toeplitz Matrices
Toeplitz matrices, a subclass of matrices with a c.m.d., arise in many fields of application [
12,
13,
14,
15,
16,
17,
18], such as probability and statistics, signal processing, differential and integral equations, Markov chains, Padé approximation, etc. For example, consider an assigned Lebesgue integrable function
f defined on the fundamental interval
and periodically extended to the whole real axis, and the Fourier coefficients
of
f that is
where
k is an integer number. From the coefficients
one can build the infinite dimensional Toeplitz matrix
with entries
[
12,
13,
16].
Toeplitz matrices are constant along all their NW-SE diagonals [
7,
9], i.e., a Toeplitz matrix
has the following form:
Indeed, if
f is a real valued function, we have
and, consequently,
is Hermitian; moreover, if
, then the coefficients
are real and
is symmetric. The following result can be found in [
12,
19] and in a multilevel setting in [
16,
17].
Theorem 6 ([17,19]).Let be the eigenvalues of sorted in nondecreasing order, and ess inf , ess sup . - a.
If , then for every j and n; if , then f is constant and trivially with identity of size n;
- b.
The following asymptotic relationships hold: , .
Furthermore, there exist further results establishing precisely how fast the convergence holds [
13,
17]. Since in applications (differential and fractional operators/equations, shift-invariant integral operators/equations, signal and image processing etc.) often the underlying Toeplitz matrices have large size
n, then the results in [
12,
13,
16,
17] are difficult to beat and improved. When
f is complex-values the theory is more complicated and in that case the convex hull of the essential range of
f plays a role (see [
13,
18]). Obviously, a Toeplitz matrix is persymmetric. Here, we call
A persymmetric if
A is symmetric with respect to the main anti-diagonal [
9]. Furthermore, the square of a Toeplitz matrix
T is not necessary Toeplitz, but it is persymmetric.
In [
9], Melman applied the eigenvalue inclusion Theorem (Theorem 1) of matrices with a c.m.d. to Toeplitz matrices, and obtained the following simpler form of the eigenvalue inclusion set.
Theorem 7 ([9] Theorem 3.1).Let be a Toeplitz matrix and . Then,whereand Furthermore, .
Next, by applying Theorem 4 to Toeplitz matrices, we obtain a new eigenvalue inclusion set.
Theorem 8. Let be a Toeplitz matrix with and . Then,where Proof. Since
T is Toeplitz and
, we have that
is also Toeplitz and
is persymmetric. Therefore, the main diagonal of
has at most
distinct values, and
for
. Hence, by Theorem 4 and Equation (
6), for any
. For the case
, we have
For the case
,
,
, we have
Note that
, then
From Inequalities (
10) and (
11), we can get that
where
Similarly, we obtain
From
, Inequalities (
12) and (
13), we could easily get, for any
and
,
Furthermore, for any
which is equivalent to
that is,
The conclusion follows from Inequalities (
14) and (
15). ☐
From Theorems 5, 7 and 8, we can obtain easily the comparison results as follows.
Theorem 9. Let be a Toeplitz matrix with and . Then, Example 2. Consider the Toeplitz matrix Q in [9]: In Figure 4, the sets , , , and are shown, where is represented by the outside boundary, by the middle, by the inner, and is filled. The exact eigenvalues are plotted with asterisks. As we can see, This example shows that the new eigenvalue inclusion set in Theorem 8 is tighter than the set obtained in [9], the Geršgorin set and the Brauer set for a Toeplitz matrix.