Related papers: Bounds of the logarithmic mean
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…
Leveraging tools from convex analysis and incorporating additional singular value information of matrices, we completely resolve the problem of establishing perturbation bounds for the Frobenius norm of subunitary and positive polar…
We introduce several new functions that measure the distance between two points $x$ and $y$ in a domain $G\subsetneq\mathbb{R}^n$ by using the arithmetic or the logarithmic mean of the Euclidean distances from the points $x$ and $y$ to the…
We prove a new lower bound for the Frobenius norm of the inverse of an non-negative matrix. This bound is only a modest improvement over previous results, but is sufficient for fully resolving a conjecture of Harwitz and Sloane, commonly…
Linear matrix inequalities (LMIs) are ubiquitous in modern control theory, as well as in a variety of other fields in science and engineering. Their analytic centers, i.e. the maximum determinant elements of the feasible set spanned by…
This paper is concerned with the analysis of the randomized subspace iteration for the computation of low-rank approximations. We present three different kinds of bounds. First, we derive both bounds for the canonical angles between the…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…
The ordering between Wigner--Yanase--Dyson function and logarithmic mean is known. Also bounds for logarithmic mean are known. In this paper, we give two reverse inequalities for Wigner--Yanase--Dyson function and logarithmic mean. We also…
In the present paper, we consider the problem of matrix completion with noise. Unlike previous works, we consider quite general sampling distribution and we do not need to know or to estimate the variance of the noise. Two new nuclear-norm…
We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…
Our main interest is the low-rank approximation of a matrix in R^m.n under a weighted Frobenius norm. This norm associates a weight to each of the (m x n) matrix entries. We conjecture that the number of approximations is at most min(m, n).…
First, we extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Second, We develop a class of fast approximate generalized linear regression algorithms with respect to the spectral norm.…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
We give examples of families of Frobenius type structures on the punctured plane and we study their limits at the boundary. We then discuss the existence of a limit Frobenius manifold. We also give an example of a logarithmic Frobenius…
In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.
We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…
Certain new inequalities for the sums of factorials are presented.
We provide a new characterization of the logarithmic Sobolev inequality.