Symbolic iterative algorithm for generalized inversion of rational polynomial matrices

From MaRDI portal





After a short background on generalized inverses of matrices, one uses Hensel's lemma and the Newton-Schultz method to calculate the generalized inversion of rational polynomial matrices. Conversion to Padé rational is considered and the various algorithms so defined are extended to multivariable polynomial matrices.











This page was built for publication: Symbolic iterative algorithm for generalized inversion of rational polynomial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580902)