Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion

DOI10.1080/00207179108953626zbMath0731.93027OpenAlexW2029582328MaRDI QIDQ3358565

A. I. G. Vardulakis, B. G. Mertzios, G. F. Fragulis

Publication date: 1991

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179108953626

zbMATH Keywords

examples time-invariant fundamental matrix sequence inverse of a polynomial matrix Leverrier type algorithm

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Linear systems in control theory (93C05) Operator-theoretic methods (93B28) Matrices over function rings in one or more variables (15A54) Model systems in control theory (93C99)

Related Items (31)

Partitioning method for rational and polynomial matrices ⋮ Symbolic computation of weighted Moore-Penrose inverse using partitioning method ⋮ Extensions of Faddeev's algorithms to polynomial matrices ⋮ Generalized inverses of two-variable polynomial matrices and applications ⋮ Interpolation algorithm for computing Drazin inverse of polynomial matrices ⋮ Comments on ``Reachability of polynomial matrix descriptions (PMDs) by G. F. Fragulis and A. I. G. Vardulakis ⋮ Computation of the transfer function matrix and its Laurent expansion of generalized two-dimensional systems ⋮ Representations and geometrical properties of generalized inverses over fields ⋮ On the computation of the inverse of a two-variable polynomial matrix by interpolation ⋮ Effective partitioning method for computing weighted Moore-Penrose inverse ⋮ Solution of discrete ARMA-representations via MAPLE ⋮ Generalized Cayley-Hamilton theorem for polynomial matrices with arbitrary degree ⋮ The algorithm for computing the Drazin inverses of two-variable polynomial matrices ⋮ Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization ⋮ On the Newton bivariate polynomial interpolation with applications ⋮ Symbolic and recursive computation of different types of generalized inverses ⋮ Comments on ‘COmputation of the inverse of a polynomial matrix and evaluation of its Laurent expansion’ ⋮ Computing generalized inverses using LU factorization of matrix product ⋮ Computing generalized inverses of a rational matrix and applications ⋮ Computation of the impulsive behavior of multivariable linear systems using a division algorithm ⋮ Computation of the generalized inverse of a polynomial matrix and applications ⋮ Closed form solution for the equations of motion for constrained linear mechanical systems and generalizations: an algebraic approach ⋮ Representations and symbolic computation of generalized inverses over fields ⋮ Symbolic computation of the Moore–Penrose inverse using a partitioning method ⋮ Observability of linear discrete-time systems of algebraic and difference equations ⋮ Differentiation of generalized inverses for rational and polynomial matrices ⋮ Forward, backward, and symmetric solutions of discrete ARMA representations ⋮ Response determination of linear dynamical systems with singular matrices: a polynomial matrix theory approach ⋮ On the fundamental matrix of the inverse of a polynomial matrix and applications to ARMA representations ⋮ A new method for computing the solutions of differential equation systems using generalized inverse via Maple ⋮ A finite algorithm for the Drazin inverse of a polynomial matrix

Cites Work

This page was built for publication: Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion