Displaying similar documents to “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.

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.

New coprime polynomial fraction representation of transfer function matrix

Yelena M. Smagina (2001)

Kybernetika

Similarity:

A new form of the coprime polynomial fraction C ( s ) F ( s ) - 1 of a transfer function matrix G ( s ) is presented where the polynomial matrices C ( s ) and F ( s ) 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 H B , H A B , ...

Some new formulas for π .

Almkvist, Gert, Krattenthaler, Christian, Petersson, Joakim (2003)

Experimental Mathematics

Similarity: