Further results on A-numerical radius inequalities
نویسندگان
چکیده
Let A be a bounded linear positive operator on complex Hilbert space \({\mathcal {H}}.\) Furthermore, let {B}}_A\mathcal {(H)}\) denote the set of all operators {H}}\) whose A-adjoint exists, and \({\mathbb {A}}\) signify diagonal matrix with entries are A. Very recently, several {A}}\)-numerical radius inequalities \(2\times 2\) matrices were established. In this paper, we prove few new for \(n\times n\) matrices. We also provide proof an existing result by relaxing sufficient condition “A is strictly positive”. Our proofs show importance theory Moore–Penrose inverse in field study.
منابع مشابه
Further inequalities for operator space numerical radius on 2*2 operator matrices
We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$, when $X$ is a numerical radius operator space. These inequalities contain some upper and lower bounds for operator space numerical radius.
متن کاملSome numerical radius inequalities with positive definite functions
Using several examples of positive definite functions, some inequalities for the numerical radius of matrices are investigated. Also, some open problems are stated.
متن کاملSome improvements of numerical radius inequalities via Specht’s ratio
We obtain some inequalities related to the powers of numerical radius inequalities of Hilbert space operators. Some results that employ the Hermite-Hadamard inequality for vectors in normed linear spaces are also obtained. We improve and generalize some inequalities with respect to Specht's ratio. Among them, we show that, if $A, Bin mathcal{B(mathcal{H})}$ satisfy in some conditions, it follow...
متن کاملFurther results on the covering radius of codes
A number of upper and lower bounds are obtained for K( n, R), the minimal number of codewords in any binary code of length n and covering radius R. Several new constructions are used to derive the upper bounds, including an amalgamated direct sum construction for nonlinear codes. This construction works best when applied to normal codes, and we give some new and stronger conditions which imply ...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Functional Analysis
سال: 2021
ISSN: ['2639-7390', '2008-8752']
DOI: https://doi.org/10.1007/s43034-021-00156-3