In this paper, we discuss new inequalities for accretive matrices through non standard domains. In particular, we present several relations for $A^r$ and $A\sharp_rB$, when $A,B$ are accretive and $r\in (-1,0)\cup (1,2).$ This complements the well established discussion of such quantities for accretive matrices when $r\in [0,1],$ and provides accretive versions of known results for positive matrices.
The concept of Loewner (partial) order for general complex matrices is introduced. After giving the definition of arithmetic, geometric, and harmonic mean for accretive-dissipative matrices, we study their basic properties. An AM-GM-HM inequality is established for two accretive-dissipative matrices in the sense of this extended Loewner order. We also compare the harmonic mean and parallel sum of two accretive-dissipative matrices, revealing an interesting relation between them. A number of examples are included.
The main goal of this paper is to discuss the recent advancements of operator means for accretive matrices in a more general setting. In particular, we present the general form governing the well established definition of geometric mean, then we define arbitrary operator means and functional calculus for accretive matrices. Applications of this new discussion involve generalizations of known inequalities from the setting of positive matrices to that of accretive matrices. This includes the arithmetic-harmonic mean comparisons, monotony of operator means, Ando's inequality, Choi's inequality, A…
The numerical radius of a matrix is a scalar quantity that has many applications in the study of matrix analysis. Due to the difficulty in computing the numerical radius, inequalities bounding it have received a considerable attention in the literature. In this article, we present many new bounds for the numerical radius of accretive matrices. The importance of this study is the presence of a new approach that treats a specific class of matrices, namely the accretive ones. The new bounds provide a new set of inequalities, some of which can be considered as refinements of other existing ones, w…
Let $A={bmatrix} A_{11} &A_{12} A_{21} & A_{22} {bmatrix}$ be an $n\times n$ accretive-dissipative matrix, $k$ and l be the orders of $A_{11}$ and $A_{22}$, respectively, and let $m=\min\{k,l\}$. Then $$|\det A|\le a|\det A_{11}|\cdot|\det A_{22}|,$$ where $a=\{{array}{l l} 2^{3m/2}, & \text{if} m\le n/3; 2^{n/2}, & \text{if} n/3<m\le n/2. {array}.$ This improves a result of Ikramov.
To better understand the algebra $\mathcal{M}_n$ of all $n\times n$ complex matrices, we explore the class of accretive matrices. This class has received renowned attention in recent years due to its role in complementing those results known for positive definite matrices. More precisely, we have several results that allow a better understanding of accretive matrices. Among many results, we present order-preserving results, Choi-Davis-type inequalities, mean-convex inequalities, sub-multiplicative results for the real part, and new bounds of the absolute value of accretive matrices. These resu…
In this article, we employ a standard convex argument to obtain new and refined inequalities related to the matrix mean of two accretive matrices, the numerical radius and the Tsallis relative operator entropy.
We study the class of Hankel matrices for which the $k\times k$-block-matrices are positive semi-definite. We prove that a $k\times k$-block-matrix has non zero determinant if and only if all $k\times k$-block matrices have non zero determinant. We use this result to extend the notion of propagation phenomena to $k$-hyponormal weighted shifts. Finally we give a study on invariance of $k$-hyponormal weighted shifts under one rank perturbation.
We study the $l^p$ norms of a class of weighted mean matrices whose diagonal terms are given by $n^α/\sum^{n}_{i=1}i^α$ with $α> -1$. The $l^p$ norms of such matrices are known for $p \geq 2, (α+1)p >1$ and $1<p \leq 4/3, 1/p \leq α\leq 1$. In this paper, we determine the $l^p$ norms of such matrices for $p \geq 1.35, 0\leq α\leq 1$.
The concepts of weighted numerical radius has been defined in recent times. In this article, we obtain several upper bound for weighted numerical radius of operators and $2 \times 2$ operator matrices which generalize and improves some well known famous inequality for classical numerical radius. We also obtain an upper bound for the weighted numerical radius of the Aluthge transformation, $\tilde{T}$ of an operator $T \in \mathcal{B}(\mathcal{H}),$ where $\tilde{T} = |T|^{1/2} U |T|^{1/2}$ and $T = U |T|$ be the canonical polar decomposition of $T.$
Let $μ_p(A,B,t)=(tA^p+(1-t)B^p)^{1/p}$ denote the weighted power mean between positive operators $A$ and $B$. We show that the function $t\to \|A-μ_p(A,B,t)\|_2$ is monotonically decreasing whenever $1/2 \leq p \leq 1$. Hence showing that the weighted power means satisfy Audenaert's "in-betweenness" property for positive operators for power satisfying $1/2 \leq p \leq 1$. We also show that when $p>2$ there exist operators for which the weighted power mean does not satisfy this "in-betweenness" property with respect to the Euclidean metric.
In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of different sizes) overlap at sufficiently many points, then the two matrices share common generalized eigenvalues.
The main aim of this paper is to compare two recent approaches for investigating the interspace between the union of Gevrey spaces $\mathcal G_t (U)$ and the space of smooth functions $C^{\infty}(U)$. The first approach in the style of Komatsu is based on the properties of two parameter sequences $M_p=p^{τp^σ}$, $τ>0$, $σ>1$. The other one uses weight matrices defined by certain weight functions. We prove the equivalence of the corresponding spaces in the Beurling case by taking projective limits with respect to matrix parameters, while in the Roumieu case we need to consider a larger space th…
In this paper the geometric mean of partial positive definite matrices with missing entries is considered. The weighted geometric mean of two sets of positive matrices is defined, and we show whether such a geometric mean holds certain properties which the weighted geometric mean of two positive definite matrices satisfies. Additionally, counterexamples demonstrate that certain properties do not hold. A Loewner order on partial Hermitian matrices is also defined. The known results for the maximum determinant positive completion are developed with an integral representation, and the results are…
We consider in this paper two different types of the weighted geometric means of positive definite operators. We show the component-wise bijection of these geometric means and give a geometric property of the spectral geometric mean as a metric midpoint. Moreover, several interesting inequalities related with the geometric means of positive definite operators will be shown. We also see the meaning of weighted geometric means in the gyrogroup structure with finite dimension and find the formulas of weighted geometric means of 2-by-2 positive definite matrices and density matrices.
We offer a new proof of uniform convexity inequalities for the Finsler manifold of nonpositive curvature taken on the space of positive-semidefinite matrices with the weighted matrix geometric mean defining the geodesic between two points. Using the technique of log majorization, we are able to characterize that the equality cases of said equalities occur if and only if the matrices commute, and hence are the same as in $\ell^p$.
An $n$-by-$n$ ($n\ge 3$) weighted shift matrix $A$ is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the $a_j$'s, called the weights of $A$, are complex numbers. Assume that all $a_j$'s are nonzero and $B$ is an $n$-by-$n$ weighted shift matrix with weights $b_1,..., b_n$. We show that $B$ is unitarily equivalent to $A$ if and only if $b_1... b_n=a_1...a_n$ and, for some fixed $k$, $1\le k \le n$, $|b_j| = |a_{k+j}|$ ($a_{n+j}\equiv a_j$) for all $j$. Next, we show that $A$ is reducible if and only if $A$ has periodic weights, that …
We study $l^p$ operator norms of factorable matrices and related results. We give applications to $l^p$ operator norms of weighted mean matrices and Copson's inequalities. We also apply the method in this paper to study the best constant in an inequality of Hardy, Littlewood and Pólya.
The algebra of Schur operators on l^2 is known not to be inverse-closed. When l^2=l^2(X) where X is a metric space, we can consider elements of the Schur algebra with certain decay at infinity. For instance if X has the doubling property, then Q. Sun has proved that the weighted Schur algebra for a strictly polynomial weight is inverse-closed. Here, we prove a result dealing with left-invertibility. Namely, if such an operator is bounded below in l^p for some p, then it is bounded below for all q, and it admits a left-inverse in the weighted Schur algebra.
Here we prove the convergence of the Ando-Li-Mathias and Bini-Meini-Poloni procedures for matrix means. Actually it is proved here that for a two-variable function which maps pairs of positive definite matrices to a positive definite matrix and is not greater than the square mean of two positive definite matrices, the Ando-Li-Mathias and Bini-Meini-Poloni procedure converges. In order to be able to set up the Bini-Meini-Poloni procedure, a weighted two-variable matrix mean is also needed. Therefore a definition of a two-variable weighted matrix mean corresponding to every symmetric matrix mean…
The (un)weighted stability for some matrices is one of essential hypotheses in time-frequency analysis and applied harmonic analysis. In the first part of this paper, we show that for a localized matrix in a Beurling algebra, its weighted stabilities for different exponents and Muckenhoupt weights are equivalent to each other, and reciprocal of its optimal lower stability bound for one exponent and weight is controlled by a polynomial of reciprocal of its optimal lower stability bound for another exponent and weights. Inverse-closed Banach subalgebras of matrices with certain off-diagonal deca…
Let $G$ be a connected graph with $V(G)=\{1,\dotsc,n\}$. Then the resistance distance between any two vertices $i$ and $j$ is given by $r_{ij}:=l_{ii}^† + l_{jj}^†-2 l_{ij}^†$, where $l_{ij}^†$ is the $(i,j)^{\rm th}$ entry of the Moore-Penrose inverse of the Laplacian matrix of $G$. For the resistance matrix $R:=[r_{ij}]$, there is an elegant formula to compute the inverse of $R$. This says that \[R^{-1}=-\frac{1}{2}L + \frac{1}{τ' R τ} ττ', \] where \[τ:=(τ_1,\dotsc,τ_n)'~~\mbox{and}~~ τ_{i}:=2- \sum_{\{j \in V(G):(i,j) \in E(G)\}} r_{ij}~~~i=1,\dotsc,n. \] A far reaching generalization of t…
We introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [M.B. Tasic, P.S. Stanimirovic, M.D. Petkovic, Symbolic computation of weighted Moore-Penrose inverse using partitioning method, Appl. Math. Comput. 189 (2007) 615-640] to multiple-variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizatio…
We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method for computing the weighted Moore-Penrose inverse for constant matrices, originated in Wang and Chen [G.R. Wang, Y.L. Chen, A recursive algorithm for computing the weighted Moore-Penrose inverse AMN, J. Comput. Math. 4 (1986) 74-85], and the partitioning method for computing the Moore-Penr…