Related papers: The Resolvent Mean and The Parametrized $\mathcal{…
Accretive partial transpose (APT) matrices have been recently defined, as a natural extension of positive partial transpose (PPT) matrices. In this paper, we discuss further properties of APT matrices in a way that extends some of those…
Consider a mean-reverting equation, generalized in the sense it is driven by a 1-dimensional centered Gaussian process with H\"older continuous paths on $[0,T]$ ($T > 0$). Taking that equation in rough paths sense only gives local existence…
In this work we study the set of strictly accretive matrices, that is, the set of matrices with positive definite Hermitian part, and show that the set can be interpreted as a smooth manifold. Using the recently proposed symmetric polar…
We give a necessary and sufficient smoothness condition for the scheme parameterizing the n-dimensional representations of a finitely generated associative algebra over an algebraically closed field of characteristic zero. In particular,…
Let $\mathcal{A}$ be a unital $JB$-algebra and $A,~B\in\mathcal{A}$, we extend the weighted geometric mean $A\sharp_r B$, from $r\in [0,1]$ to $r\in (-1, 0)\cup(1, 2)$. We will notice that many results will be reversed when the domain of…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
This paper is dedicated to the analysis and detailed study of a procedure to generate both the weighted arithmetic and harmonic means of $n$ positive real numbers. Together with this interpretation, we prove some relevant properties that…
For standard algorithms verifying positive definiteness of a matrix $A\in\mathbb{M}_n(\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
The main goal of this article is to study the existence of a unique positive definite common solution to a pair of matrix equations of the form \begin{eqnarray*} X^r=Q_1 + \displaystyle \sum_{i=1}^{m} {A_i}^*F(X)A_i \mbox{ and } X^s=Q_2 +…
In this paper we generalize standard results about non-commutative resolutions of quotient singularities for finite groups to arbitrary reductive groups. We show in particular that quotient singularities for reductive groups always have…
Selecting an evaluation metric is fundamental to model development, but uncertainty remains about when certain metrics are preferable and why. This paper introduces the concept of *resolving power* to describe the ability of an evaluation…
In this paper, for $0<\alpha<1$, $p>0$ and positive semidefinite matrices $A,B\ge0$, we consider the quasi-extension $\mathcal{A}_{\alpha,p}(A,B):=((1-\alpha)A^p+\alpha B^p)^{1/p}$ of the $\alpha$-weighted arithmetic matrix mean, and the…
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…
The spatial resolution of a detector, using a reference detector telecscope, can be measured applying the geometric mean method, with tracks reconstructed from hits of all the detectors, including ($\sigma_\mathrm{in}$) and excluding…
In this paper, we generalize some matrix inequalities involving matrix power and Karcher means of positive definite matrices. Among other inequalities, it is shown that if ${\mathbb A}=(A_{1},...,A_{n})$ is a $n$-tuple of positive definite…
Motivated by the refinements and reverses of arithmetic-geometric mean and arithmetic-harmonic mean inequalities for scalars and matrices, in this article, we generalize the scalar and matrix inequalities for the difference between…
We prove that for positive semidefinite matrices $A$ and $B$ the following determinantal inequality holds: \[ \det(I+A\#B)\le \det(I+A^{1/2}B^{1/2}), \] where $A\#B$ is the geometric mean of $A$ and $B$. We apply this inequality to the…
The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods.…
We improve the resolvent estimate in the Kreiss matrix theorem for a set of matrices that generate uniformly bounded semigroups. The new resolvent estimate is proved to be equivalent to Kreiss's resolvent condition, and it better describes…