相关论文: Characterizations of structured Bohemian matrices …
A Bohemian matrix family is a set of matrices all of whose entries are drawn from a fixed, usually discrete and hence bounded, subset of a field of characteristic zero. Originally these were integers -- hence the name, from the acronym…
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $\pm1$. Many properties remain after these specializations, some of…
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $1$. Even more, we consider Toeplitz matrices of this kind. Many…
We look at Bohemians, specifically those with population $\{-1, 0, {+1}\}$ and sometimes $\{0,1,i,-1,-i\}$. More, we specialize the matrices to be upper Hessenberg Bohemian. From there, focusing on only those matrices whose characteristic…
This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…
A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…
The classes of 1MP-inverses and MP1-inverses are recently introduced classes of generalized inverses of complex matrix. Actually, they coincide with the classes of $\{1,2,3\}$ and $\{1,2,4\}$ inverses, respectively. We consider these…
In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
In this paper, we introduce new representation and characterization of the weighted core inverse of matrices. Several properties of these inverses and their interconnections with other generalized inverses are also explored. Through…
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…
The complete classification of $6\times 6$ complex Hadamard matrices (CHMs) is a long-standing open problem. In this paper we investigate a series of CHMs, such as the CHMs containing a $2\times 3$ submatrix with rank one, the CHMs…
We generalize Monge property of real matrices for interval matrices. We define two classes of interval matrices with Monge property - in a strong and in a weak sense. We study fundamental properties of both classes. We show several…
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…
We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexity. Specifically, complexity of the sets of matrices…
Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…
The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…