In this article, we investigate the construction of lightweight MDS matrices over the matrix polynomial residue ring. According to distributions of the minimum polynomial, distributions of XOR count and equivalence classes of MDS matrices, we propose an algorithm, which not only can construct lightest MDS matrices, but also is evidently more efficient than previous methods. Moreover, we investi...

The mixed polynomial matrix, introduced as a convenient mathematical tool for the description of physical/engineering dynamical systems, is a polynomial matrix of which the coefficients are classified into fixed constants and independent parameters. The valuated matroid, invented by Dress and Wenzel [Appl. Math. Lett., 3 (1990), pp. 33–35], is a combinatorial abstraction of the degree of minors...

We investigate the complexity of 1) computing the characteristic polynomial, the minimal polynomial, and all the invariant factors of an integer matrix, and of 2) verifying them, when the coefficients are given as input. It is known that each coefficient of the characteristic polynomial of a matrix A is computable in GapL, and the constant term, the determinant of A, is complete for GapL. We sh...

This paper presents an efficient algorithm for computing the characteristic polynomial of a matrix, which utilizes Cayley-Hamilton’s theorem. The algorithm requires no condition on input matrix and can be performed only with basic matrix operations except only one computation of inverse of constant matrix. Though the algorithm can be applied to a constant matrix, it is the most effective when a...

A new method of obtaining exact solution for the rate matrix R in the Matrix-Analytic method in case of the phase state of dimension two is proposed. The method is based on symbolic solution of the determinental polynomial equation, and obtaining a linear matrix equation for the unknown rate matrix R by Cayley–Hamilton theorem. The method is applied to analyze the EnergyPerformance tradeoff of ...

In the polynomial approach to systems control, the static output feedback problem can be formulated as follows: given two polynomial matrices D(s) and N(s), nd a constant matrix K such that polynomial matrix D(s) + KN(s) is stable. In this paper, we show that solving this problem amounts to solving a linear matrix inequality with a non-convex rank constraint. Several numerical experiments illus...

In the present work, under some di¤erentiability conditions on the potential functions , we …rst reduce the inverse scattering problem (ISP) for the polynomial pencil of the Scroedinger equation to the corresponding ISP for the generalized matrix Scrödinger equation . Then ISP will be solved in analogy of the Marchenko method. We aim to establish an e¤ective algorithm for uniquely reconstructin...

In this paper, a property of Schur polynomial of real coe cients and real Toeplitz matrix is given. Suppose that the vector of real coe cients of a Schur polynomial annihilates a real Toeplitz matrix, then the Toeplitz matrix is in fact a zero matrix.