Displaying similar documents to “Discrete-time symmetric polynomial equations with complex coefficients”

On the computation of the minimal polynomial of a polynomial matrix

Nicholas Karampetakis, Panagiotis Tzekis (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide two algorithms for the computation of the minimal polynomial of univariate polynomial matrices. The first algorithm is based on the solution of linear matrix equations while the second one employs DFT techniques. The whole theory is illustrated with examples.

An equivalent matrix pencilfor bivariate polynomial matrices

Mohamed Boudellioua (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper, we present a simple algorithm for the reduction of a given bivariate polynomial matrix to a pencil form which is encountered in Fornasini-Marchesini's type of singular systems. It is shown that the resulting matrix pencil is related to the original polynomial matrix by the transformation of zero coprime equivalence. The exact form of both the matrix pencil and the transformation connecting it to the original matrix are established.

Remarks on inverse of matrix polynomials

Fischer, Cyril, Náprstek, Jiří

Similarity:

Analysis of a non-classically damped engineering structure, which is subjected to an external excitation, leads to the solution of a system of second order ordinary differential equations. Although there exists a large variety of powerful numerical methods to accomplish this task, in some cases it is convenient to formulate the explicit inversion of the respective quadratic fundamental system. The presented contribution uses and extends concepts in matrix polynomial theory and proposes...