Inverses of multivariable polynomial matrices by discrete Fourier transforms
From MaRDI portal
Publication:701946
DOI10.1023/B:MULT.0000037345.60574.d4zbMath1061.93039MaRDI QIDQ701946
Nicholas P. Karampetakis, Stavros Vologiannidis
Publication date: 17 January 2005
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
interpolationdiscrete Fourier transformDrazin inversegeneralized inverseMoore-Penrose inversefast computationmulti-variable polynomial matrix
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Symbolic computation of weighted Moore-Penrose inverse using partitioning method ⋮ Extensions of Faddeev's algorithms to polynomial matrices ⋮ On the computation of the inverse of a two-variable polynomial matrix by interpolation ⋮ Effective partitioning method for computing weighted Moore-Penrose inverse ⋮ On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse ⋮ On the Newton bivariate polynomial interpolation with applications ⋮ Symbolic and recursive computation of different types of generalized inverses ⋮ Computation of Moore-Penrose generalized inverses of matrices with meromorphic function entries ⋮ 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
Uses Software
This page was built for publication: Inverses of multivariable polynomial matrices by discrete Fourier transforms
