Symbolic iterative algorithm for generalized inversion of rational polynomial matrices

DOI10.1016/S0747-7171(85)80036-5zbMath0626.65041OpenAlexW2080246498MaRDI QIDQ580902

E. V. Krishnamurthy

Publication date: 1985

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(85)80036-5

zbMATH Keywords

generalized inversesHensel's lemmamultivariable polynomial matricesNewton-Schultz methodPadé rationalrational polynomial matricessymbolic iterative algorithm

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05) Matrices over function rings in one or more variables (15A54)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized inverses of matrices over integral domains
• On Hensel factorization. I
• On Generalized Inverses of Matrices over Principal Ideal Rings
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Multivariate Polynomial Factorization
• The Exact Solution of Linear Equations with Rational Function Coefficients
• An Improved Multivariate Polynomial Factoring Algorithm
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients