A resultant approach to computing vector characteristics of multiparameter polynomial matrices.

Khazanov, V.B.

Displaying similar documents to “A resultant approach to computing vector characteristics of multiparameter polynomial matrices.”

Minimal realizations of the inverse of a polynomial matrix using finite and infinite Jordan pairs

George F. Fragulis (1994)

Kybernetika

Similarity:

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.

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.

Separable characteristic polynomials of pencils and property $L$ .

Maroulas, John, Psarrakos, Panayiotis J., Tsatsomeros, Michael J. (2000)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Infinite elementary divisor structure-preserving transformations for polynomial matrices

Nicholas Karampetakis, Stavros Vologiannidis (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main purpose of this work is to propose new notions of equivalence between polynomial matrices that preserve both the finite and infinite elementary divisor structures. The approach we use is twofold: (a) the 'homogeneous polynomial matrix approach', where in place of the polynomial matrices we study their homogeneous polynomial matrix forms and use 2-D equivalence transformations in order to preserve their elementary divisor structure, and (b) the 'polynomial matrix approach', where...

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$ , ...

Determination of matrices of the desired 2-D characteristic polynomial

T. Kaczorek, M. Świerkosz (1988)

Applicationes Mathematicae

Similarity:

Displaying similar documents to “A resultant approach to computing vector characteristics of multiparameter polynomial matrices.”

Minimal realizations of the inverse of a polynomial matrix using finite and infinite Jordan pairs

An equivalent matrix pencilfor bivariate polynomial matrices

Discrete-time symmetric polynomial equations with complex coefficients

Separable characteristic polynomials of pencils and property L .

Infinite elementary divisor structure-preserving transformations for polynomial matrices

New coprime polynomial fraction representation of transfer function matrix

Determination of matrices of the desired 2-D characteristic polynomial

Separable characteristic polynomials of pencils and property $L$ .