Related papers: Linear matrix equations with parameters forming a …
In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…
This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.
We study the relation between approximate joint diagonalization of self-adjoint matrices and the norm of their commutator, and show that almost commuting self-adjoint matrices are almost jointly diagonalizable by a unitary matrix.
Consider continuous-time linear switched systems on R^n associated with compact convex sets of matrices. When the system is irreducible and the largest Lyapunov exponent is equal to zero, there always exists a Barabanov norm (i.e. a norm…
We consider a class of matrices with a specific structure that arises, among other examples, in dynamic models for biological regulation of enzyme synthesis (Tyson and Othmer, 1978). We first show that a stability condition given in (Tyson…
A one dimensional XX spin chain of finite length coupled to reservoirs at both ends is solved exactly in terms of a matrix product state ansatz. An explicit representation of matrices of fixed dimension 4 independent of the chain length is…
The generic linear evolution of the density matrix of a system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a linear…
In this work some results on the structure-preserving diagonalization of selfadjoint and skewadjoint matrices in indefinite inner product spaces are presented. In particular, necessary and sufficient conditions on the symplectic…
The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…
We revisit the canonical continuous-time and discrete-time matrix algebraic and matrix differential equations that play a central role in Lyapunov based stability arguments. The goal is to generalize and extend these types of equations and…
The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We…
Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…
We study the algebraic sets of pairs of matrices defined by the vanishing of the anti-diagonal as well as the cross-diagonal of their commutator matrix. We prove that, over a field of prime characterisitic, the coordinate ring of the latter…
We provide a characterisation of the continuous-time Markov models where the Markov matrices from the model can be parameterised directly in terms of the associated rate matrices (generators). That is, each Markov matrix can be expressed as…
The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…
The centralizer of a matrix in a full matrix algebra is called a principal centralizer matrix algebra. Characterizations are presented for principal centralizer matrix algebras to be Morita equivalent, almost $\nu$-stable derived…
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…
The Drazin inverse solutions of the matrix equations ${\rm {\bf A}}{\rm {\bf X}} = {\rm {\bf B}}$, ${\rm {\bf X}}{\rm {\bf A}} = {\rm {\bf B}}$ and ${\rm {\bf A}}{\rm {\bf X}}{\rm {\bf B}} ={\rm {\bf D}} $ are considered in this paper. We…