Analytic and Geometric Inequalities and Applications 1999
DOI: 10.1007/978-94-011-4577-0_13
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Radii of Some Companion Matrices and Bounds for the Zeros of Polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2000
2000
2013
2013

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…This is a continuation of our earlier work [10] and [13]. See, also, [3], [7], [14], [15], [16], and references therein for bounds of the zeros of polynomials obtained from applying matrix inequalities to various types of companion matrices of monic polynomials. These inequalities involve the Gersgorin theorem, basic eigenvalue-singular value majorization relations, matrix norms computations, and numerical radii estimations.…”
Section: Introductionmentioning
confidence: 71%
See 1 more Smart Citation
“…This is a continuation of our earlier work [10] and [13]. See, also, [3], [7], [14], [15], [16], and references therein for bounds of the zeros of polynomials obtained from applying matrix inequalities to various types of companion matrices of monic polynomials. These inequalities involve the Gersgorin theorem, basic eigenvalue-singular value majorization relations, matrix norms computations, and numerical radii estimations.…”
Section: Introductionmentioning
confidence: 71%
“…A comparison between these bounds has been also given in [15], and generalizations of them have been given there by considering generalized companion matrices instead of the Frobenius companion matrix.…”
Section: Fuad Kittanehmentioning
confidence: 99%
“…We concentrate on this frequently used companion matrix, but there exist other companion matrices that could also be used, as in, e.g., [2], [6], [7], [14], [18], [25], [26], [27], or [36]. In the following theorem we derive an inclusion set for polynomial zeros, based on Theorem 2.1.…”
Section: Polynomial Zerosmentioning
confidence: 99%
“…316-319]), there exist several more modern methods, such as in [1], [5], [11], [12], [15], [20], [21], [22], [25], [26], [27], [28], [34], [37], [38], which were already mentioned in the introduction. Judging from the numerical examples in those references, these bounds are, by and large, comparable.…”
Section: Numerical Comparisonsmentioning
confidence: 99%
See 1 more Smart Citation