Related papers: Geometric Matrix Midranges
To develop a unitary quantum theory with probabilistic description for pseudo- Hermitian systems one needs to consider the theories in a different Hilbert space endowed with a positive definite metric operator. There are different…
We extend the application of Hamiltonian Monte Carlo to allow for sampling from probability distributions defined over symmetric or Hermitian positive definite matrices. To do so, we exploit the Riemannian structure induced by Cartan's…
We survey a variety of results about partially isometric matrices. We focus primarily on results that are distinctly finite-dimensional. For example, we cover a recent solution to the similarity problem for partial isometries. We also…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
This paper studies algebraic properties of Hermitian solutions and Hermitian definite solutions of the two types of matrix equation $AX = B$ and $AXA^* = B$. We first establish a variety of rank and inertia formulas for calculating the…
Multivalued projections are applied to the study of weighted least squares solutions of linear relations equations (or inclusions) and some of its applications. To this end a matrix representation of multivalued projections with respect to…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…
This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…
Recently, Riemannian Gaussian distributions were defined on spaces of positive-definite real and complex matrices. The present paper extends this definition to the space of positive-definite quaternion matrices. In order to do so, it…
We describe a categorical approach to finite noncommutative geometries. Objects in the category are spectral triples, rather than unitary equivalence classes as in other approaches. This enables to treat fluctuations of the metric and…
Algebraic statistics is concerned with the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry. This article presents a list of open mathematical problems in this emerging field,…
Lie brackets or Lie affgebra structures on several classes of affine spaces of matrices are studied. These include general normalised affine matrices, special normalised affine matrices, anti-symmetric and anti-hermitian normalised affine…
Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
Motivated by the fundamental results of the geometric algebra we study quadrilateral lattices in projective spaces over division rings. After giving the noncommutative discrete Darboux equations we discuss differences and similarities with…
We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…