Distribution of Eigenvalues and Upper Bounds of the Spread of Interval Matrices

The distribution of eigenvalues and the upper bounds for the spread of interval matrices are significant in various fields of mathematics and applied sciences, including linear algebra, numerical analysis, control theory, and combinatorial optimization. We present the distribution of eigenvalues within interval matrices and determine upper bounds for their spread using Geršgorin’s theorem. Specifically, through an equality for the variance of a discrete random variable, we derive upper bounds for the spread of symmetric interval matrices. Finally, we give three numerical examples to illustrate the effectiveness of our results.


Introduction
The distribution of eigenvalues of complex matrices is a topic widely researched by some researchers (see Refs. [1,2]).However, in practical problems, matrix elements are often obtained through measurements and computations, which can produce perturbations due to round-off errors and measurement inaccuracies.Consequently, we cannot precisely determine the elements of a matrix.Instead, we can only establish upper and lower bounds for the intervals within which these elements are constrained.As a result, the eigenvalues of real interval matrices become uncertain due to the inherent uncertainties in the matrix elements.This uncertainty complicates the task of locating and estimating the eigenvalues of interval matrices.Recently, a growing number of researchers have begun to study the eigenvalues of interval matrices (see Refs. [3][4][5][6][7][8][9][10][11]).
Throughout this paper, tr(A) denotes the trace of matrix A; λ i (A)(i = 1, 2, . . ., n) denotes the eigenvalues of the matrix; Reλ i (A) and Imλ i (A) stand for the real part and the imaginary part of λ i (A), respectively; • F denotes a Frobenius norm, i.e., for a given . ., n) be real matrices; then, P A Q.
In 1956, Mirsky conducted the first study on the spread of a matrix in [13], denoted by and then, he obtained some meaningful inequalities of the spread of a matrix for normal and hermitian matrices (see Ref. [14]).The spread of an interval matrix is denoted by The real spread and the imaginary spread of an interval matrix are defined by Many researchers have studied the spread of matrices (see Refs. [1,[15][16][17]).However, only a few of them were interested in the spread of interval matrices.In [11], upper bounds of the spread of real symmetric interval matrices were established; it has been shown that if A ∈ S n [−a, a] with n 2 and a > 0, then In this article, we focus on the distribution of the eigenvalues and upper bounds for the spread of interval matrices.In Section 2, we present the distribution for the eigenvalues of interval matrices based on Geršgorin's theorem.In Section 3, we obtain some upper bounds of the spread of interval matrices and establish upper bounds for the spread of real symmetric interval matrices.In Section 4, we provide three numerical examples to illustrate the effectiveness of our results.

Distribution of the Eigenvalues of Interval Matrices
In this section, we present a theorem concerning the distribution of eigenvalues of interval matrices.To begin, we introduce the following lemma, which is Geršgorin's theorem.Lemma 1 ([18], Theorem 6.1.1).Let A = (a ij ) be an n × n complex matrix; every eigenvalue λ i (A), i = 1, 2, . . ., n, must lie in at least one of n closed discs: Based on Lemma 1, we obtain the distribution of eigenvalues of interval matrices using Geršgorin's theorem.

Proof. Applying the Geršgorin disc theorem, for any
As a ii (i = 1, 2, . . ., n) locates on the x axis, so we can obtain n small discs centered at a ii (p ii a ii q ii ) and with radius R i .There is an annulus runway which is symmetric with respect to the x axis containing all the n small discs.We can express the annulus runway as follows: {λ The significance of the above formula is shown in Figure 1.
An annulus runway that contains all the small discs.
For an n × n interval matrix A I , there are numerous annulus runways like Figure 1, containing all the eigenvalues of interval matrix A I , so we can use a single big annulus runway containing all the small annulus runways.We can express the big annulus runway as follows: The significance of the above formula is shown in Figure 2.
A single big annulus runway that contains the small annulus runways.
Thus, λ(A I ) ⊂ G(A I ), and the proof is completed.
If all the elements of an interval matrix belong to the same interval, then an application of Theorem 1 can be seen in the following result.

Corollary 1. Let A
. ., n be an n × n interval matrix and λ(A I ) = {λ i (A)|A ∈ A I , i = 1, 2, . . ., n} be the set of eigenvalues of A I : Then, λ(A I ) ⊂ G(A I ).

The Spread of Interval Matrices
In this section, we give some upper bounds of the spread of general interval matrices and real symmetric interval matrices.
Based on Theorem 1, we have our first result for upper bounds of the spread of general interval matrices.Theorem 2. LetA I be an n × n interval matrix and the set of eigenvalues of A I : Proof.In Theorem 1, we bind all eigenvalues of a given interval matrix in a single big annulus runway in the complex plane; then, the spread of s(A I ), s R (A I ) must not exceed the major axis max q ii − min p ii + 2 max R i in the annulus runway, that is s I (A I ) must not exceed the minor axis 2 max R i in the annulus runway, that is The proof is completed.
In order to obtain a better upper bound for the spread of interval matrices, we introduce a lemma from reference [13].
Lemma 2. Let z 1 , z 2 , . . ., z n be any complex numbers, and write with equality if and only if z 1 , z 2 , . . ., z n satisfy condition ϕ.

Remark 1.
If n complex numbers z 1 , z 2 , . . ., z n are such that n − 2 among them are equal to each other and to the arithmetic mean of the remaining two, we shall say that the n numbers satisfy condition ϕ.
Based on inequality (2) in Lemma 2, we have another result about the upper bound for the spread of interval matrices.Theorem 3. Let A I be an n × n interval matrix and λ(A I ) = {λ i (A)|A ∈ A I , i = 1, 2, . . ., n} be the set of eigenvalues of A I ; then, s(A I ) Proof.According to inequality (2), for any matrix A ∈ A I , we can obtain for the eigenvalues λ 1 , λ 2 , . . ., λ n of matrix A. By Lagrange's identity, it follows that and then, By the following inequality in [19], Apply inequalities (4) and ( 5) to (3), and we can obtain the following conclusion: .
The above inequality holds for any matrix A ∈ A I .The proof is completed.
Remark 2. The upper bound of spread of Theorem 3 is more accurate than the result of Theorem 2.
Next, we will consider a special type of interval matrices whose entries are in the interval [a, b].The following lemma about an equality for the variance of a discrete random variable is necessary.Lemma 3 ([20], Lemma 1).Let x i be discrete random variables, P(x = x i ) = p i , i = 1, 2, . . ., n, and b = max Based on inequality (3) and Lemma 3, we have the following theorem.
if n is odd.

Proof. By inequality (3) and
2 attains the maximum.Without loss of generality, we have the following inequality: .
So taking max{|a|, |b|} as the maximum of |a ij |(i = j), we obtain By the variance formula, then we have Combining (7) with Lemma 3, then Var(a ii ) cannot achieve the maximum until (b and Var(a ii ) can achieve the maximum as Considering (7), we have Combining ( 6) with ( 8), we have If n is odd, let (b − a ii )(a ii − a) = 0, that is a ii = b or a ii = a(i = 1, 2, . . ., n).Similar to n being even, m = (n − 1)/2, so we conclude that (b , and then, Combining ( 6) with ( 9), we have The proof is completed.
If n is even, the conclusion in Corollary 2 is the same as inequality (1), but we have provided a more concise proof.

Numerical Example
In this section, we will give several examples to illustrate the effectiveness of our results.
In interval matrix A I , we have min The eigenvalues of A are From Theorem 1, we can obtain the following region: Clearly, we can obtain λ i (A) ∈ G(A I ), i = 1, 2, 3.
From Theorem 2, we have s(A I ) 9, s R (A I ) 9, s I (A I ) 6.
From Theorem 3, we have s(A I ) 7.8952, which provides a more precise estimation for the spread of interval matrices than Theorem 2. From Corollary 1, we obtain the following region: Clearly, we can obtain λ i (B) ∈ G(S 3 [1,4]), i = 1, 2, 3.
From Theorem 2, we have The eigenvalues of C are λ

Conclusions
We present the distribution of eigenvalues of interval matrices and establish upper bounds for their spread.Theorem 1 provide the distribution of eigenvalues of interval matrices.Theorems 2 and 3 both offer upper bounds for the spread of general interval matrices.Notably, the upper bound provided by Theorem 4 exhibits higher accuracy compared with that of Theorems 2 and 3. Theorem 4 introduces upper bounds for the spread of symmetric interval matrices, and we obtain the same inequality as (1) when n is even based on a simple proof.
Institutional Review Board Statement: We certify that this manuscript is original and has not been published and will not be submitted elsewhere for publication while being considered by Mathematics.And, the study is not split up into several parts to increase the number of submissions and submitted to various journals or to one journal over time.
Data Availability Statement: Data sharing not applicable.

|a ij | 2 ;
and S n [a, b] denotes the set of n × n real symmetric matrices whose entries are in the interval [a, b].Let A I be a set of real matrices defined by [12]: /n = (a + b)/2 and a ii = b or a ii = a.Let 1 < m < n, a 11 = a, a 22 = a, . . ., a mm = a, a m+1,m+1 = b, . . ., a nn = b; then, (ma + (n − m)b)/n = (a + b)/2, solving the equation m = n 2 , so we conclude that max Var(a ii ) = (b − a) 2 4 .