Related papers: The Resolvent Average for Positive Semidefinite Ma…
Inequalities for norms of different versions of the geometric mean of two positive definite matrices are presented.
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
In this paper, we propose some new semidefinite relaxations for a class of nonconvex complex quadratic programming problems, which widely appear in the areas of signal processing and power system. By deriving new valid constraints to the…
To provide generalized solutions if a given problem admits no actual solution is an important task in mathematics and the natural sciences. It has a rich history dating back to the early 19th century when Carl Friedrich Gauss developed the…
Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
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,…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…
The geometric mean of two matrices is considered and analyzed from a computational viewpoint. Some useful theoretical properties are derived and an analysis of the conditioning is performed. Several numerical algorithms based on different…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…
For operators generated by a certain class of infinite band matrices with matrix elements we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order finite difference equations. This…
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…
We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay…
The multiresolution analysis of Alpert is considered. Explicit formulas for the entries in the matrix coefficients of the refinement equation are given in terms of hypergeometric functions. These entries are shown to solve generalized…
The averaged alternating modified reflections algorithm is a projection method for finding the closest point in the intersection of closed convex sets to a given point in a Hilbert space. In this work, we generalize the scheme so that it…
We introduce and investigate the resolvent order, which is a binary relation on the set of firmly nonexpansive mappings. It unifies well-known orders introduced by Loewner (for positive semidefinite matrices) and by Zarantonello (for…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…