Related papers: Completely positive factorizations associated with…
Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…
We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.
This paper presents an algebraic construction of families of unitary matrices that achieve full diversity. They are obtained as subsets of cyclic division algebras.
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
In this paper, eventually totally positive matrices (i.e. matrices all whose powers starting with some point are totally positive) are studied. We present a new approach to eventual total positivity which is based on the theory of…
We characterize positive definiteness for some family of matrices. As an application we derive explicit value of the quadratic embedding constants of the path graphs.
Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static objects which serve…
A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…
This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization…
In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
We explain how a slight variant in the use of our recursive algorithm leads to improve the known lower bounds for the absolute trace of a totally positive algebraic integer. We also link the absolute trace of a totally positive algebraic…
The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…