Next Article in Journal
Comparative Study of Natural Radioactivity and Radiological Hazard Parameters of Various Imported Tiles Used for Decoration in Sudan
Previous Article in Journal
Noether’s Theorem and Symmetry
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry

1
School of Mathematics and Statistics, Zhoukou Normal University, Zhoukou 466399, China
2
School of Mathematics and Statistics, Yunnan University, Kunming 650091, China
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(12), 745; https://doi.org/10.3390/sym10120745
Submission received: 27 October 2018 / Revised: 6 December 2018 / Accepted: 11 December 2018 / Published: 12 December 2018

Abstract

:
A set to locate all eigenvalues for matrices with a constant main diagonal entry is given, and it is proved that this set is tighter than the well-known Geršgorin set, the Brauer set and the set proposed in (Linear and Multilinear Algebra, 60:189-199, 2012). Furthermore, by applying this result to Toeplitz matrices as a subclass of matrices with a constant main diagonal, we obtain a set including all eigenvalues of Toeplitz matrices.

1. Introduction

Eigenvalue localization is an important topic in Matrix theory and its applications. Many eigenvalue inclusion sets for a matrix A = [ a i j ] C n × n [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 A = [ a i j ] C n × n satisfies a 11 = a 22 = = a n n = a ¯ , then both Γ ( A ) and K ( A ) reduce, respectively, to the following forms:
Γ ( A ) = { z C : | z a ¯ | max i N r i ( A ) } ,
and
K ( A ) = z C : | z a ¯ | max i , j N , i j r i ( A ) r j ( A ) ,
where r i ( A ) = j i | a i j | and N = { 1 , 2 , , n } . 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 Γ ( A ) and K ( A ) .
Theorem 1
([9] Theorem 2.1).Let A = [ a i j ] C n × n with a i i = a ¯ for all i N , n 2 . Let σ ( A ) be the spectrum of the matrix A, that is, σ ( A ) = { λ C : d e t ( λ I A ) = 0 } . Then,
σ ( A ) Ω ( A ) = i N Ω i ( A ) ,
where A 0 = A a ¯ I , ( A 0 2 ) i j denotes the ( i , j ) th entry of A 0 2 and
Ω i ( A ) = z C : z a ¯ A 0 2 i i z a ¯ + A 0 2 i i r i A 0 2 .
Furthermore, Ω ( A ) K ( A ) Γ ( A ) .
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 A = [ a i j ] C n × n with a i i = a ¯ for all i N , n 2 . Then,
σ ( A ) Ω 1 ( A ) = 0 α 1 i N Ω i 1 α ( A ) ,
where
Ω i 1 α ( A ) = z C : z a ¯ A 0 2 i i z a ¯ + A 0 2 i i α r i A 0 2 + ( 1 α ) c i A 0 2 .
Theorem 3
([7] Theorems 2.5 and 2.7).Let A = [ a i j ] C n × n with a i i = a ¯ for all i N , n 2 . Then,
σ ( A ) Ω 2 ( A ) = 0 α 1 i N Ω i 2 α ( A ) ,
where
Ω i 2 α ( A ) = z C : z a ¯ A 0 2 i i z a ¯ + A 0 2 i i r i A 0 2 α c i A 0 2 1 α .
Furthermore,
Ω 2 ( A ) Ω 1 ( A ) ( Ω ( A ) Ω ( A T ) ) ( K ( A ) K ( A T ) ) ( Γ ( A ) Γ ( A T ) ) .
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 A = [ a i j ] C n × n with a i i = a ¯ for all i N , and n 2 , if
| a ¯ 2 ( A 0 2 ) i i | | a ¯ 2 ( A 0 2 ) j j | > r i ( A 0 2 ) r j ( A 0 2 ) ,
where A 0 = A a ¯ I , then A is non-singular.
Proof. 
Suppose on the contrary that A = [ a i j ] C n × n satisfies Inequality (1) and is singular, then there is an x = [ x 1 , x 2 , , x n ] T C n , with x 0 , such that A x = 0 . Let
0 < | x t | | x s | max { | x k | : k N , k s , k t } .
Note that A 0 = A a ¯ I . Then, A 0 x = a ¯ x , which leads to A 0 2 x = a ¯ 2 x , equivalently, ( A 0 2 a ¯ 2 I ) x = 0 . This implies that for all i N ,
( ( A 0 2 ) i i a ¯ 2 ) x i = j N , j i ( A 0 2 ) i j x j .
Hence,
| ( A 0 2 ) i i a ¯ 2 | | x i | j N , j i | ( A 0 2 ) i j | | x j | , i N .
Taking i = t , Inequality (2) becomes
| ( A 0 2 ) t t a ¯ 2 | | x t | j N , j t | ( A 0 2 ) t j | | x j | r t ( A 0 2 ) | x s | .
If | x s | = 0 , then Inequality (3) reduces to | ( A 0 2 ) t t a ¯ 2 | | x t | = 0 , implying that | ( A 0 2 ) t t a ¯ 2 | = 0 . However, this contradicts Inequality (1). Hence, | x s | > 0 . We now take i = s in Inequality (3), and obtain similarly
| ( A 0 2 ) s s a ¯ 2 | | x s | r s ( A 0 2 ) | x s | .
On multiplying the above inequality with Inequality (3), then
| ( A 0 2 ) t t a ¯ 2 | | ( A 0 2 ) s s a ¯ 2 | | x t | | x s | r t ( A 0 2 ) r s ( A 0 2 ) | x t | | x s | .
Note that | x t | | x s | > 0 , then
| ( A 0 2 ) t t a ¯ 2 | | ( A 0 2 ) s s a ¯ 2 | r t ( A 0 2 ) r s ( A 0 2 ) ,
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 A = [ a i j ] C n × n with a i i = a ¯ for all i N , and n 2 . Then,
σ ( A ) Ω ¯ ( A ) = i , j N , i j Ω ¯ i , j ( A ) ,
where
Ω ¯ i , j ( A ) = { z C : | z a ¯ ( A 0 2 ) i i | | z a ¯ + ( A 0 2 ) i i | | z a ¯ ( A 0 2 ) j j |
| z a ¯ + ( A 0 2 ) j j | r i ( A 0 2 ) r j ( A 0 2 ) } ,
and A 0 = A a ¯ I .
Proof. 
Suppose that λ σ ( A ) , then λ I A is singular. If λ Ω ¯ ( A ) , then λ Ω ¯ i j ( A ) for any i , j N , i j , which leads to that for any i , j N , i j ,
| z a ¯ ( A 0 2 ) i i | | z a ¯ + ( A 0 2 ) i i | | z a ¯ ( A 0 2 ) j j | | z a ¯ + ( A 0 2 ) j j | > r i ( A 0 2 ) r j ( A 0 2 ) ,
that is,
| ( z a ¯ ) 2 ( A 0 2 ) i i | | ( z a ¯ ) 2 ( A 0 2 ) j j | > r i ( A 0 2 ) r j ( A 0 2 ) .
From Lemma 1, we have that λ I A is non-singular. This contradicts that λ I A is singular. Hence, λ Ω ¯ ( A ) .  ☐
We now give a comparison between the new eigenvalue set Ω ¯ ( A ) and the set Ω ( A ) in Theorem 1.
Theorem 5.
Let A = [ a i j ] C n × n with a i i = a ¯ for any i N , and n 2 . Then,
Ω ¯ ( A ) Ω ( A ) .
Proof. 
Suppose that z Ω ¯ ( A ) , then there exist i , j N with i j and z Ω ¯ i j ( A ) , that is,
| z a ¯ ( A 0 2 ) i i | | z a ¯ + ( A 0 2 ) i i | | z a ¯ ( A 0 2 ) j j |
| z a ¯ + ( A 0 2 ) j j | r i ( A 0 2 ) r j ( A 0 2 ) .
Equivalently,
| ( z a ¯ ) 2 ( A 0 2 ) i i | | ( z a ¯ ) 2 ( A 0 2 ) j j | r i ( A 0 2 ) r j ( A 0 2 ) .
If r i ( A 0 2 ) r j ( A 0 2 ) = 0 , then ( z a ¯ ) 2 = ( A 0 2 ) i i or ( z a ¯ ) 2 = ( A 0 2 ) j j . We can get z Ω i ( A ) or z Ω j ( A ) and hence z Ω i ( A ) Ω j ( A ) . If r i ( A 0 2 ) r j ( A 0 2 ) > 0 , we have from Inequality (8),
| ( z a ¯ ) 2 ( A 0 2 ) i i | r i ( A 0 2 ) | ( z a ¯ ) 2 ( A 0 2 ) j j | r j ( A 0 2 ) 1 ,
that is, | ( z a ¯ ) 2 ( A 0 2 ) i i | r i ( A 0 2 ) or | ( z a ¯ ) 2 ( A 0 2 ) j j | r j ( A 0 2 ) . Hence, z Ω i ( A ) or z Ω j ( A ) , consequently, z Ω i ( A ) Ω j ( A ) and
Ω ¯ i j ( A ) Ω i ( A ) Ω j ( A ) .
As Equation (9) holds for any i and j ( i j ) in N, therefore Ω ¯ ( A ) Ω ( A ) .  ☐
Example 1.
Consider the matrix A (the matrix A 4 in [9]),
A = 2 i 3 i 0 2 1 5 i 4 1 2 2 i 1 1 2 .
the sets Γ ( A ) , K ( A ) , Ω ( A ) , and Ω ¯ ( A ) are shown in Figure 1, where Γ ( A ) is represented by the outside boundary, K ( A ) by the middle, Ω ( A ) by the inner, and Ω ¯ ( A ) is filled. The exact eigenvalues are plotted with asterisks. It is easy to see that
Ω ¯ ( A ) Ω ( A ) K ( A ) Γ ( A ) .
This example shows that the the new eigenvalue inclusion set in Theorem 4 is tighter than the Geršgorin set Γ ( A ) , the Brauer set K ( A ) and the set Ω ( A ) obtained in [9].
Remark 1.
From Theorems 3 and 5, we have that
Ω ¯ ( A ) Ω ( A ) , Ω ¯ ( A T ) Ω ( A T ) , Ω ¯ ( A ) Ω ¯ ( A T ) Ω ( A ) Ω ( A T )
and
Ω 2 ( A ) Ω 1 ( A ) ( Ω ( A ) Ω ( A T ) ) .
Note here that Ω 1 ( A ) = Ω 1 ( A T ) and Ω 2 ( A ) = Ω 2 ( A T ) . However, the sets Ω 2 ( A ) and Ω ¯ ( A ) Ω ¯ ( A T ) (also Ω 1 ( A ) and Ω ¯ ( A ) Ω ¯ ( A T ) ) cannot be compared with each other. In fact, we also consider the matrix A in Example 1, and draw Ω 2 ( A ) , and Ω ¯ ( A ) Ω ¯ ( A T ) in Figure 2 and Figure 3. It is not difficult to see that
Ω 2 ( A ) / Ω ¯ ( A ) Ω ¯ ( A T )
and
Ω ¯ ( A ) Ω ¯ ( A T ) / Ω 2 ( A ) .

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 I = [ π , π ) and periodically extended to the whole real axis, and the Fourier coefficients a k of f that is
a k = 1 2 π π π f ( x ) e i k x d x , ( i 2 = 1 )
where k is an integer number. From the coefficients a k one can build the infinite dimensional Toeplitz matrix T n ( f ) with entries ( T n ( f ) ) s t = a s t , s , t = 1 , 2 , n [12,13,16].
Toeplitz matrices are constant along all their NW-SE diagonals [7,9], i.e., a Toeplitz matrix T C n × n has the following form:
T = t 0 t 1 t 2 t n 1 t 1 t 0 t 1 t n 2 t 2 n t 1 t 0 t 1 t 1 n t 2 t 1 t 0 .
Indeed, if f is a real valued function, we have a k = a ¯ k and, consequently, T n ( f ) is Hermitian; moreover, if f ( x ) = f ( x ) , then the coefficients a k are real and T n ( f ) is symmetric. The following result can be found in [12,19] and in a multilevel setting in [16,17].
Theorem 6
([17,19]).Let λ j ( n ) be the eigenvalues of T n ( f ) sorted in nondecreasing order, and m f = ess inf f , M f = ess sup f .
a. 
If m f < M f , then λ j ( n ) ( m f , M f ) for every j and n; if m f = M f , then f is constant and trivially T n ( f ) = m f I n with I n identity of size n;
b. 
The following asymptotic relationships hold: lim n λ 1 ( n ) = m f , lim n λ n ( n ) = M f .
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 T = [ t i j ] C n × n be a Toeplitz matrix and t i i = t ¯ , n 2 . Then,
σ ( T ) Ω ( T ) = i = 1 n 2 Ω i ( T ) ,
where
Ω i ( T ) = { z C : | z t ¯ ( T 0 2 ) i i | | z t ¯ + ( T 0 2 ) j j | v i ( T 0 2 ) } ,
T 0 = T t ¯ I , v i ( T 0 2 ) = max { r i ( T 0 2 ) , r n i + 1 ( T 0 2 ) } ,
and
n 2 = n 2 , i f n i s e v e n , n + 1 2 , i f n i s o d d .
Furthermore, Ω ( T ) K ( T ) Γ ( T ) .
Next, by applying Theorem 4 to Toeplitz matrices, we obtain a new eigenvalue inclusion set.
Theorem 8.
Let T = [ t i j ] C n × n be a Toeplitz matrix with t 11 = t ¯ and n 2 . Then,
σ ( T ) Ω ¯ ( T ) = i , j n 2 , i j Ω ¯ i j 1 ( T ) i n 2 Ω ¯ i ( T ) ,
where
Ω ¯ i j 1 ( T ) = { z C : | z t 0 ( T 0 2 ) i i | | z t 0 + ( T 0 2 ) i i | | z t 0 ( T 0 2 ) j j | | z t 0 + ( T 0 2 ) j j | V i ( T 0 2 ) V j ( T 0 2 ) } ,
Ω ¯ i ( T ) = { z C : | z t 0 ( T 0 2 ) i i | | z t 0 + ( T 0 2 ) i i | 2 r i ( T 0 2 ) r n i + 1 ( T 0 2 ) } ,
V i ( T 0 2 ) = max { r i ( T 0 2 ) , r n i + 1 ( T 0 2 ) } , a n d T 0 = T t 0 I .
Proof. 
Since T is Toeplitz and T 0 = T t ¯ I , we have that T 0 is also Toeplitz and T 0 2 is persymmetric. Therefore, the main diagonal of T 0 2 has at most n 2 distinct values, and ( T 0 2 ) i i = ( T 0 2 ) n i + 1 , n i + 1 for i = 1 , 2 , , n 2 . Hence, by Theorem 4 and Equation (6), for any λ σ ( T ) , λ Ω ¯ ( T ) = i , j N , i j Ω ¯ i j ( T ) . For the case i , j { 1 , 2 , , n 2 } , j i , we have
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) j j | r i ( T 0 2 ) r j ( T 0 2 ) .
For the case i { 1 , 2 , , n 2 } , j N { 1 , 2 , , n 2 } , j n i + 1 , we have
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) n j + 1 , n j + 1 | r i ( T 0 2 ) r n j + 1 ( T 0 2 ) .
Note that ( T 0 2 ) j j = ( T 0 2 ) n j + 1 , n j + 1 , then
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) j j | r i ( T 0 2 ) r n j + 1 ( T 0 2 ) .
From Inequalities (10) and (11), we can get that
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) j j | r i ( T 0 2 ) V j ( T 0 2 ) ,
where V j ( T 0 2 ) = max { r j ( T 0 2 ) , r n j + 1 ( T 0 2 ) } . Similarly, we obtain
| ( λ t ¯ ) 2 ( T 0 2 ) n i + 1 , n i + 1 | | ( λ t ¯ ) 2 ( T 0 2 ) j j | r n i + 1 , n i + 1 ( T 0 2 ) V j ( T 0 2 ) .
From ( T 0 2 ) i i = ( T 0 2 ) n i + 1 , n i + 1 , Inequalities (12) and (13), we could easily get, for any i , j { 1 , 2 , , n 2 } and j i ,
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) j j | V i ( T 0 2 ) V j ( T 0 2 ) .
Furthermore, for any i { 1 , 2 , , n 2 } , j = n i + 1 ,
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) n i + 1 , n i + 1 | r i ( T 0 2 ) r n i + 1 ( T 0 2 )
which is equivalent to
| ( λ t ¯ ) 2 ( T 0 2 ) i i | | ( λ t ¯ ) 2 ( T 0 2 ) i , i | r i ( T 0 2 ) r n i + 1 ( T 0 2 ) ,
that is,
| z t 0 ( T 0 2 ) i i | | z t 0 + ( T 0 2 ) i i | 2 r i ( T 0 2 ) r n i + 1 ( T 0 2 ) .
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 T = [ t i j ] C n × n be a Toeplitz matrix with t 11 = t ¯ and n 2 . Then,
Ω ¯ ( T ) Ω ( T ) K ( T ) Γ ( T ) .
Example 2.
Consider the Toeplitz matrix Q in [9]:
Q = 6 1 1 2 i 0 6 1 1 1 0 6 1 4 1 0 6 .
In Figure 4, the sets Γ ( Q ) , K ( Q ) , Ω ( Q ) , and Ω ¯ ( Q ) are shown, where Γ ( Q ) is represented by the outside boundary, K ( Q ) by the middle, Ω ( Q ) by the inner, and Ω ¯ ( Q ) is filled. The exact eigenvalues are plotted with asterisks. As we can see,
Ω ¯ ( Q ) Ω ( Q ) K ( Q ) Γ ( Q ) .
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.

4. Conclusions

In this paper, we obtain a new eigenvalue inclusion set for matrices with a c.m.d. We then apply this result to Toeplitz matrices, and get a set including all eigenvalues of Toeplitz matrices. Although they needs more computations to obtain the new eigenvalue sets than those in [9], the new sets capture all eigenvalues more precisely than those in [9].

Author Contributions

All the authors inferred the main conclusions and approved the current version of this manuscript.

Funding

This research was funded by the Applied Basic Research Programs of Science and Technology Department of Yunnan Province (grant number 2018FB001), Outstanding Youth Cultivation Project for Yunnan Province (grant number 2018YDJQ021), Program for Excellent Young Talents in Yunnan University, and Yunnan Provincial Ten Thousands Plan Young Top Talents.

Acknowledgments

We would like to thank the editor Kathy Wang, and the referees for their detailed and helpful comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Brauer, A. Limits for the characteristic roots of a matrix II. Duke Math. J. 1947, 14, 21–26. [Google Scholar] [CrossRef]
  2. Cvetković, L. H-matrix theory vs. eigenvalue localization. Numer. Algorithms 2006, 42, 229–245. [Google Scholar] [CrossRef]
  3. Cvetković, L.; Kostić, V.; Bru, R.; Pedroche, F. A simple generalization of Geršgorin’s theorem. Adv. Comput. Math. 2011, 35, 271–280. [Google Scholar] [CrossRef]
  4. Cvetković, L.; Kostić, V.; Varga, R.S. A new Geršgorin-type eigenvalue inclusion set. Electron. Trans. Numer. Anal. 2004, 18, 73–80. [Google Scholar]
  5. Geršgorin, S. U¨ber die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad. Nauk SSSR Ser. Mat. 1931, 1, 749–754. [Google Scholar]
  6. Li, C.Q.; Li, Y.T. Generalizations of Brauer’s eigenvalue localization theorem. Electron. J. Linear Algebra 2011, 22, 1168–1178. [Google Scholar] [CrossRef]
  7. Li, C.Q.; Li, Y.T. New regions including eigenvalues of Toeplitz matrices. Linear Multilinear Algebra 2014, 62, 229–241. [Google Scholar] [CrossRef]
  8. Melman, A. Modified Gershgorin Disks for Companion Matrices. Siam Rev. 2012, 54, 355–373. [Google Scholar] [Green Version]
  9. Melman, A. Ovals of Cassini for Toeplitz matrices. Linear Multilinear Algebra 2012, 60, 189–199. [Google Scholar] [CrossRef]
  10. Sang, C.L.; Zhao, J.X. Eventually DSDD Matrices and Eigenvalue Localization. Symmetry 2018, 10, 448. [Google Scholar] [CrossRef]
  11. Varga, R.S. Geršgorin and His Circles; Springer: Berlin, Germany, 2004. [Google Scholar]
  12. Di Benedetto, F.; Fiorentino, G.; Serra, S. CG preconditioning for Toeplitz matrices. Comput. Math. Appl. 1993, 25, 35–45. [Google Scholar] [CrossRef]
  13. B¨ttcher, A.; Grudsky, S. On the condition numbers of large semi-definite Toeplitz matrices. Linear Algebra Appl. 1998, 279, 285–301. [Google Scholar] [CrossRef]
  14. Bunch, J.R. Stability of methods for solving Toeplitz systems of equations. SIAM J. Sci. Stat. Comput. 1985, 6, 349–364. [Google Scholar] [CrossRef]
  15. Pourahmadi, M. Remarks on extreme eigenvalues of Toeplitz matrices. Int. J. Math. Math. Sci. 1988, 11, 23–26. [Google Scholar] [CrossRef] [Green Version]
  16. Serra, S. Preconditioning strategies for asymptotically ill-conditioned block Toeplitz systems. BIT 1994, 34, 579–594. [Google Scholar] [CrossRef]
  17. Serra, S. On the Extreme Eigenvalues of Hermitian (Block) Toeplitz Matrices. Linear Algebra Appl. 1998, 270, 109–129. [Google Scholar] [CrossRef]
  18. Capizzano, S.S.; Tilli, P. Extreme singular values and eigenvalues of non-Hermitian block Toeplitz matrices. J. Comput. Appl. Math. 1999, 108, 113–130. [Google Scholar] [CrossRef]
  19. Grenander, U.; Szego¨, G. Toeplitz Forms and Their Applications, 2nd ed.; Chelsea: New York, NY, USA, 1984. [Google Scholar]
Figure 1. Ω ¯ ( A ) Ω ( A ) K ( A ) Γ ( A ) .
Figure 1. Ω ¯ ( A ) Ω ( A ) K ( A ) Γ ( A ) .
Symmetry 10 00745 g001
Figure 2. Ω 2 ( A ) .
Figure 2. Ω 2 ( A ) .
Symmetry 10 00745 g002
Figure 3. Ω ¯ ( A ) Ω ¯ ( A T ) .
Figure 3. Ω ¯ ( A ) Ω ¯ ( A T ) .
Symmetry 10 00745 g003
Figure 4. Ω ¯ ( Q ) Ω ( Q ) K ( Q ) Γ ( Q ) .
Figure 4. Ω ¯ ( Q ) Ω ( Q ) K ( Q ) Γ ( Q ) .
Symmetry 10 00745 g004

Share and Cite

MDPI and ACS Style

Zhang, W.; Li, C. An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry. Symmetry 2018, 10, 745. https://doi.org/10.3390/sym10120745

AMA Style

Zhang W, Li C. An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry. Symmetry. 2018; 10(12):745. https://doi.org/10.3390/sym10120745

Chicago/Turabian Style

Zhang, Weiqian, and Chaoqian Li. 2018. "An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry" Symmetry 10, no. 12: 745. https://doi.org/10.3390/sym10120745

APA Style

Zhang, W., & Li, C. (2018). An Eigenvalue Inclusion Set for Matrices with a Constant Main Diagonal Entry. Symmetry, 10(12), 745. https://doi.org/10.3390/sym10120745

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop