Related papers: The linear targeting problem
In this paper, we study the action of special $n\times n $ linear (resp. symplectic) matrices which are homotopic to identity on the right invertible $n\times m$ matrices. We also prove that the commutator subgroup of $\rm{O}_{2n}(R[X])$ is…
Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…
We briefly discuss linear algebraic, combinatorial, and applied aspects of an exact model representation of binary arrays. As an illustration, we present two linear algebraic portraits of a string of characters.
N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex…
This paper studies the "explanation problem" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tree-ordered case. In this paper, one is given a matrix A whose…
The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…
After a review of linear imperfections and their causes, we discuss how to model them, the diagnostic equipment needed to monitor them, and the correction algorithms to fix the problem they cause. We first address linear systems - beam…
Let $B$ be some invertible Hermitian or skew-Hermitian matrix. A matrix $A$ is called $B$-normal if $AA^\star = A^\star A$ holds for $A$ and its adjoint matrix $A^\star := B^{-1}A^HB$. In addition, a matrix $Q$ is called $B$-unitary, if…
When a projection of a symmetric or Hermitian matrix to the positive semidefinite cone is computed approximately (or to working precision on a computer), a natural question is to quantify its accuracy. A straightforward bound invoking…
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…
The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…
A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…
We derive several explicit formulae for finding infinitely many solutions of the equation $AXA=XAX$, when $A$ is singular. We start by splitting the equation into a couple of linear matrix equations and then show how the projectors…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
We study a hermitian $(n+1)$-matrix model with plaquette interaction, $\sum_{i=1}^n MA_iMA_i$. By means of a conformal transformation we rewrite the model as an $O(n)$ model on a random lattice with a non polynomial potential. This allows…
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…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…