Common multiples of operator polynomials with analytic coefficients.
In this paper we describe some properties of companion matrices and demonstrate some special patterns that arisewhen a Toeplitz or a Hankel matrix is multiplied by a related companion matrix.We present a necessary and sufficient condition, generalizing known results, for a matrix to be the transforming matrix for a similarity between a pair of companion matrices. A special case of our main result shows that a Toeplitz or a Hankel matrix can be extended using associated companion matrices, preserving...
A generalized structure of complementary matrices involved in the input-state- output Inclusion Principle for linear time-invariant systems (LTI) including contractibility conditions for static state feedback controllers is well known. In this paper, it is shown how to further extend this structure in a systematic way when considering contractibility of dynamic controllers. Necessary and sufficient conditions for contractibility are proved in terms of both unstructured and block structured complementary...
The notion of simultaneous reduction of pairs of matrices and linear operators to triangular forms is introduced and a survey of known material on the subject is given. Further, some open problems are pointed out throughout the text. The paper is meant to be accessible to the non-specialist and does not contain any new results or proofs.
We examine the problem of finding all solutions of two-sided vector inequalities given in the tropical algebra setting, where the unknown vector multiplied by known matrices appears on both sides of the inequality. We offer a solution that uses sparse matrices to simplify the problem and to construct a family of solution sets, each defined by a sparse matrix obtained from one of the given matrices by setting some of its entries to zero. All solutions are then combined to present the result in a...
In this paper, we consider the problem of solving a linear algebraic equation in a distributed way by a multi-agent system with a solvability verification requirement. In the problem formulation, each agent knows a few columns of , different from the previous results with assuming that each agent knows a few rows of and . Then, a distributed continuous-time algorithm is proposed for solving the linear algebraic equation from a distributed constrained optimization viewpoint. The algorithm is...
We shall compute the exact value of rigidity of the triangular matrix with entries 0 and 1.