Related papers: Weighted matrix means and symmetrization procedure…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
On the set $\mathcal M$ of mean functions the symmetric mean of $M$ with respect to mean $M_0$ can be defined in several ways. The first one is related to the group structure on $\mathcal M$ and the second one is defined trough Gauss'…
A typical formula of multiple zeta values is the sum formula which expresses a Riemann zeta value as a sum of all multiple zeta values of fixed weight and depth. Recently weighted sum formulas, which are weighted analogues of the sum…
We establish a general criterion for the validity of inequalities of the following form: A certain convex combination of the values of a convex function at n points and of its value at a weighted mean of these n points is always greater or…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
Inspired by the many applications of mutually unbiased Hadamard matrices, we study mutually unbiased weighing matrices. These matrices are studied for small orders and weights in both the real and complex setting. Our results make use of…
We consider four-dimensional, Riemannian metrics for which one or other of the self-dual or anti-self-dual Weyl tensors is type-D and which satisfy the Einstein-Maxwell equations with the corresponding Maxwell field aligned with the type-D…
This work uncovers variational principles behind symmetrizing the Bregman divergences induced by generic mirror maps over the cone of positive definite matrices. We show that computing the canonical means for this symmetrization can be…
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
We give an upper bound for the weighted geometric mean using the weighted arithmetic mean and the weighted harmonic mean. We also give a lower bound for the weighted geometric mean. These inequalities are proven for two invertible positive…
Let $\mu$ be a probability measure of compact support on the set $\mathbb{P}_n$ of all positive definite matrices, let $t\in(0,1]$, and let $P_t(\mu)$ be the unique positive solution of $X=\int_{\mathbb{P}_n}X\sharp_t Z d\mu(Z)$. In this…
In this paper we prove the Jones factorization theorem and the Rubio de Francia extrapolation theorem for matrix $\mathcal A_p$ weights. These results answer longstanding open questions in the study of matrix weights. The proof requires the…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
Pairs of metrics in a two-dimensional linear vector space are considered, one of which is a Minkowski type metric. Their simultaneous diagonalizability is studied and canonical presentations for them are suggested.
Abstract Like electoral systems, decision-making methods are also vulnerable to manipulation by decision-makers. The ability to effectively defend against such threats can only come from thoroughly understanding the manipulation mechanisms.…
Recently, the so-called Hermite-Hadamard inequality for (operator) convex functions with one variable has known extensive several developments by virtue of its nice properties and various applications. The fundamental target of this paper…
We prove that for any fixed unitary matrix $U$, any abelian self-adjoint algebra of matrices that is invariant under conjugation by $U$ can be embedded into a maximal abelian self-adjoint algebra that is still invariant under conjugation by…
This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…
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…
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…