Brauer-Type Inclusion Sets of Zeros for Chebyshev Polynomial

: The generalized polynomials such as Chebyshev polynomial and Hermite polynomial are widely used in interpolations and numerical ﬁttings and so on. Therefore, it is signiﬁcant to study inclusion regions of the zeros for generalized polynomials. In this paper, several new inclusion sets of zeros for Chebyshev polynomials are presented by applying Brauer theorem about the eigenvalues of the comrade matrix of Chebyshev polynomial and applying the properties of ovals of Cassini. Some examples are given to show that the new inclusion sets are tighter than those provided by Melman (2014) in some cases.


Introduction
The inclusion region of polynomial zeros is widely used in the theory of differential equations, the complex functions and the numerical analysis. There are some inclusion regions for polynomial zeros in power basis [1][2][3]. However, the structures of comrade matrix for generalized polynomials are different from this of polynomial in power basis [4], so it is difficult to use them to generalized polynomials such as Chebyshev polynomial and Hermite polynomial, which are widely used in interpolations and numerical fittings. Therefore, it is necessary to use some new methods to study inclusion regions of the zeros for polynomials in generalized basis. In [5], Melman used linear algebra techniques to derive two Gershgorin-type inclusion disks of the zeros for polynomials in generalized basis, specially the Chebyshev basis. Definition 1 ([6]). The Chebyshev polynomials {T i (z)} and {U i (z)} of the first and second kind, respectively, are defined by the relation T 0 (z) = 1, T 1 (z) = z, T i (z) = 2zT i−1 (z) − T i−2 (z) (i = 2, 3, · · · ), and U 0 (z) = 1, U 1 (z) = 2z, U i (z) = 2zU i−1 (z) − U i−2 (z) (i = 2, 3, · · · ).
As for practical applications, Chebyshev polynomials can be used to differential equations, approximation theory, combinatorics, Fourier series, numerical analysis, geometry, graph theory, number theory, and statistics.
Correspondingly, the first and second kind of chebyshev polynomials are the solutions of these two equations respectively. Next, we give the main results about Chebyshev polynomials obtained by Malman in [5].
with b j ∈ C, and U j (z) is the Chebyshev polynomial of the second kind, and let µ U be the largest positive solution of the equation Then all the zeros of P U are contained inŌ 0; 1 2 µ U + µ U −1 , where we denote byŌ(a; r) the closed disk with center a and radius r.
with b j ∈ C, and U j (z) is the Chebyshev polynomial of the second kind, and let V U be the largest positive solution of the equation Then all the zeros of P U are contained inŌ − b n−1 2 ; b n−1 2 In this paper, we continue to research the inclusion regions of generalized polynomial zeros. We will give a tighter inclusion sets for generalized polynomial zeros. Since Chebyshev polynomials are reprensentative of all polynomials which satisfy three-term recurrence relation, we only discuss Chebyshev polynomials. We firstly give some previous results.
In mathematics, the recurrence relation are equations defined by successive terms of a sequence or multidimensional array of values, therefore, once one or more initial terms of the sequence are given, we can calculate the value of the sequence. The property of recurrence relation makes it useful in many fields. And three-term recurrence relation is a special kind which is defined by successive three terms. Its definition is as following: We define the families of the polynomial {φ i } (i = 0, 1, 2, 3, · · · ) satisfying three-term recurrence relation as following where α i , β i , γ i ∈ C, and α i =0.
Among all the three-term recurrence relation, the Fibonacci sequence is a typical one [7]. Besides, Mathieu functions, is an example of three-term recurrence relation appears in physical problems involving elliptical shapes or periodic potentials [8].

Theorem 3 ([4]
). All the zeros of the polynomial are the eigenvalues of the comrade matrix where blank spaces indicate zero entries, φ i (z) is defined in (2), and a i ∈ C .
Because Chebyshev polynomials satisfy three-term recurrence relation, we can easily obtain the following corollaries from Theorem 3.

Corollary 1. Let polynomial
where T i (z) is the first Chebyshev polynomial. Then the comrade matrix of P T (z) is where U i (z) is the second Chebyshev polynomial. Then the comrade matrix of P U (z) is Now, we give the Brauer theorem for the eigenvalues of a matrix and Descartes' rule of signs of polynomial zeros for using in the later.
Theorem 4 ((Brauer theorem) [9]). All the eigenvalues of a matrix A= a ij ∈C n×n , n≥2, are contained in the set of Brauer set of A.

Remark 1.
Because A and A T have the same eigenvalues, so we have that all the eigenvalues of A are contained in the following set a ji is the i-th deleted absolute column sum of A, and N = {1, 2, 3, · · · , n}. K (A) is called as Brauer column set of A. It is well to be reminded that Theorem 3 and Theorem 4 are very important and can be applicable to estimate the Estrada index of weighted graphs [10,11].

Theorem 5.
(Descartes rule o f signs o f polynomial zeros) [12] Let P(x) = a 0 x b 0 + a 1 x b 1 + · · · + a n x b n be a polynomial with nonzero real coefficients a i , where the b i are integers satisfying 0 = b 0 < b 1 < b 2 < · · · < b n . Then the number of positive real zeros of P(x) (counted with multiplicities) is either equal to the number of variations in sign in the sequence a 0 , · · · , a n of the coefficients or less than that by an even whole number.

Brauer-Type Inclusion Sets for Chebyshev Polynomials Zeros
In this section, we use Brauer theorem and the properties of ovals of Cassini to derive a tighter inclusion sets for the zeros of Chebyshev polynomials.
with b j ∈ C, and U j (z) be the Chebyshev polynomial of the second kind, and let τ U be the largest positive solution of the the following real equation Then all the zeros of P U (z) are contained in z ∈ C : |z| ≤ τ U + τ −1 Proof. According to Corollary 2, the comrade matrix of the polynomial is the matrix (5). For a real number x >0, denote C where D x is the diagonal matrix with diagonal x n , x n−1 , · · · , x . By simple calculations, we have Here, C x (P U ) and C (2) (P U ) have the same eigenvalues. The Brauer column set of C x (P U ) is the union of 2 parts: It is the n-th deleted absolute column sum of C (2) x (P U ). From [13], We know the fact that the entire oval of Cassini |z| z + b n−1 2 ≤ g(x) is contained in a circle whose center is 0, radius is So the oval of Cassini is encompassed in the disk and will be tangent to it when the value of x satisfies Taking the x and multiplying this equation by x n yields By Theorem 5, this equation have one positive solution. Let τ U be the largest positive solution of the Equation (8), then all the zeros of P U (z) are contained in z ∈ C : |z| ≤ τ U + τ −1 U /2 . (8) can be used to get the inclusion sets, but it is the largest one that guarantee the smallest inclusion set because g(x) is a decreasing function of x, for x >0.

Remark 2. Any positive solution of the Equation
With Theorem 6, we naturally think of making a similar transformation on C (1) (P T ), denoting C (1) And the Brauer column set of C (1) where the radius of the former part z ∈ C : |z| ≤ max x, x+x −1 2 is a non-smooth function, which makes the subsequent proof relatively complicated. In order to avoid this situation, we use the relation (1) to obtain the following theorem.

Theorem 7.
Let P T (z) = T n (z) + a n−1 T n−1 (z) + · · · + a 1 T 1 (z) + a 0 T 0 (z), with a j ∈ C, and T j (z) be the Chebyshev polynomial of the first kind, and let τ T be the largest positive solution of the following real equation x n+2 − |a n−1 | x n+1 + (2 − |2 − a n−2 |) x n − (|a n−1 | + |a n−3 − a n−1 |) x n−1 Then all the zeros of P T (z) are contained in z ∈ C : |z| ≤ τ T + τ −1 Proof. According to the relations of the two kinds of chebyshev polynomials, the polynomial P T (z) = T n (z) + a n−1 T n−1 (z) + · · · + a 1 T 1 (z) + a 0 T 0 (z) can be expressed as By Theorem 6, though changing the corresponding coefficients, we have all the zeros of P T (z) are contained in z ∈ C : |z| ≤ τ T + τ −1 T /2 .
with b j ∈ C, and U j (z) be the Chebyshev polynomial of the second kind, and let η U be the largest positive solution of the following real equation Then all the zeros of P U (z) are contained in Proof. In [13], it is given that the point closest to 0 in the oval of Cassini lies at a distance given by Here, we take x to make the oval of Cassini encompass the disk and be tangent to it, thus where g(x) is defined as in (7). Multiplying this equation by x n yields By Theorem 5, this equation has positive roots. Let η U be the largest positive solution of Equation (9). All the zeros of P U (z) must therefore be contained in the following set

Theorem 9.
Let P T (z) = T n (z) + a n−1 T n−1 (z) + · · · + a 1 T 1 (z) + a 0 T 0 (z), with a j ∈ C, and T j (z) is the Chebyshev polynomial of the first kind, and let η T be the largest positive solution of the the following real equation x n+2 + |a n−1 | x n+1 + (2 − |2 − a n−2 |) x n + (|a n−1 | + |a n−3 − a n−1 |) x n−1 Then all the zeros of P T (z) are contained in z ∈ C : |z| z + a n−1 Proof. Similar to Theorem 7, using the relation of the two kinds of chebyshev polynomials, the polynomial P T (z) = T n (z) + a n−1 T n−1 (z) + · · · + a 1 T 1 (z) + a 0 T 0 (z) can be expressed as According to Theorem 8, by changing the corresponding coefficients, we have the fact that all the zeros of P T (z) are contained in

Examples
In this section, we give two examples to compare our results with Theorems 1 and 2 given by Melman in [5]. Theorems 7 and 9 are similar to Theorems 6 and 8, therefore, we don't give example on Theorems 7 and 9, here.

Example 1. Consider the polynomial
In Figure 1, the black area is the disk obtained from Theorem 1, the blue area is the Cassini oval obtained from the Theorem 6. The red dots are the zeros of P 1 (z). It is easy to see that our result is tighter than Melman's.

Example 2. Consider the polynomial
In Figure 2, the black area is the disk obtained from Theorem 2, the blue area is the Cassini oval obtained from the Theorem 8. The red dots are the zeros of P 2 (z). Obviously, our result is tighter than Theorem 2.

Conclusions
In the paper, several new inclusion sets of zeros for Chebyshev polynomials are presented by applying Brauer theorem about the eigenvalues of the comrade matrix of Chebyshev polynomial and applying the properties of ovals of Cassini. Some examples are given to show that the new inclusion sets are tighter than those provided by Melman (2014) in some cases. We can generalize the results to other polynomials that satisfy three-term recurrence relation such as Newton polynomial. On the other hand, because the system matrix of leader-follower cooperative control in muliti-agentsystems can be viewed as a comrade matrix [14]. Therefore, the results presented in this paper can be used to estimate the consensus rate in these problems. These problems need to be studied in the future. We can generalize our results to other polynomials that satisfy three-term recurrence relation such as Newton polynomial, but that might increase the computation.