Algorithms. 38. CHARPOL. Computation of the characteristic polynomial of matrices
Pavla Holasová (1975)
Aplikace matematiky
Similarity:
Displaying similar documents to “On the coefficients of the max-algebraic characteristic polynomial and equation”
Algorithms. 38. CHARPOL. Computation of the characteristic polynomial of matrices
Discrete-time symmetric polynomial equations with complex coefficients
Didier Henrion, Jan Ježek, Michael Šebek (2002)
Kybernetika
Similarity:
Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.
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.
New coprime polynomial fraction representation of transfer function matrix
Yelena M. Smagina (2001)
Kybernetika
Similarity:
A new form of the coprime polynomial fraction of a transfer function matrix is presented where the polynomial matrices and have the form of a matrix (or generalized matrix) polynomials with the structure defined directly by the controllability characteristics of a state- space model and Markov matrices , , ...