On the computation of the generalized inverse of a polynomial matrix

DOI10.1093/IMAMCI/18.1.83zbMath0987.93023OpenAlexW2098500161MaRDI QIDQ2711461

Panagiotis Tzekis, Nicholas P. Karampetakis

Publication date: 24 April 2001

Published in: IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamci/18.1.83

zbMATH Keywords

generalized inversecomputationrecursive algorithmsnon-square polynomial matrices

Mathematics Subject Classification ID

Multivariable systems, multidimensional control systems (93C35)

Related Items (15)

Computing generalized inverse of polynomial matrices by interpolation ⋮ Symbolic computation of weighted Moore-Penrose inverse using partitioning method ⋮ Interpolation algorithm of Leverrier-Faddev type for polynomial matrices ⋮ Extensions of Faddeev's algorithms to polynomial matrices ⋮ Effective partitioning method for computing weighted Moore-Penrose inverse ⋮ A finite algorithm for generalized inverses of polynomial and rational matrices ⋮ On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse ⋮ Symbolic and recursive computation of different types of generalized inverses ⋮ Computing generalized inverses using LU factorization of matrix product ⋮ Computing generalized inverses of a rational matrix and applications ⋮ Computation of Moore-Penrose generalized inverses of matrices with meromorphic function entries ⋮ Representations and symbolic computation of generalized inverses over fields ⋮ Differentiation of generalized inverses for rational and polynomial matrices ⋮ A study on new right/left inverses of nonsquare polynomial matrices ⋮ Perfect control for right-invertible Grünwald-Letnikov plants - an innovative approach to practical implementation

This page was built for publication: On the computation of the generalized inverse of a polynomial matrix