2019
DOI: 10.48550/arxiv.1904.12096
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Bounds of numerical radius of bounded linear operator using $t$-Aluthge transform

Abstract: In this article we develop a number of inequalities to obtain bounds for the numerical radius of a bounded linear operator defined on a complex Hilbert space using the properties of t-Aluthge transform. We prove that the bounds obtained are better than the existing bounds.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
4
1

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…In this article, we obtain some upper bounds for the numerical radius of bounded linear operators and operator matrices. Using these bounds and the bounds obtained in [4,5,6,7,8] we obtain bounds for the radius of the disk with centre at origin that contains all the zeros of a complex monic polynomial. Also we show with numerical examples that these bounds obtained here improve on the existing bounds.…”
Section: Introductionmentioning
confidence: 99%
“…In this article, we obtain some upper bounds for the numerical radius of bounded linear operators and operator matrices. Using these bounds and the bounds obtained in [4,5,6,7,8] we obtain bounds for the radius of the disk with centre at origin that contains all the zeros of a complex monic polynomial. Also we show with numerical examples that these bounds obtained here improve on the existing bounds.…”
Section: Introductionmentioning
confidence: 99%
“…Kittaneh [9,10] improved on the above inequality to show that which improves on the above upper bounds. A lot of study has been done in this direction to improve upper and lower bounds for the numerical radius, and we refer the readers to [3,4,5,13,14,15], and the references therein, for a comprehensive idea of the current state of the art.…”
Section: Introductionmentioning
confidence: 99%
“…Over the years many eminent mathematicians have studied and improved on the above inequality, to cite a few of them are [6,7,9,10,11,14,15]. Recently we [2,3,4,12,13] have developed some bounds for the numerical radius and applied them to estimate zeros of polynomials. In 1963, Bernau and Smithies [1] gave an elegant proof of the inequality w(T ) ≥ 1 2 T using parallelogram law.…”
Section: Introductionmentioning
confidence: 99%