Related papers: Karamardian Matrices: A Generalization of $Q$-Matr…
In this paper we study the low rank matrix completion problem using tools from Schur complement. We give a sufficient and necessary condition such that the completed matrix is globally unique with given data. We assume the observed entries…
A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…
In this paper, several Kaczmarz-type numerical methods for solving the matrix equation $AX=B$ and $XA=C$ are proposed, where the coefficient matrix $A$ may be full rank or rank deficient. These methods are iterative methods without matrix…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in…
Let $n,\alpha\geq 2$. Let $K$ be an algebraically closed field with characteristic $0$ or greater than $n$. We show that the dimension of the variety of pairs $(A,B)\in {M_n(K)}^2$, with $B$ nilpotent, that satisfy $AB-BA=A^{\alpha}$ or…
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
A square matrix $M$ with real entries is said to be algebraically positive (AP) if there exists a real polynomial $p$ such that all entries of the matrix $p(M)>0$. A square sign pattern matrix $S$ is said to allow algebraic positivity if…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
A matrix is called a P-matrix if all its principal minors are positive. P-matrices have found important applications in functional analysis, mathematical programming, and dynamical systems theory. We introduce a new class of real matrices…
The attainment of accurate numerical solutions of ill-conditioned linear algebraic problems involving totally positive matrices has been gathering considerable attention among researchers over the last years. In parallel, the interest of…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…
The main objective of this talk is to develop a matrix pencil approach for the study of an initial value problem of a class of singular linear matrix differential equations whose coefficients are constant matrices. By using matrix pencil…
A matrix \( A \) is called \emph{kernel partition regular} if, for every finite coloring of the natural numbers \( \mathbb{N} \), there exists a monochromatic solution to the equation \( A\vec{X} = 0 \). In 1933, Rado characterized such…