Generalized inverses of two-variable polynomial matrices and applications

From MaRDI portal
Publication:1366474

DOI10.1007/BF01198061zbMath0882.93039MaRDI QIDQ1366474

Nicholas P. Karampetakis

Publication date: 12 March 1998

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)




Related Items (20)

Partitioning method for rational and polynomial matricesComputing generalized inverse of polynomial matrices by interpolationSymbolic computation of weighted Moore-Penrose inverse using partitioning methodInterpolation algorithm of Leverrier-Faddev type for polynomial matricesExtensions of Faddeev's algorithms to polynomial matricesInterpolation algorithm for computing Drazin inverse of polynomial matricesRepresentations and geometrical properties of generalized inverses over fieldsEffective partitioning method for computing weighted Moore-Penrose inverseA finite algorithm for generalized inverses of polynomial and rational matricesOn the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverseThe algorithm for computing the Drazin inverses of two-variable polynomial matricesSymbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorizationOn the Newton bivariate polynomial interpolation with applicationsSymbolic and recursive computation of different types of generalized inversesRepresentations of generalized inverses via full-rank QDR decompositionComputing generalized inverses using LU factorization of matrix productComputing generalized inverses of a rational matrix and applicationsRepresentations and symbolic computation of generalized inverses over fieldsSymbolic computation of the Moore–Penrose inverse using a partitioning methodDifferentiation of generalized inverses for rational and polynomial matrices



Cites Work


This page was built for publication: Generalized inverses of two-variable polynomial matrices and applications